The DOI matches its Crossref record.
Graph Theoretic Methods in Multiagent Networks
Abstract
This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
A survey of multi-agent formation control
Oh, K.-K., Park, M.-C., & Ahn, H.-S. (2015) · Automatica · doi:10.1016/j.automatica.2014.10.022 · Cited by 2,457
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
“In the consensus literature [36], [38], [40], this property is normally referred to as “balanced” tout-court (see [14], though).”
BackgroundSynchronization in complex networks of phase oscillators: A survey
Dörfler, F., & Bullo, F. (2014) · Automatica · doi:10.1016/j.automatica.2014.04.012 · Cited by 1,149
“…2007; Suykens and Osipov, 2008; Arenas et al., 2008), and its linearization is the well-known consensus protocol studied in networked control, see the surveys and monographs (Olfati-Saber et al., 2007; Ren et al., 2007; Bullo et al., 2009; Garin and Schenato, 2010; Mesbahi and Egerstedt, 2010).”
BackgroundDistributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
“ource localization, and robust estimation, and has been intensively studied in recent years, see e.g. [1], [2], [3], [4], [5], [6]. Most of these works build on consensusbased dynamics [7], [8], [9], [10] to design discrete-time algorithms that find the solution of the optimization problem. A recent exception are the w…”
BackgroundDissipation of stop-and-go waves via control of autonomous vehicles: Field experiments
Stern, R. E., Cui, S., Delle Monache, M. L., Bhadani, R., Bunting, M., Churchill, M., Hamilton, N., Haulcy, R., Pohlmann, H., Wu, F., et al. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.02.005 · Cited by 800
“The control of complex multi-agent systems has impact beyond vehicular traffic flow, including coordinated robots [69], social networks [70], animal swarming [71, 72], and many other applications.”
BackgroundSafety Barrier Certificates for Collisions-Free Multirobot Systems
Wang, L., Ames, A. D., & Egerstedt, M. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2017.2659727 · Cited by 795
“Thus, what is ultimately deployed on the system is a combination of a “formally” designed nominal controller together with a “hand-crafted” collision avoidance algorithm, as discussed in [4], [5], [7], with the basic idea being that the multirobot system executes the nominal, primary controller most of the time, while…”
MethodSelf-citationA Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
“It is well-known that the matrix L gives rise to a stable system under the following conditions on the underlying graph: 1) Undirected time-invariant graph: the graph is connected [56].”
BackgroundControl principles of complex systems
Liu, Y.-Y., & Barabási, A.-L. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.035006 · Cited by 654
“Adaptive networks, also known as state-dependent dy- namic networks in control theory (Mesbahi, 2005; Mesbahi and Egerstedt, 2010), are collections of units that interact through a network, whose topology evolves as the state of the units changes with time.”
BackgroundA tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
“In the literature on multi-agent control, the model (10) has recently been rediscovered as a continuous-time consensus algorithm [65, 108, 109].”
BackgroundDynamic Event-Triggered and Self-Triggered Control for Multi-agent Systems
Yi, X., Liu, K., Dimarogonas, D. V., & Johansson, K. H. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2874703 · Cited by 550
“Lemma 1 ([16], [30]): If a graph G is connected, then its Laplacian matrix L is positive semidefinite, i.”
BackgroundEvent based agreement protocols for multi-agent networks
Meng, X., & Chen, T. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.002 · Cited by 538
“…for multi-agent systems by research papers (Arcak, 2007; Cortés, 2008; Jadbabaie, Lin, & Morse, 2003; Lin, Broucke, & Francis, 2004; Moreau, 2005; Olfati-Saber & Murray, 2004; Tanner, Jadbabaie, & Pappas, 2007; Xiao & Wang, 2008) and monographs (Mesbahi & Egerstedt, 2010; Ren & Beard, 2008).”
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
“The following concepts of graph theory can be found in Mesbahi & Egerstedt (2010).”
BackgroundBearing Rigidity and Almost Global Bearing-Only Formation Stabilization
Zhao, S., & Zelazo, D. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2459191 · Cited by 463
“Therefore, A has a similar structure as graph Laplacian [21].”
BackgroundMethodConsensus in multi-agent systems: a review
Amirkhani, A., & Barshooi, A. H. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10097-x · Cited by 476
“Linear systems can only achieve asymptotic convergence, and usually there is no guarantee for reaching consensus in a finite time (Mesbahi and Egerstedt 2010); while in reality, and according to system theory, it is necessary to have controllers that can reach consensus in the least possible time.”
BackgroundControlling Complex Networks: How Much Energy Is Needed?
Yan, G., Ren, J., Lai, Y.-C., Lai, C.-H., & Li, B. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.218703 · Cited by 413
Concurrent learning for convergence in adaptive control without persistency of excitation
Chowdhary, G., & Johnson, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717148 · Cited by 419
“Such gradient based parameter update laws have been used for NN training [36], in system identification, and in decentralized control of networked robots [27].”
BackgroundMethodInfluentialGraph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
Self-citationValcher, M. E., & Misra, P. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.01.006 · Cited by 415
“…formulated as that of a group of agents exchanging information with the objective of reaching a common decision, a consensus, by resorting to distributed algorithms that make use of the information that each agent collects from neighboring agents (see, e.g. [2, 11, 12, 15, 19, 20, 21, 24, 25, 27].”
BackgroundInterval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
Stankovic, M. S., Johansson, K. H., & Stipanovic, D. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174678 · Cited by 358
“, [29], [30]) with time-varying gains ( ), so that we can choose standard Lyapunov function applied to these problems (see, e.”
MethodOpinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization
Proskurnikov, A. V., Matveev, A. S., & Cao, M. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2471655 · Cited by 357
“The properties of cooperative protocols (14) are widely known [1], [2], [49].”
BackgroundZhang, D., Liu, L., & Feng, G. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2806387 · Cited by 349
“For more details on the graph theory, please see [33].”
BackgroundControl Centrality and Hierarchical Structure in Complex Networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044459 · Cited by 320
Robust Synchronization of Uncertain Linear Multi-Agent Systems
Trentelman, H. L., Takaba, K., & Monshizadeh, N. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2239011 · Cited by 315
“Many properties of networked systems can be expressed in terms of the spectrum of the Laplacian, see [13], [30].”
BackgroundYi, P., Hong, Y., & Liu, F. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.06.006 · Cited by 306
Distributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
A tutorial on modeling and analysis of dynamic social networks. Part II
Proskurnikov, A. V., & Tempo, R. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.03.005 · Cited by 294
Overview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
“It is not concerned with the performance evolution in the network dimension, in particular, as the length of the network dimension is finite, denoted by N .”
BackgroundAn operator splitting approach for distributed generalized Nash equilibria computation
Yi, P., & Pavel, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.008 · Cited by 271
“Graph theory The following concepts are reviewed from Mesbahi & Egerstedt (2010).”
Differentially private iterative synchronous consensus
Huang, Z., Mitra, S., & Dullerud, G. (2012) · Proceedings of the 2012 ACM workshop on Privacy in the electronic society · doi:10.1145/2381966.2381978 · Cited by 280
“ry and sucient conditions for achieving consensus with synchronous mechanisms, including cases where the matrix P is time-varying, have been studied in [21, 17] (see the book for a complete overview [14]). Sucient conditions for achieving consensus with message delays and losses has been developed in [22, 3] and more…”
BackgroundDistributed event-triggered coordination for average consensus on weight-balanced digraphs
Nowzari, C., & Cortés, J. (2016) · Automatica · doi:10.1016/j.automatica.2016.01.069 · Cited by 275
“The literature on multi-agent average consensus is vast, see e.g., [Olfati-Saber et al., 2007, Ren and Beard, 2008, Mesbahi and Egerstedt, 2010] and references therein.”
A Distributed Economic Dispatch Strategy for Power–Water Networks
Li, P., Hu, J., Qiu, L., Zhao, Y., & Ghosh, B. K. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3104103 · Cited by 267
A Survey on Formation Control of Small Satellites
Liu, G.-P., & Zhang, S. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2794879 · Cited by 256
“Using the polar diagram theory, the existence of a set of control series was studied to obtain an arbitrary expectation communication topology sequence [125].”
MethodControl Barrier Certificates for Safe Swarm Behavior
Borrmann, U., Wang, L., Ames, A. D., & Egerstedt, M. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.11.154 · Cited by 239
“…this significantly increases the complexity of the design-task and, more importantly, makes the many proposed design tools (see the textbooks Bullo et al. (2009); Mesbahi and Egerstedt (2010); Ren and Beard (2008) for a representative sample of these tools and techniques) no longer applicable.”
BackgroundSelf-citationResilient consensus of second-order agent networks: Asynchronous update rules with delays
Dibaji, S. M., & Ishii, H. (2017) · Automatica · doi:10.1016/j.automatica.2017.03.008 · Cited by 228
“In particular, we follow the approach generally assumed in asynchronous consensus for the case without malicious agents; see, e.g., (Mesbahi and Egerstedt 2010, Su et al. 1998, Xiao and Wang 2006) for single-integrator networks and (Lin and Jia 2009, Liu and Liu 2012, Qin and Gao 2012, Qin et al.…”
BackgroundInfluentialOn the Reachability and Observability of Path and Cycle Graphs
Parlangeli, G., & Notarstefano, G. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2168912 · Cited by 223
“In [8] and [9], see also [2], necessary conditions for”
BackgroundTopological Signal Processing Over Simplicial Complexes
Barbarossa, S., & Sardellitti, S. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2981920 · Cited by 224
“If we use a graph-based approach, we can build a basis of the observed flow signals using the eigenvectors of the so called edge Laplacian in [35], i.”
BackgroundMethodInterconnected dynamic systems: An overview on distributed control
(2013) · IEEE Control Systems · doi:10.1109/mcs.2012.2225929 · Cited by 217
“An alternative approach to formation control is achieved by considering a distributed algorithm that determines a target for each agent without a priori assignment; those are then driven to the corresponding target by common path planning techniques [34], [35], [6].”
BackgroundMethodWilson, S., Glotfelter, P., Wang, L., Mayya, S., Notomista, G., Mote, M., & Egerstedt, M. (2020) · IEEE Control Systems · doi:10.1109/mcs.2019.2949973 · Cited by 218
“FEBRUARY 2020 « IEEE CONTROL SYSTEMS 27 The technical developments in multiagent robotics have, in no small part, been driven by control innovations, such as coordinated control strategies for forming shapes or covering areas [11], [12].”
BackgroundSelf-citationDecision Making in Multiagent Systems: A Survey
Rizk, Y., Awad, M., & Tunstel, E. W. (2018) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2018.2840971 · Cited by 219
“Decision making in MAS have been modeled as graphs with nodes representing agents and edges representing interactions and information flow among agents [130].”
BackgroundEdge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
Zelazo, D., & Mesbahi, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2056730 · Cited by 213
“Applications of such systems are far reaching and include problems such as formation flying, coordinated robotics, sensor fusion, and distributed computation [2]–[6], [15], [20], [21], [27], [19].”
BackgroundSelf-citationA Differential Game Approach to Multi-agent Collision Avoidance
Mylvaganam, T., Sassano, M., & Astolfi, A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2680602 · Cited by 211
“, N , and ξ1(0) = [−4, 5]>, ξ2(0) = [5,−4]>, ξ3(0) = [8,−1]>, ξ4(0) = [1, 8]>, ξ5(0) = [−45,−1]>, ξ6(0) = [35, 1] >, ξ7(0) = [7,−30]>, ξ8(0) = [−8, 25]>, ξ9(0) = [−4,−30]>, ξ10(0) = [4, 30]>, ξ11(0) = [−5, 2]> and ξ12(0) = [2, 1]>.”
BackgroundOn the dynamics of deterministic epidemic propagation over networks
Mei, W., Mohagheghi, S., Zampieri, S., & Bullo, F. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.09.002 · Cited by 208
“In [15], the stability of equilibria for the SEIR model is reviewed through Lyapunov and graph theory.”
MethodPredictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions
Altafini, C., & Lini, G. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2343371 · Cited by 209
“If we think of a distributed control problem on Γ(A) for the system (16), then L can be intended as obtained by choosing ui = − ∑ j∈adj(i) aij(xi − xj) [28], [36], or, in matrix form”
BackgroundCoordinated Control of Multi-Robot Systems: A Survey
Cortés, J., & Egerstedt, M. (2017) · SICE Journal of Control, Measurement, and System Integration · doi:10.9746/jcmsi.10.495 · Cited by 211
Self-citationBilateral Teleoperation of Groups of Mobile Robots With Time-Varying Topology
Franchi, A., Secchi, C., Son, H. I., Bulthoff, H. H., & Giordano, P. R. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2012.2196304 · Cited by 209
“In this context, teleoperation systems, where a human operator commands a remote robot through a local interface, allow to A. Franchi, H. I. Son, and P. Robuffo Giordano are with the Max Planck Institute for Biological Cybernetics, Spemannstraße 38, 72076 Tübingen, Germany {antonio.franchi, hyoungil.son, prg}@tuebing…”
BackgroundDynamic average consensus under limited control authority and privacy requirements
Kia, S. S., Cortés, J., & Martínez, S. (2015) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3178 · Cited by 199
Distributed convergence to Nash equilibria in two-network zero-sum games
Gharesifard, B., & Cortés, J. (2013) · Automatica · doi:10.1016/j.automatica.2013.02.062 · Cited by 188
“These works build on consensus-based dynamics (Olfati-Saber et al., 2007; Ren and Beard, 2008; Bullo et al., 2009; Mesbahi and Egerstedt, 2010) to find the solutions of the optimization problem in a variety of scenarios and are designed in discrete time.”
The Best-of-n Problem in Robot Swarms: Formalization, State of the Art, and Novel Perspectives
Valentini, G., Ferrante, E., & Dorigo, M. (2017) · Frontiers in Robotics and AI · doi:10.3389/frobt.2017.00009 · Cited by 194
“The community of control theory has intensively studied the problem of consensus achievement (Mesbahi and Egerstedt, 2010) with the objective of deriving optimal control strategies and proves their stability.”
BackgroundBarca, J. C., & Sekercioglu, Y. A. (2013) · Robotica · doi:10.1017/s026357471200032x · Cited by 187
Exotic states in a simple network of nanoelectromechanical oscillators
Matheny, M. H., Emenheiser, J., Fon, W., Chapman, A., Salova, A., Rohden, M., Li, J., Hudoba de Badyn, M., Pósfai, M., Duenas-Osorio, L., et al. (2019) · Science · doi:10.1126/science.aav7932 · Cited by 187
“This itself constitutes a viable strategy for network control (47, 48).”
BackgroundSelf-citationOnline Distributed Convex Optimization on Dynamic Networks
Hosseini, S., Chapman, A., & Mesbahi, M. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2525928 · Cited by 179
Self-citation(2012) · IEEE Control Systems · doi:10.1109/mcs.2012.2195411 · Cited by 178
“For an introduction to this topic, see [12] and [15].”
BackgroundSelf-citationBearing-Based Formation Control of A Group of Agents with Leader-First Follower Structure
Trinh, M. H., Zhao, S., Sun, Z., Zelazo, D., Anderson, B. D. O., & Ahn, H.-S. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836022 · Cited by 178
“For an acyclic directed graph, we define the parent set of a vertex vi as Pi = {vk| ∃ a directed path from vk to vi} [37].”
Leader–Follower Formation Control With Prescribed Performance Guarantees
Chen, F., & Dimarogonas, D. V. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3029155 · Cited by 177
Controllability and Observability of Grid Graphs via Reduction and Symmetries
Notarstefano, G., & Parlangeli, G. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2241493 · Cited by 171
““necessary and sufficient” conditions are provided to characterize the controllability and observability of path and cycle graphs in terms of simple rules from number theory. In [8] and [9], see also [10], necessary conditions for controllability, based on suitable properties of the graph, are provided. Other contribut…”
BackgroundThe synchronized dynamics of time-varying networks
Ghosh, D., Frasca, M., Rizzo, A., Majhi, S., Rakshit, S., Alfaro-Bittner, K., & Boccaletti, S. (2022) · Physics Reports · doi:10.1016/j.physrep.2021.10.006 · Cited by 173
A passivity-based decentralized strategy for generalized connectivity maintenance
Robuffo Giordano, P., Franchi, A., Secchi, C., & Bülthoff, H. H. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364912469671 · Cited by 169
“For a more comprehensive treatment, we refer the interested reader to any of the existing books on this topic, for instance Mesbahi and Egerstedt (2010). Let G = (V , E) be an undirected graph with vertex set V = {1 .”
MethodDistributed Strategies for Generating Weight-Balanced and Doubly Stochastic Digraphs
Gharesifard, B., & Cortés, J. (2012) · European Journal of Control · doi:10.3166/ejc.18.539-557 · Cited by 171
Robust Consensus of Linear Feedback Protocols Over Uncertain Network Graphs
Li, Z., & Chen, J. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2685082 · Cited by 169
“Lemma 1 ([19]): For a weighted undirected graph L = DWDT , where W ∈ R ×M is a diagonal matrix, with positive aij [i.”
BackgroundRobust Fault Estimation Using Relative Information in Linear Multi-Agent Networks
Menon, P. P., & Edwards, C. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2274689 · Cited by 167
“The smallest eigenvalue of is zero and the corresponding eigenvector is given by [25].”
BackgroundDDF-SAM: Fully distributed SLAM using Constrained Factor Graphs
Cunningham, A., Paluri, M., & Dellaert, F. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5652875 · Cited by 164
Distributed Estimation and Control for Leader-Following Formations of Nonholonomic Mobile Robots
Miao, Z., Liu, Y.-H., Wang, Y., Yi, G., & Fierro, R. (2018) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2018.2810253 · Cited by 165
“INTRODUCTION D ISTRIBUTED control of multiple mobile robots has emerged as an active research area within the control and robotics communities over the past decade [1]–[3].”
BackgroundConsensus-Based Distributed Economic Dispatch Control Method in Power Systems
Li, Q., Gao, D. W., Zhang, H., Wu, Z., & Wang, F.-Y. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2756041 · Cited by 165
“The consensus protocol for vertex vi can be designed as an update formula in discrete-time as follows [15],”
MethodResilient Randomized Quantized Consensus
Dibaji, S. M., Ishii, H., & Tempo, R. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/acc.2016.7526165 · Cited by 158
“In this section, we recall some concepts on graphs [19].”
BackgroundInfluentialDecentralized time-varying formation control for multi-robot systems
Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364913519149 · Cited by 159
“Recent studies are summarized in Mesbahi and Egerstedt (2010) and Ren and Beard (2008), while in Olfati-Saber et al. (2007) and Ren et al. (2007) the consensus algorithms are investigated with an emphasis on robustness, time-delays, and performance bounds.”
BackgroundControllability and Observability of Network-of-Networks via Cartesian Products
Chapman, A., Nabi-Abdolyousefi, M., & Mesbahi, M. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2328757 · Cited by 153
“Network controllability becomes important when a networked system is influenced or observed by an external entity; such scenarios include networked robotics [16], [17], human-swarm interactions [18], network security [19], [20], and quantum networks [21].”
BackgroundSelf-citationPavel, L. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2922953 · Cited by 159
“If agent i can get information from agent j , then ( j, i ) ∈ E and agent j belongs to agent i ’s neighbor set and connected if any two agents are connected [33].”
BackgroundProtocols Design and Uncontrollable Topologies Construction for Multi-Agent Networks
Ji, Z., Lin, H., & Yu, H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2335971 · Cited by 156
“Driven by its wide applications and advantages in robustness, adaptiveness and fault tolerance, multi-agnet system has attracted a lot of researchers’ attention [5], [6], [16].”
BackgroundMatrix-weighted consensus and its applications
Trinh, M. H., Nguyen, C. V., Lim, Y., et al. (2018) · Automatica · doi:10.1016/j.automatica.2017.12.024 · Cited by 155
Collective decision with 100 Kilobots: speed versus accuracy in binary discrimination problems
Valentini, G., Ferrante, E., Hamann, H., & Dorigo, M. (2015) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-015-9323-3 · Cited by 175
“Additionally, the control theory community has intensively studied the problem of consensus achievement [13,23,30,31,35].”
BackgroundUpper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
Zhang, S., Cao, M., & Camlibel, M. K. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2275666 · Cited by 144
“For example, the controllability problem has been related to the problem of controlling a formation of mobile robots by manipulating the trajectories of the leaders such that all the robots can move from any initial positions to any desired final positions within finite time [9].”
BackgroundAlmost Global Consensus on the $n$ -Sphere
Markdahl, J., Thunberg, J., & Gonçalves, J. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2752799 · Cited by 147
“Since the graph is connected, and fij (0) is strictly positive for all {i, j} ∈ E , it follows that (12) reaches consensus exponentially if yi(0) ∈ H for all i ∈ V [1].”
BackgroundDistributed Luenberger observer design
Kim, T., Shim, H., & Cho, D. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799336 · Cited by 143
“In order to inspect (13) for η ∈ R , we consider the error state space R as E0 ⊕ E⊥ 0 where the agreement set E0 [10] is defined as E0 := {η ∈ R : ηi = ηj ,∀i, j ∈ N}.”
Chen, W., Li, X., & Jiao, L. (2013) · Automatica · doi:10.1016/j.automatica.2013.04.002 · Cited by 141
Clark, A., Bushnell, L. G., & Poovendran, R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2281473 · Cited by 132
Decentralized control of partially observable Markov decision processes
Amato, C., Chowdhary, G. V., Geramifard, A., Üre, N. K., & Kochenderfer, M. J. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760239 · Cited by 180
“based multiagent control [12], [16], [17], which assumes a given behavior rather than optimizing the action choices given the limited information.”
BackgroundControlling complex networks with complex nodes
D’Souza, R. M., di Bernardo, M., & Liu, Y. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00566-3 · Cited by 146
“Again, approaches from control such as structural observability theory have been used to this aim 82,86–88 .”
BackgroundMethodOn strong structural controllability of networked systems: A constrained matching approach
Chapman, A., & Mesbahi, M. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580798 · Cited by 135
“Commonly, for a linear-time-invariant networked system of single-integrator agents, the graph G characterizes the zero structure of the state matrix through A(G), and input and output points to the network appear in the input and output matrices [11].”
BackgroundSelf-citationZero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
Monshizadeh, N., Zhang, S., & Camlibel, M. K. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2308619 · Cited by 134
“Examples include the cases where X is adjacency [10], (in-degree or out-degree) Laplacian [15], normalized Laplacian [1], etc. matrices associated to a graph.”
Network Flows That Solve Linear Equations
Shi, G., Anderson, B. D. O., & Helmke, U. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2612819 · Cited by 128
“In fact, we have wi > 0 for all i ∈ V if G§ is strongly connected [6].”
BackgroundDistributed Deception Attack Detection in Platoon-Based Connected Vehicle Systems
Ju, Z., Zhang, H., & Tan, Y. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2980137 · Cited by 131
“In this system, the communication relationship between vehicles is described by an undirected graph [41] G = {V, E}, where V = {1, .”
BackgroundActive Target Tracking and Cooperative Localization for Teams of Aerial Vehicles
Morbidi, F., & Mariottini, G. L. (2012) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2221092 · Cited by 130
“Multiagent systems research has recently gained a prominent role in the robotics and control literature [1]–[3].”
BackgroundAn overview on multi-agent consensus under adversarial attacks
Ishii, H., Wang, Y., & Feng, S. (2022) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2022.01.004 · Cited by 138
Algorithms for Leader Selection in Stochastically Forced Consensus Networks
Lin, F., Fardad, M., & Jovanovic, M. R. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2314223 · Cited by 152
“Furthermore, we establish an equivalence between two problem formulations when all leaders use arbitrarily large feedback gains on their own states.”
Consensus of second-order multi-agent systems in the presence of locally bounded faults
Dibaji, S. M., & Ishii, H. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.02.005 · Cited by 125
“Here, we consider consensus, one of the basic problems in multi-agent systems, where the objective is agreement on some state values among the agents [6].”
BackgroundConsensus in the network with uniform constant communication delay
Wang, X., Saberi, A., Stoorvogel, A. A., et al. (2013) · Automatica · doi:10.1016/j.automatica.2013.04.023 · Cited by 124
Multi-Agent Deployment in 3-D via PDE Control
Qi, J., Vázquez, R., & Krstić, M. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2361197 · Cited by 123
Online distributed optimization via dual averaging
Hosseini, S., Chapman, A., & Mesbahi, M. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760092 · Cited by 130
Self-citationLearning to cooperate: Networks of formation agents with switching topologies
Meng, D., & Moore, K. L. (2015) · Automatica · doi:10.1016/j.automatica.2015.11.013 · Cited by 120
On the Robustness of Uncertain Consensus Networks
Zelazo, D., & Bürger, M. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2485458 · Cited by 120
“In this paper, we consider the linear weighted consensus protocol [1] in the presence of exogenous finite-energy disturbances.”
BackgroundMethod1Algorithms for Leader Selection in Stochastically Forced Consensus Networks
Fu, L., Fardad, M., Jovanović, M. R., et al. (2016) · Cited by 120
Decentralized Consensus Control of a Rigid-Body Spacecraft Formation with Communication Delay
Nazari, M., Butcher, E. A., Yucelen, T., & Sanyal, A. K. (2016) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g001396 · Cited by 120
“This is a standard assumption for digraphs where every pair of separate vertices are connected through a directed path [25,26].”
BackgroundFreudenthaler, G., & Meurer, T. (2020) · Automatica · doi:10.1016/j.automatica.2020.108897 · Cited by 117
“…consensus and synchronisation problems, decision making, crowd dynamics, formation control, cooperative multi-vehicle control, or complex oscillators networks (Olfati-Saber et al., 2007; Murray, 2007; Mesbahi and Egerstedt, 2010; Easley and Kleinberg, 2010; Dörfler and Bullo, 2014; Bullo, 2018).”
BackgroundMulti-agent distributed coordination control: Developments and directions via graph viewpoint
Wang, X., Zeng, Z., & Cong, Y. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.03.021 · Cited by 121
Network structure of two-dimensional decaying isotropic turbulence
Taira, K., Nair, A. G., & Brunton, S. L. (2016) · Journal of Fluid Mechanics · doi:10.1017/jfm.2016.235 · Cited by 126
Consensus-Based Distributed Cooperative Learning From Closed-Loop Neural Control Systems
Chen, W., Hua, S., & Zhang, H. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2315535 · Cited by 116
Finite-time coordination in multiagent systems using sliding mode control approach
Ghasemi, M., & Nersesov, S. G. (2014) · Automatica · doi:10.1016/j.automatica.2014.02.019 · Cited by 112
Metadata
- Authors
- Mesbahi, M., & Egerstedt, M.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 2010-12-31
- OpenAlex
- W613360614
- Cited by
- 2,897
- References
- 0
- Citations by year
- 2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
- FWCI
- 74.30
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Princeton University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.