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
Items 1,501–1,600 of 2,960
Mark, A., Xu, Y., & Dickinson, B. T. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2018.2859908 · Cited by 5
“From [25], it is seen that the convergence rate is related to the smallest positive eigenvalue of L.”
BackgroundMethodInfluentialMitigation of communication failures in distributed model predictive control strategies
Ananduta, W., Barreiro‐Gomez, J., Ocampo‐Martínez, C., et al. (2018) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.5044 · Cited by 5
“It is based on the distributed projection dynamics (DPD) [17], [18] and can also be perceived as a distributed consensus protocol [19].”
BackgroundRobust synchronization of linear multi-agent system with input/output constraints
Takaba, K. (2018) · Artificial Life and Robotics · doi:10.1007/s10015-018-0491-5 · Cited by 5
Motion Planning, Formation Control and Obstacle Avoidance for Multi-Agent Systems
Possieri, C., & Sassano, M. (2018) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2018.8511391 · Cited by 5
“These techniques are collectively referred to as multi-agent models [1], [2], [3], which include for instance the problems of collaborative, cooperative and formation control, [4], [5], [6], [7], [8], [9], [10], [11].”
MethodA Distributed Optimization Approach to Consistent Multiway Matching
Leonardos, S., & Daniilidis, K. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619511 · Cited by 5
“For an in depth analysis, we refer the reader to [8], [19].”
BackgroundLi, B., Li, S., Wu, J., & Qi, H. (2018) · Scientific Reports · doi:10.1038/s41598-018-21069-7 · Cited by 5
“The expectation is that more advanced algorithms may be developed for a variety of control, computation, and estimation tasks over complex quantum networks on top of such foundations, as witnessed in the engineering of classical networks in the past decades [15].”
BackgroundDistributed multi-task formation control under parametric communication uncertainties
Han, D., & Panagou, D. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263698 · Cited by 5
“A relationship between L(t) and the connectedness of G(t) is given in [16], [17]: Lemma 1: Let λ1(L(t)) ≤ λ2(L(t)) ≤ · · · ≤ λN (L(t)) be the ordered eigenvalues of L(t).”
BackgroundEfficient Computation of H2 Performance on Series-Parallel Networks
de Badyn, M. H., & Mesbahi, M. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814989 · Cited by 5
“Several famous models for graph design are scale-free networks [22] and the Erdos-Renyi random graph model [10].”
MethodSelf-citationMulti-agent formation control using angle measurements
Chen, L., Cao, M., Li, C., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814738 · Cited by 5
Liu, Z., Saberi, A., Stoorvogel, A. A., et al. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8832812 · Cited by 5
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1, 6, 8, 10, 12, 16, 23] and references therein).”
BackgroundRezaei, V., & Stefanovic, M. (2020) · AIAA SciTech Forum · doi:10.2514/6.2020-1077 · Cited by 5
Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Ascent
Lin, Y., Shames, I., & Nešić, D. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029518 · Cited by 4
“The interconnection of the agents is described by an undirected graph G = (V, E) [10], where V = {1, 2, .”
Backgroundd-Path Laplacians and Quantum Transport on Graphs
Estrada, E. (2020) · Mathematics · doi:10.3390/math8040527 · Cited by 5
“The solution of this model, known in engineering as the consensus protocol [4,5], always converges in a connected graph to the average of the values of ~ Ψ0.”
MethodZhang, M., Saberi, A., & Stoorvogel, A. A. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147684 · Cited by 5
“The purpose of synchronization is to ensure an asymptotic agreement on a common state or output trajectory through distributed control protocols (see [1], [10], [13] and references therein).”
BackgroundVoronoi-based Geometric Distributed Fleet Control of a Multi-Robot System
Bertrand, S., Sarras, I., Eudes, A., & Marzat, J. (2020) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv50220.2020.9305373 · Cited by 6
“For the above reasons such type of formations are usually called rigid [3].”
BackgroundLinear Convergence for Distributed Optimization Without Strong Convexity
Yi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304381 · Cited by 8
“If the graph G is connected, then its Laplacian matrix L is positive semi-definite and null(L) = {1n}, see [27].”
BackgroundZhou, T., Liu, Q., & Wang, W. (2021) · IEEE Access · doi:10.1109/access.2021.3109984 · Cited by 5
“The above-mentioned content of graph theory can be found in [27].”
BackgroundSingh, S. K., & Jain, A. (2021) · Indian Control Conference · doi:10.1109/icc54714.2021.9703147 · Cited by 5
Security and Infiltration of Networks: A Structural Controllability and Observability Perspective
Chapman, A., & Mesbahi, M. (2013) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-01159-2_8 · Cited by 5
Self-citationCai, K., & Nagahara, M. (2022) · Advanced Robotics · doi:10.1080/01691864.2022.2093616 · Cited by 5
“• Theorem 3.1 is adapted from, e.g. [19,20], and Theorem 3.2 from, e.g. [16].”
InfluentialBipartite Consensus Control of Multi-agent Systems Under Multiple Denial-of-Service Cyber Attacks
Bhowmick, S., Halo, B., & Panja, S. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.04.114 · Cited by 5
Fard, N. E., & Šelmić, R. R. (2022) · Journal of Sensor and Actuator Networks · doi:10.3390/jsan11030045 · Cited by 5
Reduced Model Reconstruction Method for Stable Positive Network Systems
Sato, K. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3218620 · Cited by 5
“Model reduction of stable positive network systems is one of the most important topics, because the systems can model biological systems [1], [2], [3], [4], interconnected systems [5], [6], and multiagent systems [7].”
BackgroundConstruct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem
Rosati, R. M., Bouamama, S., & Blum, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-26504-4_22 · Cited by 5
A dwell-time approach for decentralized grid-aware operation of islanded DC microgrids
Jaramillo-Cajica, I., & Schiffer, J. (2023) · Automatica · doi:10.1016/j.automatica.2023.111461 · Cited by 5
Formation Control of Uncertain Multi-agent Systems with Non-Identical Actuation Capacities
Kurttisi, A., Sarioglu, N. E., & Dogan, K. M. (2024) · AIAA SciTech Forum · doi:10.2514/6.2024-0115 · Cited by 5
Aly, I. A., Kurttisi, A., & Dogan, K. M. (2024) · International Journal of Systems Science · doi:10.1080/00207721.2024.2328057 · Cited by 5
“Specifically, it is defined as where the spectrum of this Laplacian matrix for an undirected and connected graph G is ordered as (God-sil & Royle, 2001; Mesbahi & Egerstedt, 2010).”
BackgroundAssuring Safety of Vision-Based Swarm Formation Control
Hsieh, C., Koh, Y., Li, Y., et al. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644491 · Cited by 5
“Proof: The Lyapunov stability for the controller in [22] is a well-established result (see Chapter 6 in [3] for a detailed proof).”
BackgroundDigraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol
Rahimian, M. A., Ajorlou, A., & Aghdam, A. G. (2014) · Asian Journal of Control · doi:10.1002/asjc.868 · Cited by 8
“2 of [10], the existence of an out-branching root τ ∈ V is a necessary and sufficient condition for the states in (10) to converge to a common value.”
BackgroundTime Averaging Algorithms with Stopping Rules for Multi‐Agent Consensus with Noisy Measurements
Morita, R., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2016) · Asian Journal of Control · doi:10.1002/asjc.1349 · Cited by 5
Relative Tempo of Consensus Dynamics on Multiplex Networks
Shao, H., Xi, Y., Mesbahi, M., et al. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.444 · Cited by 5
Self-citationMasroor, S., Peng, C., Ali, Z. A., et al. (2018) · Wireless Personal Communications · doi:10.1007/s11277-018-5381-6 · Cited by 5
Consensus Control of Hierarchical Multi-agent Systems with Constant and Time-Varying Delays
Ghiasi, A. R., Aghbolagh, H. D., Hashemzadeh, F., et al. (2018) · Iranian Journal of Science and Technology Transactions of Electrical Engineering · doi:10.1007/s40998-018-0089-x · Cited by 5
Hermann, J., Betnhard, S., Konigorski, U., et al. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550396 · Cited by 5
“The following definitions and basic properties of graphs are taken from [12].”
Backgroundbin Azhar, A., & Kadri, M. B. (2018) · International Conference on Emerging Technologies · doi:10.1109/icet.2018.8603593 · Cited by 5
“An assignment to each robot using the Hungarian method [4] within the formation and then a leader-follower approach was applied by for the translation of graph based distribution introduced in [5].”
MethodAthalye, C. D., Pal, D., & Pillai, H. K. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2936409 · Cited by 5
Connectivity-Preserving Swarm Teleoperation With A Tree Network
Yang, Y., Constantinescu, D., & Shi, Y. (2019) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8968279 · Cited by 5
“= [( WD ⊗ In ) x ]T ( DD⊗ In ) [( WD ⊗ In ) x ] =x (Le ⊗ In) x, (12) where x = [x1 · · · xN−1] = (WD ⊗ In)x, with xk = ∇iψ(‖xij‖) for ek = (i, j), k = 1, · · · , N − 1, stacks the weighted position mismatches between all pairs of initially adjacent slaves (i, j) ∈ E(0) [17].”
BackgroundInfluentialImproved performance properties of the CISPRT algorithm for distributed sequential detection
Liu, K., & Mei, Y. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107573 · Cited by 4
“See [30] for more graph theoretic methods in network systems.”
BackgroundMethodCappello, D., & Mylvaganam, T. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029567 · Cited by 5
“The technological advances of the last decades have resulted in a growing interest in solving complex engineering tasks in a distributed fashion [1].”
BackgroundIzumi, S., & Azuma, S. (2020) · New Generation Computing · doi:10.1007/s00354-020-00093-0 · Cited by 5
“This is because multi-agent control is necessary for developing modern engineering systems, e.g., unmanned aerial vehicles, sensor networks, and smart grids [17].”
BackgroundLyapunov-based synchronization of networked systems: From continuous-time to hybrid dynamics
Maghenem, M. A., Postoyan, R., Lorı́a, A., & Panteley, E. V. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.06.003 · Cited by 5
“The analysis relies on the edgeagreement transformation based on the relationship between node and edge-agreement protocol [70].”
MethodLiu, Z., Saberi, A., Stoorvogel, A. A., et al. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.04.001 · Cited by 5
Distance-Based Formation Maneuvering of Non-Holonomic Wheeled Mobile Robot Multi-Agent System
Hernández-León, P., Davila, J. A., Salazar, S., et al. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.1588 · Cited by 5
“Mesbahi and Egerstedt (2010)[Geršgorin circle Theorem] Let A ∈ Cn×n and let Ci be the closed circle in the complex plane centered at Aii with radius given by the row sum ri = ∑ j 6=i |Aij |: Ci = {z ∈ C : |z −Aii| ≤ ri}.”
BackgroundSchwab, A., Littek, F., & Lunze, J. (2021) · European Control Conference (ECC) · doi:10.23919/ecc54610.2021.9654958 · Cited by 5
“Most of them use artificial potential functions (sometimes referred to as edge-tension functions, Lyapunov-like functions or barrier functions) to control groups of mobile systems [2], [3].”
BackgroundLiu, Z., Saberi, A., & Stoorvogel, A. A. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6087 · Cited by 5
Average consensus in switching nonlinearly coupled networks with time-varying delays.
Proskurnikov, A. V. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130204-3-fr-4031.00227 · Cited by 5
Decentralized degree regularization for multi-agent networks
Yazıcıoğlu, Y., Egerstedt, M., & Shamma, J. S. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6761080 · Cited by 5
“Therefore, various system properties such as robustness (how severely the system is influenced by perturbations of process/local components) and mixing time (how rapidly information spreads throughout the network) are usually analyzed through the topology of the interaction graph (e.g., [4], [5],…”
Self-citationCooperative Adaptive Fuzzy Control of High-Order Nonlinear Multi-Agent Systems with Unknown Dynamics
Huang, J., Fang, H., Chen, J., Dou, L., & Deng, F. Y. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.01772 · Cited by 5
Zhang, M., Saberi, A., Stoorvogel, A. A., et al. (2016) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3540 · Cited by 5
Azuma, S., TABUCHI, A., & Sugie, T. (2012) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.48.882 · Cited by 5
Decentralized Mean Orbit-Element Formation Guidance, Navigation, and Control: Part 1
Holzinger, M. J., & McMahon, J. W. (2012) · AIAA/AAS Astrodynamics Specialist Conference · doi:10.2514/6.2012-4515 · Cited by 5
On synchronous behavior in complex nonlinear dynamical systems
Aminzare, Z. (2015) · doi:10.7282/t3v126nz · Cited by 5
Games on Large Networks: Information and Complexity
Kordonis, I., & Papavassilopoulos, G. P. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2631081 · Cited by 5
Group decision making and social learning
Rahimian, M. A., & Jadbabaie, A. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799314 · Cited by 7
“In engineering literature, the possibility to achieve consensus in a distributed fashion (through local interactions and information exchanges between neighbors) is very desirable in a variety of applications such as load balancing [59], distributed detection and estimation [60], [61], [62], tracking [63], sensor netw…”
BackgroundArrichiello, F., Marino, A., & Pierri, F. (2017) · Frontiers in Robotics and AI · doi:10.3389/frobt.2017.00002 · Cited by 5
“The communication topology can be also characterized by the ( N × N ) Laplacian matrix (Ren and Beard, 2008; Mesbahi and Egerstedt, 2010) defined as The Laplacian matrix has some useful properties that make it very popular in the field of multi-robot systems and that will be exploited in the…”
Yao, W., Zhao, X., Yu, Y., et al. (2017) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/235/1/012006 · Cited by 5
“Another group of work [7-13] on development of local control strategy is done to overcome the difficulties when only local positioning and range information to neighbouring vehicles are available.”
BackgroundMethodGlocal controller-based formation control strategy for flexible material handling
Wicaksono, H., & Nilkhamhang, I. (2017) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2017.8105685 · Cited by 5
Distributed leader selection in switching networks of high-order integrators
Tsiamis, A., Pequito, S., & Pappas, G. J. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262767 · Cited by 5
“Finally, to devise a control law that steers the agents into a target state one often requires knowledge of the overall dynamics of the agents, or the structure of the network [15], which is not achievable in completely distributed scenarios.”
BackgroundDistributed Economic Control of Dynamically Coupled Networks
Lu, Y., & Zhu, M. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2984516 · Cited by 5
“The entities of CPSs are spatially distributed and thus distributed coordination becomes necessary to achieve network-wide goals [7, 29, 50].”
BackgroundSustainable Group Sizes for Multi-Agent Search-and-Patrol Teams
Haque, M. A., Egerstedt, M., & Martin, C. F. (2010) · SMARTech Repository (Georgia Institute of Technology) · Cited by 5
Self-citationOn Networks with Active and Passive AgentsPreprint
Yucelen, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.1480 · Cited by 5
“Preliminaries In the multiagent literature, graphs are broadly adopted to encode interactions in networked systems [1], [2].”
BackgroundDistributed Control of Multiagent Systems under Unknown Persistent DisturbancesPreprint
Yucelen, T., & Egerstedt, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.3489 · Cited by 5
“We refer to [5] and [1] for more details about graph theory and multiagent networks.”
BackgroundSelf-citationHuman-in-the-loop control for cooperative human-robot tasks
Chipalkatty, R. (2012) · SMARTech Repository (Georgia Institute of Technology) · Cited by 5
Meng, D., Meng, Z., & Hong, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.04430 · Cited by 6
“trices when the cooperative interactions are only involved. It yields the class of so-called conventional networks, for which agreement or consensus has generated many notable results (see, e.g., [1]-[3] and references therein). However, for opinion dynamics, there may simultaneously exist antagonistic interactions in…”
Connectivity-Preserving Consensus of Multi-Agent Systems with Bounded ActuationPreprint
Yang, Y., Constantinescu, D., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.09309 · Cited by 5
“[54] Given an arbitrary orientation of the edge set E , the weighted Laplacian matrix of the undirected communication graph G can be decomposed as L = DWD,”
BackgroundSocial Shaping for Transactive Energy SystemsPreprint
Salehi, Z., Chen, Y., Petersen, I. R., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.12967 · Cited by 5
“welfare equilibriums depend only on the network generation production C, the processor agree protocol for the vector a can be replaced by a distributed average consensus algorithm [34], where each agent obtains the average of all ai, or equivalently, the network capacity C.”
BackgroundA Fixed Point Theory Approach to Multi-Agent Consensus Dynamics With Delays
Somarakis, C., & Baras, J. S. (2013) · University Libraries (University of Maryland) · Cited by 5
Dou, L., & Zhang, H. (2025) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.70085 · Cited by 7
“…as where (9a) is deduced based on the equation ( ) Thus, the dynamics of ̃𝑞 𝑖 can be written in a compact form as = − 𝑘 1 𝐻 ( 𝑝 ) ̃𝑞 + ̃𝑣 (10) where [31], for the convenience of the further analysis, the matrix 𝐻 ( 𝑝 ) can be written as [ { } [ ] ] if edge j flows from node i to…”
Robot deployment with end-to-end communication constraints
Ny, J. L., Ribeiro, A., & Pappas, G. J. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160837 · Cited by 4
Linear Optimal Control for Autonomous Pattern Generation
Ludeke, T., & Iwasaki, T. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3326866 · Cited by 4
“The associated technical problems are often formulated in some abstracted form, such as multiagent coordination and coupled oscillator synchronization [2], [3], [4].”
BackgroundQuantifying the Satisfaction of Spatio-Temporal Logic Specifications for Multiagent Control
Liu, W., Alsalehi, S., Mehdipour, N., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3538747 · Cited by 4
“Existing approaches for specifying motions of MAS include consensus algorithms [8], [32], in which the specification is to reach a desired global state (e.g., minimum/maximum interrobot separation, specified centroid, heading alignment, etc), and abstractions, in which a team is parameterized by a…”
Nearly cyclic pursuit and its hierarchical variant for multi-agent systems
Iqbal, M., Leth, J., & Ngo, T. D. (2015) · Asian Control Conference (ASCC) · doi:10.1109/ascc.2015.7244720 · Cited by 4
“The Laplacain of the graph is considered as kcirculant which is not possible even if we take the influence of each node on the others in the network or the influence of other nodes on a specific node [14].”
BackgroundGeneralized hierarchical block circulant structure of multi-agent systems
Iqbal, M., Leth, J., & Ngo, T. D. (2017) · International Journal of Control Automation and Systems · doi:10.1007/s12555-016-0027-5 · Cited by 4
“The concept of consensus is very closely tied to some of the problems in multi-agent systems, including rendezvous, formation control [5], flocking, and alignment [6,7].”
BackgroundConvergence Analysis of Multi-Agent Consensus with Noisy Communication
Morita, R., Wada, T., Masubuchi, I., et al. (2014) · Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications · doi:10.5687/sss.2014.307 · Cited by 4
“It is useful for large scale network systems to balance the systems and it is expected for applications in various fields [1–4].”
BackgroundSingle-Agent Indirect Herding of Multiple Targets using Metric Temporal Logic Switching
Le, D. M., Luo, X., Bridgeman, L. J., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304233 · Cited by 4
“Networked control systems typically consist of collections of agents that collaborate to accomplish global objectives such as consensus, synchronization, and formation control [1].”
BackgroundA network flow approach for constellation planning
Cox, S. A., Droge, G. N., Humble, J. H., & Andrews, K. (2022) · doi:10.20517/smpo.2022.01 · Cited by 5
“The planning will make use of the graph’s incidence matrix, 𝐷 , as defined in [35] .”
Dynamic Perimeter Surveillance of Multiagent Systems: A Swarm-Based Approach
D’Alfonso, L., Fedele, G., & Franzè, G. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3219672 · Cited by 4
“…(cid:17)( z i ( t )) = ( 1 / 2 ) ni = 1 z i ( t ) T z i ( t ) be a Lyapunov function candidate and observe that By resorting to the arguments of [32], one has 2 that, thanks to (8) and by assuming the graph completely connected, becomes Authorized licensed use limited to the terms of the…”
BackgroundResilient Output Consensus to Cyber-Attacks in Continuous-Time Cyber-Physical Systems
Peng, Z., Zhang, Y., Wen, G., et al. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3243253 · Cited by 4
“The more detailed concepts on graph theory can refer to reference [40].”
BackgroundFormation Control and Sub-Swarm Generation of Multirotor UAVs
Shahzad, M. M., Asad, M. H., Haris, M., et al. (2023) · International Conference on Robotics and Automation in Industry (ICRAI) · doi:10.1109/icrai57502.2023.10089546 · Cited by 4
“We are performing communication between nodes using graph theory explained by Mesbahi et al. in [20].”
MethodScalable Stability of Nonlinear Interconnected Systems in case of amplifying Perturbations
Mirabilio, M., & Iovine, A. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156367 · Cited by 4
“In this section, we recall graph related notation and definitions from [16] and [17].”
MethodIncentives and Coevolution: Steering Linear Dynamical Systems With Noncooperative Agents
Fabiani, F., & Simonetto, A. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3332780 · Cited by 5
“3) Graph Theory (see [34]): Let G = ( V , E ) be an undirected graph connecting a set of vertices V = { 1 , . . . , V } through a set of edges E ⊆ V × V , with |E| = E and ( i, j ) ∈ E only if there is a link connecting nodes i and j .”
BackgroundInfluentialDistributed Reinforcement Learning for Networked Dynamical Systems
Sadamoto, T., Kikuya, A., & Chakrabortty, A. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3332779 · Cited by 4
“D ISTRIBUTED control is a widely used control methodology for networked dynamic systems (NDS), with examples, such as multiagent networks [1], [2], [3]; robotic networks [4]; social networks [5]; transportation networks [6]; and smart grids [7].”
MethodRobust Performance Analysis for Time-Varying Multi-Agent Systems with Stochastic Packet Loss
Hespe, C., & Werner, H. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.068 · Cited by 4
“In practice, ¯ λ and λ̄ can be estimated from the maximum degree of the admissible graphs and Cheeger’s inequality (Mesbahi and Egerstedt, 2010, Section 2.4.2).”
BackgroundInfluentialAly, I. A., & Dogan, K. M. (2023) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros55552.2023.10341404 · Cited by 4
“For a graph G , the degree matrix is represented by T with a degree of a node d i being equal to the number of its neighbors, and the adjacency matrix is represented by [37].”
BackgroundAsynchronous ADMM via a Data Exchange Server
Pan, Z., & Cannon, M. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3354840 · Cited by 4
“We refer readers to [43] for a detailed descriptionofmodelingmultiagentnetworksusinggraphtheory.”
MethodTowards the Legibility of Multi-robot Systems
Capelli, B., Santos, M. C. D. S., & Sabattini, L. (2024) · ACM Transactions on Human-Robot Interaction · doi:10.1145/3647984 · Cited by 5
“To this end, we can specify a 2D formation Δ through a set of relative, desired inter-agent distances, We assume here that Δ is a feasible formation, that is, that the distances are not conflicting and, thus, the geometry can can be realized (see Reference [46] for details on feasible formations).”
BackgroundDifferentially private distributed estimation and learning
Papachristou, M., & Rahimian, M. A. (2024) · IISE Transactions · doi:10.1080/24725854.2024.2337068 · Cited by 6
“…and Varaiya, 1982; Geanakoplos and Polemarchakis, 1982), and distributed averaging (Dimakis et al. , 2008); with close relations to the consensus and coordination problems that are studied in the distributed control theory (Jadbabaie et al. , 2003; Bullo et al. , 2009; Mesbahi and Egerstedt, 2010).”
Distributed Control Under Transmission Delays: A Model-Based Hybrid System Approach
Dhullipalla, M. H., Yu, H., & Chen, T. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3401970 · Cited by 4
“…be given by where the unforced dynamics f ( x i ) : R n → R n is globally Lipschitz with a Lipschitz constant L , L i is the i th row of graph Laplacian L of a connected undirected network G (see [26] for its properties) and the control gain ¯ κ > 0 is such that where d i is the degree of agent i .”
BackgroundKurtoglu, D., Yucelen, T., Tran, D. M., Casbeer, D. W., & García, E. (2024) · International Journal of Systems Science · doi:10.1080/00207721.2024.2364282 · Cited by 4
“We now concisely present the necessary graph-theoretical notation, where we refer to Mesbahi and Egerstedt (2010) for details.”
Xue, X., Wang, X., & Han, N. (2024) · Aerospace · doi:10.3390/aerospace11080612 · Cited by 4
City Transmission Networks: Unraveling Disease Spread Dynamics
Alrasheed, H., Alballa, N., Al-Turaiki, I. M., et al. (2024) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi13080283 · Cited by 4
“In this work, we use the epidemic tree [15,30,31] structure to track disease transmission.”
MethodBearing-Based Leader-Follower Formation Tracking Control Using Elevation Angle
Cheah, H. L., & Deghat, M. (2024) · IEEE Access · doi:10.1109/access.2024.3456826 · Cited by 4
Performance prediction of hub-based swarms
Jain, P. K., Dwivedi, C., Smith, N., & Goodrich, M. A. (2025) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2024.0141 · Cited by 3
Stoorvogel, A. A., Saberi, A., & Liu, Z. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3536880 · Cited by 4
“The synchronization problem for multiagent systems (MASs) has attracted substantial attention due to its potential for applications in several areas, see for instance the books [1], [2], [4], [8], [11], [12], [20] or the papers [5], [9], [10].”
Privacy preservation in matrix-scaled consensus
Shang, Y. (2025) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-025-00697-3 · Cited by 4
“As a fundamental component of distributed computation, consensus protocols and their variants provide a common framework for investigating networked systems [1].”
Formation Control of Wheeled Mobile Robots with Fault-Tolerance Capabilities
Shahab, M., Nasir, A., & Alyazidi, N. M. (2025) · Robotics · doi:10.3390/robotics14050059 · Cited by 5
Attitude synchronization of spacecraft formation with adaptation of consensus penalty terms
Zhang, K., & Demetriou, M. A. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669466 · Cited by 4
“Since the background material on graph theory is by now considered standard, we provide a summary with details presented in [10], [11].”
BackgroundFailure detection and isolation in integrator networks
Rahimian, M. A., & Preciado, V. M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170813 · Cited by 4
“Multi-agent network systems have found promising applications in areas such as motion coordination of robots [1].”
BackgroundActive power consensus in microgrids
Contzen, M. P., & Raisch, J. (2015) · International Symposium on Smart Electric Distribution Systems and Technologies (EDST) · doi:10.1109/sedst.2015.7315219 · Cited by 4
“For further details refer to [3] and [7].”
BackgroundAverage consensus for nonlinearly coupled agents: quadratic criteria
Proskurnikov, A. V. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862647 · Cited by 4
“for the case of time-invariant topology and linear couplings [19], [22] and for the case of undirected or balanced topology [22].”
BackgroundMethodInfluential
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.