Discrete Networked Dynamic Systems
Analysis and Performance
Published on 23. October 2020
Book
Paperback/Softback
484 pages
978-0-12-823698-7 (ISBN)
Description
Discrete Networked Dynamic Systems: Analysis and Performance provides a high-level treatment of a general class of linear discrete-time dynamic systems interconnected over an information network, exchanging relative state measurements or output measurements. It presents a systematic analysis of the material and provides an account to the math development in a unified way.
The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints.
The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs.
The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints.
The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs.
More details
Language
English
Place of publication
San Diego
United States
Publishing group
Elsevier Science Publishing Co Inc
Target group
Professional and scholarly
Dimensions
Height: 229 mm
Width: 152 mm
Weight
810 gr
ISBN-13
978-0-12-823698-7 (9780128236987)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
E-Book
10/2020
Academic Press
€113.00
Available for download
Persons
Magdi S. Mahmoud is a distinguished professor at King Fahd University of Petroleum and Minerals (KFUPM), Saudi Arabia. He has been faculty member at different universities worldwide including Egypt (CU, AUC), Kuwait (KU), UAE (UAEU), UK (UMIST), USA (Pitt, Case Western), Singapore (Nanyang), and Australia (Adelaide). He lectured in Venezuela (Caracas), Germany (Hanover), UK (Kent), USA (UoSA), Canada (Montreal) and China (BIT, Yanshan). He is the principal author of 51 books, inclusive book-chapters, and author/co-author of more than 610 peer-reviewed papers. He is a fellow of the IEE and a senior member of the IEEE, the CEI (UK). He is currently actively engaged in teaching and research in the development of modern methodologies to distributed control and filtering, networked control systems, fault-tolerant systems, cyberphysical systems, and information technology. Yuanqing Xia has worked in the Department of Automatic Control, Beijing Institute of Technology, Beijing, since 2004, first as an associate professor, and, since 2008, as a professor. He is a Yangtze River Scholar and Chair Professor of the Beijing Institute of Technology since 2016. His current research interests are in the fields of networked control systems, robust control, sliding mode control, active disturbance rejection control, biomedical signal processing, and cloud control systems.
Content
1. Mathematical background and examples
2. Structural and performance patterns
3. Consensus of systems over graphs
4. Energy-based cooperative control
5. Performance of consensus algorithms
6. Event-based coordination control
7. Advanced approaches to multiagent coordination
8. State estimation techniques
9. Advanced distributed filtering
2. Structural and performance patterns
3. Consensus of systems over graphs
4. Energy-based cooperative control
5. Performance of consensus algorithms
6. Event-based coordination control
7. Advanced approaches to multiagent coordination
8. State estimation techniques
9. Advanced distributed filtering