Discrete Networked Dynamic Systems Analysis and Performance - Magdi S. Mahmoud,Yuanqing Xia
-20% with code BOOKS
Shipping in 10-16 days
30-day return policy
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 structu ... Full description
You May Also Like
TOP
INCOSE Systems Engineering Handbook
-20% with code BOOKS
In stock at our supplier
TOP
If Anyone Builds It, Everyone Dies: The Case Against Superintelligent AI
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
The Design of Everyday Things
-20% with code BOOKS
In stock at our supplier
TOP
Open Circuits: The Inner Beauty of Electronic Components
Eric Schlaepfer, Windell Oskay
-20% with code BOOKS
In stock at our supplier
TOP
Get started with MicroPython on Raspberry Pi Pico: The Official Raspberry Pi Pico Guide
-20% with code BOOKS
In stock at our supplier
TOP
Practical Electronics for Inventors
-20% with code BOOKS
In stock at our supplier
TOP
Nucleo Boards Programming with the STM32CubeIDE: Hands-on in more than 50 projects
-20% with code BOOKS
In stock at our supplier
TOP
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Steven L. Brunton, J. Nathan Kutz
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Aerodynamics ISE
Christopher Cadou, John D. Anderson
-20% with code BOOKS
In stock at our supplier
TOP
Black Holes: The Key to Understanding the Universe
-20% with code BOOKS
In stock at our supplier
TOP
KiCad Like A Pro - Fundamentals and Projects: Getting started with the world's best open-source PCB tool
-20% with code BOOKS
In stock at our supplier
TOP
How To Read Water: Clues & Patterns from Puddles to the Sea
-20% with code BOOKS
In stock at our supplier
TOP
Foundations of Flavor: The Noma Guide to Fermentation: Including Step-By-Step Information on Making and Cooking with: Koji, Kombuchas, Shoyus, Misos, Vinegars, Garums, Lacto-Ferments and black Fruits Vegetables
-20% with code BOOKS
In stock at our supplier
TOP
Make: Electronics: Learning by Discovery: A hands-on primer for the new electronics enthusiast
-20% with code BOOKS
In stock at our supplier
TOP
The Idea Factory: Bell Labs and the Great Age of American Innovation
-20% with code BOOKS
In stock at our supplier
TOP
Flowers For Algernon: A Modern Literary Classic
-20% with code BOOKS
In stock at our supplier
TOP
Professional SMD Assembly: Practical Low-Cost Methods for Reliable PCB Production
-20% with code BOOKS
In stock at our supplier
TOP
Blood in the Machine: The Origins of the Rebellion Against Big Tech
-20% with code BOOKS
In stock at our supplier
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.
More Information
| Author | Magdi S. Mahmoud, Yuanqing Xia |
|---|---|
| Publisher | Elsevier Science |
| Release year | 2020 |
| Cover type | Softcover |
| EAN | 9780128236987 |