Discrete Networked Dynamic Systems
eBook - ePub

Discrete Networked Dynamic Systems

Analysis and Performance

  1. 484 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Discrete Networked Dynamic Systems

Analysis and Performance

About this book

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

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Discrete Networked Dynamic Systems by Magdi S. Mahmoud,Yuanqing Xia,Magdi S Mahmoud in PDF and/or ePUB format, as well as other popular books in Technology & Engineering & Mechanical Engineering. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Discrete Networked Dynamic Systems
  2. Cover
  3. Title Page
  4. Copyright
  5. Dedication
  6. Table of Contents
  7. About the authors
  8. Preface
  9. Acknowledgement
  10. Chapter 1 Mathematical background and examples
  11. 1.3: Elements of algebraic graphs
  12. 1.6: Motivating problems
  13. 1.6.1: Wireless sensor networks
  14. Chapter 2 Structural and performance patterns
  15. 2.7: Agent feedback stability
  16. 2.10: Notes
  17. References
  18. Chapter 3 Consensus of systems over graphs
  19. 3.2: Multiagent systems with diverse time delays
  20. 3.4: Performance of agreement protocol
  21. 3.4.1: Introduction
  22. Chapter 4 Energy-based cooperative control
  23. 4.1.4: Event-triggered protocol
  24. 4.2.3: Stability results
  25. 4.3: Consensus tracking of saturated systems
  26. 4.3.1: Introduction
  27. Chapter 5 Performance of consensus algorithms
  28. 5.4: Leader following consensus
  29. 5.5: Stochastic approximation algorithms
  30. 5.5.1: Problem formulation
  31. Chapter 6 Event-based coordination control
  32. 6.2: Discrete two-timescale systems
  33. 6.3: Networks of two-timescale systems
  34. 6.3.1: Synchronization using local information
  35. Chapter 7 Advanced approaches to multiagent coordination
  36. 7.1: Synchronization of stochastic dynamic networks
  37. 7.1.3: Simulation example 7.1
  38. 7.3: Event-based tracking control
  39. 7.4: Robust output regulation
  40. 7.6: Notes
  41. References
  42. Chapter 8 State estimation techniques
  43. 8.2: Nonlinear state estimation
  44. 8.3: Distributed filtering with saturation
  45. 8.3.2: Design results
  46. 8.3.3: Simulation example 8.4
  47. Chapter 9 Advanced distributed filtering
  48. 9.2: Kalman filtering with intermittent communications
  49. 9.2.3: Modified centralized multisensor system
  50. 9.5: Information-based covariance intersection filter
  51. 9.5.13: Measurement fusion method
  52. 9.5.14: State vector fusion method
  53. Index