Discrete Networked Dynamic Systems: Analysis and Performance

Discrete Networked Dynamic Systems: Analysis and Performance is a book that provides a systematic analysis of a general class of linear discrete-time dynamic systems interconnected over an information network, focusing on the wide-sense consensus problem. It relies heavily on algebraic graph theory and topology to derive results, and discusses the importance of graphs in the analysis of interactions between multiagent/distributed systems.

\n Format: Paperback / softback
\n Length: 484 pages
\n Publication date: 23 October 2020
\n Publisher: Elsevier Science Publishing Co Inc
\n

Discrete Networked Dynamic Systems: Analysis and Performance delves into a comprehensive exploration of a broad category of linear discrete-time dynamic systems interconnected through an information network, facilitating the exchange of relative state measurements or output measurements. This book offers a systematic analysis of the subject matter, seamlessly integrating mathematical advancements into a unified narrative. The topics presented in this book are organized along four dimensions: Agent, Environment, Interaction, and Organization, while maintaining a global and local perspective. The central focus revolves around the wide-sense consensus problem in discrete networked dynamic systems. The authors employ algebraic graph theory and topology as fundamental tools to derive their findings. It is widely acknowledged that graphs play a pivotal role in analyzing the interactions between multiagent/distributed systems. Graph-theoretic analysis sheds light on the significance of topological interactions in fostering coordination among agents. The literature encompasses a diverse range of graphs, each characterized by its unique edge set. A simple graph lacks self-loops or edges, while complete graphs are characterized by an edge connecting every pair of vertices. Bipartite graphs possess a partitioning of the vertex set into disjoint non-empty vertex sets, enabling an edge to connect every vertex in one set to every vertex in the other. Random graphs exhibit fixed vertex sets but exhibit stochastic behavior modeled by probability functions. A significant portion of studies in coordination control is based on deterministic/fixed graphs, switching graphs, and random graphs.

\n Weight: 768g\n
Dimension: 154 x 230 x 28 (mm)\n
ISBN-13: 9780128236987\n \n