0
Your cart

Your cart is empty

Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics

Buy Now

Discrete Networked Dynamic Systems - Analysis and Performance (Paperback) Loot Price: R2,649
Discovery Miles 26 490
Discrete Networked Dynamic Systems - Analysis and Performance (Paperback): Magdi S. Mahmoud, Yuanqing Xia

Discrete Networked Dynamic Systems - Analysis and Performance (Paperback)

Magdi S. Mahmoud, Yuanqing Xia

 (sign in to rate)
Loot Price R2,649 Discovery Miles 26 490 | Repayment Terms: R248 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Academic Press Inc
Country of origin: United States
Release date: October 2020
First published: 2021
Authors: Magdi S. Mahmoud • Yuanqing Xia
Dimensions: 229 x 152 x 28mm (L x W x T)
Format: Paperback
Pages: 484
ISBN-13: 978-0-12-823698-7
Categories: Books > Professional & Technical > Mechanical engineering & materials > Mechanical engineering > General
Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics
Promotions
LSN: 0-12-823698-1
Barcode: 9780128236987

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners