Discrete Networked Dynamic Systems Analysis and Performance
-
- Taschenbuch
- eBook ausgewählt
-
Form:Einzelkauf Download
-
Sprache:Englisch
113,00 €
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
ePUB 3
Kopierschutz
Nein
Family Sharing
Nein
Text-to-Speech
Ja
Erscheinungsdatum
22.10.2020
Verlag
Elsevier Science & Techn.Seitenzahl
484 (Printausgabe)
Dateigröße
40847 KB
Sprache
Englisch
EAN
9780128236994
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.
- This book addresses advanced analytical tools for characterization control, estimation and design of networked dynamic systems over fixed, probabilistic and time-varying graphs
- Provides coherent results on adopting a set-theoretic framework for critically examining problems of the analysis, performance and design of discrete distributed systems over graphs
- Deals with both homogeneous and heterogeneous systems to guarantee the generality of design results
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.
- This book addresses advanced analytical tools for characterization control, estimation and design of networked dynamic systems over fixed, probabilistic and time-varying graphs
- Provides coherent results on adopting a set-theoretic framework for critically examining problems of the analysis, performance and design of discrete distributed systems over graphs
- Deals with both homogeneous and heterogeneous systems to guarantee the generality of design results
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice