Graph Theoretic Methods in Multiagent Networks
The DOI matches its Crossref record.
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,101–1,200 of 2,960
Gao, J., Sun, L., Xiang, X., Song, H., & Long, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2900861 · Cited by 9
A Risk-Security Tradeoff in Graphical Coordination Games
Paarporn, K., Alizadeh, M., & Marden, J. R. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3002499 · Cited by 11
Payra, A. K., & Ghosh, A. (2019) · Communications in computer and information science · doi:10.1007/978-981-13-8581-0_19 · Cited by 9
Sun, Z., & Sugie, T. (2019) · Numerical Algebra Control and Optimization · doi:10.3934/naco.2019020 · Cited by 9
“Another important matrix representation of a graph G is the Laplacian matrix L(G) [17].”
BackgroundLeveraging Diversity for Achieving Resilient Consensus in Sparse Networks
Ghawash, F., & Abbas, W. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.178 · Cited by 9
“A key aspect of networked and cooperative systems is that participating agents rely on local interactions to achieve complex global tasks such as area coverage, network formation and flocking (for instance, see Mesbahi and Egerstedt (2010); Ren et al. (2005)).”
BackgroundBlockchain-Driven on-Demand Control Loops Over Iot Environments
Lopetegui, J. J. M., & Núñez, F. (2019) · IEEE Access · doi:10.1109/access.2019.2949734 · Cited by 10
“An extensive treatment of the topic can be found in [46] and [47].”
BackgroundWeighted Average Consensus-Based Optimization of Advection-Diffusion Systems
Jafarizadeh, S. (2020) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2020.3044960 · Cited by 9
Whitman, J., Maske, H., Kingravi, H. A., & Chowdhary, G. V. (2021) · IEEE Control Systems · doi:10.1109/mcs.2020.3032801 · Cited by 9
“…are not limited to, 1) geometric approaches (which seek to cover the operating space without making assumptions about the spatiotemporal dynamics [44]) and 2) information-theoretic techniques (which place their focus on sensor placement-optimizing strategies based on mutual information and…”
BackgroundRing Formation Maneuver: Double-Integrator Kinematics with Input Saturation
Tran, D. M., Casbeer, D. W., García, E., et al. (2021) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g005925 · Cited by 9
Bianchin, G., Dall’Anese, E., Poveda, J. I., Jacobson, D., Carlton, E. J., & Buchwald, A. G. (2022) · Scientific Reports · doi:10.1038/s41598-022-08389-5 · Cited by 12
Adaptive Control of Second-Order Safety-Critical Multiagent Systems With Nonlinear Dynamics
Arabi, E., & Panagou, D. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3181547 · Cited by 9
“Next, we recall some basic notions from graph theory, where we refer the reader to [31] and [32] for further de-”
MethodOptimal Network Interventions to Control the Spreading of Oscillations
Allibhoy, A., Celi, F., Pasqualetti, F., & Cortés, J. (2022) · IEEE Open Journal of Control Systems · doi:10.1109/ojcsys.2022.3193127 · Cited by 10
“Although the literature on network design and topology control of dynamic systems is vast, e.g., see [34]–[36] and the references therein, to our knowledge this is the first work to introduce methods for network design for controlling oscillations in LTNs.”
MethodPal, D., Panigrahi, B. K., & Bhasin, S. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3215760 · Cited by 9
“…selecting the gains κ 1 and κ 2 [36] are given by where λ 2 ( L ) is the smallest nonzero eigen value of the Laplacian matrix (L) of the associated communication graph as shown in Fig.2(b)whichisgivenby L = Δ − A [36]where Δ denotesthe degree matrix of the graph G (having only diagonal elements).”
BackgroundMethodInfluentialAly, I. A., Comeaux, S., & Dogan, K. M. (2023) · AIAA SciTech Forum · doi:10.2514/6.2023-1812 · Cited by 9
Resilient consensus in continuous-time networks with ℓ -hop communication and time delay
Shang, Y. (2023) · Systems & Control Letters · doi:10.1016/j.sysconle.2023.105509 · Cited by 9
Sliding Mode Cooperative Control for Multirobot Systems: A Finite-Time Approach
Ghasemi, M., & Nersesov, S. G. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/450201 · Cited by 9
“For more details, see [8, 23, 24].”
Decentralized stabilization with symmetric topologies
Kirkoryan, A., & Belabbas, M.-A. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039569 · Cited by 10
“The tools of graph theory have played a prominent role in the analysis of decentralized control systems in many recent investigations [1], [2], [3], [4], [5].”
BackgroundMethod$H_{2}$ Optimal Coordination of Homogeneous Agents Subject to Limited Information Exchange
Madjidian, D., Mirkin, L., & Rantzer, A. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2571782 · Cited by 9
A Lyapunov approach to discrete-time linear consensus
Nedić, A., & Liu, J. (2014) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2014.7032238 · Cited by 8
Leader following consensus for multi-agent systems with stochastic packet dropout
Gong, X., Pan, Y., Li, J., et al. (2013) · International Conference on Control and Automation · doi:10.1109/icca.2013.6564861 · Cited by 9
“In [15], a directed graph also called digraph consists of a set of vertices V together with a set of edges E.”
BackgroundCharacterization of sign controllability for linear systems with real eigenvalues
Hartung, C., Reißig, G., & Svaricek, F. (2013) · Australian Control Conference · doi:10.1109/aucc.2013.6697315 · Cited by 9
“Leader-follower multi-agent systems for example are often described by undirected graphs and the Graph Laplacian of such a leader follower network is symmetric and corresponds to the A-matrix of a linear time-invariant control system [11].”
BackgroundBalancing human and inter-agent influences for shared control of bio-inspired collectives
Brown, D. S., Jung, S., & Goodrich, M. A. (2014) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2014.6974582 · Cited by 9
“The algebraic connectivity is often used to measure the connectivity of a graph and to provide a bound on the speed at which influence can flow through a graph [11]; however, this value is dependent on the number of agents in the partition.”
Distributed Concurrent Targeting for Linear Arrays of Point Sources
Zhang, F., Ramazi, P., & Cao, M. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.02325 · Cited by 9
Controllability analysis of a pair of 3D Dubins vehicles in formation
Marino, H., Salaris, P., & Pallottino, L. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.05.015 · Cited by 9
Reset control for multi-agent systems
Meng, X., Xie, L., & Soh, Y. C. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525496 · Cited by 9
“The theoretic research on multi-agent systems has experienced a great boom, which is evident with several monographs [1], [2], and numerous articles [3], [4], [5], [6], [7], [8], [9], [10], [11].”
BackgroundGnecco, G., Morisi, R., & Bemporad, A. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2479086 · Cited by 9
“, by weighted/unweighted adjacency and graph-Laplacian matrices [1], [2].”
Probabilistic Plan Synthesis for Coupled Multi-Agent Systems
Nikou, A., Tůmová, J., & Dimarogonas, D. V. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2280 · Cited by 10
“[Mesbahi and Egerstedt, 2010] Let G = ( V , E ) be an undirected graph.”
Distributed robust vehicle state estimation
Hashemi, E., Pirani, M., Fi̇dan, B., et al. (2017) · IEEE Intelligent Vehicles Symposium · doi:10.1109/ivs.2017.7995798 · Cited by 9
“The proposed module is inspired by the opinion dynamics model [15], [16].”
MethodЖилякова, Zhilyakova, L. Y., Kuznetsov, ., & Kuznetsov, O. P. (2016) · Publishing Center RIOR eBooks · doi:10.12737/21451 · Cited by 9
Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
Kawamura, S., Cai, K., Ye, M., & Lin, Z. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1535200 · Cited by 9
Fast convergence to Nash equilibria without steady-state oscillation
Zahedi, Z., Arefi, M. M., & Khayatian, A. (2018) · Systems & Control Letters · doi:10.1016/j.sysconle.2018.11.009 · Cited by 9
Graph Theory in Systems and Controls
Zelazo, D., Mesbahi, M., & Belabbas, M.-A. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619841 · Cited by 13
“The use of graphs to study the coordination and control of multi-agent systems has seen rapid developments from within the systems and controls community [1]–[3].”
BackgroundSelf-citationDecentralized Information Filter with Noncommon States
Saini, V. K., Paranjape, A. A., & Maity, A. (2019) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g003862 · Cited by 9
Gasparri, A., & Marino, A. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2926595 · Cited by 9
“Hence, rank(L) ≤ n− 1 where the equality holds when the graph is connected [36].”
BackgroundSkeik, O., & Lanzon, A. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4652 · Cited by 9
“,N}, we have det ( I + (A + τB2K)αiB2K ) = αn i det ( 1 αi I + (A + τB2K)B2K ) (23)”
Somarakis, C., Paraskevas, E., Baras, J. S., & Motee, N. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2765824 · Cited by 9
Variational collision and obstacle avoidance of multi-agent systems on Riemannian manifolds
Chandrasekaran, R. S., Colombo, L. J., Camarinha, M., et al. (2020) · European Control Conference (ECC) · doi:10.23919/ecc51009.2020.9143986 · Cited by 9
“Then, it can be shown as in [20] that for the potential function V12 = F (d(2)S(x1, x2)), (gradV ) = (−F (d(2)S) exp−1 x1 x2) where(gradV ) denotes the i component of gradient.”
BackgroundInvestigating stability of Laplacians on signed digraphs via eventual positivity
Altafini, C. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9030125 · Cited by 9
“,n aij(xi− xj) [24], [29], or, in matrix form,”
${\mathcal {H}_2}$ Performance of Series-Parallel Networks: A Compositional Perspective
de Badyn, M. H., & Mesbahi, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2979758 · Cited by 9
“The graph Laplacian is written as, Fig.”
BackgroundMethodInfluentialSelf-citationH2 Performance of Series-Parallel Networks: A Compositional Perspective
de Badyn, M. H., & Mesbahi, M. (2021) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000524038 · Cited by 9
Self-citationH2 suboptimal output synchronization of heterogeneous multi-agent systems
Jiao, J., Trentelman, H. L., & Camlibel, M. K. (2021) · Systems & Control Letters · doi:10.1016/j.sysconle.2021.104872 · Cited by 9
“Since the differences of the output values of communicating agents are captured by the incidence matrix R of the communication graph [29], we define a performance output variable as where W is the weight matrix defined in (1).”
BackgroundPursuer Coordination in Multi-Player Reach-Avoid Games Through Control Barrier Functions
Davydov, A., Rivera-Ortiz, P. M., & Diaz-Mercado, Y. J. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3044549 · Cited by 9
“Using tools from graph theory, [14], we define the Laplacian matrix encoding the information exchange topology for the pursuers to demonstrate the equality between Lloyd’s algo-rithm, (6), and leader-follower consensus dynamics.”
MethodEvent-based distributed clock synchronization for wireless sensor networks
Kadowaki, Y., & Ishii, H. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760958 · Cited by 9
“It is clear that the scheme for x takes the form of a discrete-time consensus algorithm [11].”
BackgroundEvent‐Triggered Communication and Control for Multi‐Agent Average Consensus
Nowzari, C., Cortés, J., & Pappas, G. J. (2017) · Wiley eBooks · doi:10.1002/9781119266235.ch7 · Cited by 9
Chapman, A. (2015) · ResearchWorks at the University of Washington (University of Washington) · Cited by 9
Sample Complexity of Sparse System Identification ProblemPreprint
Fattahi, S., & Sojoudi, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07753 · Cited by 9
“Therefore, when the location of these sensors changes over time, so does the topology of the interconnecting links [37].”
BackgroundDistributed Consensus in Networks
Chen, F., & Ren, W. (2016) · Wiley eBooks · doi:10.1002/047134608x.w8314 · Cited by 10
Reduced Order Modeling of Diffusively Coupled Network Systems: An Optimal Edge Weighting ApproachPreprint
Cheng, X., Yu, L., Ren, D., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.03559 · Cited by 9
“Note that the adjacency and Laplacian matrices in this article are defined as transposed compared with [23], where the direction of edges corresponds to the flows, rather than the dependency in the network.”
BackgroundRobust Positive Consensus for Heterogeneous Multi-agent Systems
Li, R., Tang, Y., & Li, S. (2024) · International Journal of Control Automation and Systems · doi:10.1007/s12555-022-1201-6 · Cited by 9
“For this purpose, we utilize an undirected graph G = {N , E , A} to represent the allowed information flow among them with node set N = { 1, ... , N } , edge set E ⊂ N × N , and the symmetric adjacency matrix A = [ a ij ] N × N ( [28]).”
Distributed Solvers for Network Linear Equations With Scalarized Compression
Wang, L., Ren, Z., Yuan, D., et al. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3488492 · Cited by 8
“As G is undirected and connected, by recalling [1], we have with λ 2 , λ n > 0 being the second smallest eigenvalue and the maximal eigenvalue of L G , respectively.”
InfluentialAntonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00032 · Cited by 8
“A wide overview on such problems can be found in Kumar et al. (2008); Parker (2008) or in the recent books Bullo et al. (2009); Ren and Beard (2008); Mesbahi and Egerstedt (2010); Gazi and Passino (2010).”
BackgroundPersistence based analysis of consensus protocols for dynamic graph networks
Chowdhury, N. R., & Sukumar, S. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862201 · Cited by 11
“A detailed discussion of the same is available in [9], [17].”
An observer based distributed controller for formation flying of satellites
Menon, P. P., & Edwards, C. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990884 · Cited by 8
“The dynamics of the i satellite in the radial and tangential (x−y) plane (1) - (2) can be rewritten conveniently in state space form as in [8], [12], [20]:”
BackgroundMethodReaction-diffusion clustering of single-input dynamical networks
Ishizaki, T., Kashima, K., Imura, J., et al. (2011) · doi:10.1109/cdc.2011.6160844 · Cited by 8
“, [3] for a survey on networked systems and multi-agent systems.”
BackgroundCappello, D., & Mylvaganam, T. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619076 · Cited by 9
“INTRODUCTION The ever-growing interest in handling complex realworld problems in a distributed manner has resulted in the field of Multi-Agent Systems (MAS) gaining interest in the last decades [1], [2].”
BackgroundDistributed online optimization for multi-agent optimal transport
Krishnan, V., & Martı́nez, S. (2024) · Automatica · doi:10.1016/j.automatica.2024.111880 · Cited by 8
“Such a problem of transport of multi-agent collectives arises naturally in various settings, from the modeling of cell populations in biology, to engineering applications of coverage control and deployment in robotics and mobile sensing networks [9, 12, 26].”
BackgroundLiu, Y., Liu, K., & Song, Z. (2023) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6695 · Cited by 11
“For ξ l ( t ) converging to the origin, the mobile robot network achieves consensus to the agreement set that is the subspace of span { 1 } such that ˜ x i ( t ) = ˜ x j ( t ) , i = 1 , . . . , N , j ∈ N i when t → ∞ [34].”
BackgroundMulti‐agent consensus with stopping rules under bounded measurement noise
Hanada, K., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2022) · Asian Journal of Control · doi:10.1002/asjc.2930 · Cited by 9
“Then, we have which follows from the standard fact of undirected and connected graphs [13].”
BackgroundDistributed Algorithms for Boolean Equations Over Networks
Qi, H., Li, B., Jing, R.-J., Wang, L., Proutière, A., & Shi, G. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3241237 · Cited by 8
Attack resilient strategy for event-triggered distributed control scheme of multi-energy systems
Liu, J., Wang, C., Liu, J., & Xie, P. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.03.043 · Cited by 8
Distributed Biconnecitvity Achievement and Preservation in Multi-Agent Systems
Restrepo, E., & Giordano, P. R. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3324837 · Cited by 8
“…that connectivity of the graph representing the interconnections in a multi-agent system, that is, the existence of a path from any node to any other node in the network, is a necessary and sufficient condition for convergence to the agreement subspace in consensus-based coordination algorithms [1].”
BackgroundŞekercioğlu, P., Jayawardhana, B., Sarras, I., et al. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3462554 · Cited by 8
“We deal with the considered problem posed above as one of stabilization of the origin in edge coordinates [40], [42], which correspond exactly to the synchronization errors in (8).”
On disturbance propagation in vehicular platoons with different communication ranges
Wu, C., Zhang, M., & Dimarogonas, D. V. (2024) · Automatica · doi:10.1016/j.automatica.2024.111665 · Cited by 8
“The mappings d i can be viewed as a formation protocol [Mesbahi and Egerstedt, 2010] for the pla-toon with the first order dynamics ˙ p i = v i , i = 1 , . . . , n .”
MethodAn Emergent Synchronization Property in a Set of Non-Competing Multi-Agent Systems
D’Alfonso, L., & Fedele, G. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3400700 · Cited by 9
“…the swarm’s collision avoidance property), i.e., V ( i , j ) = ξ i − 1 j , i , j = 1 , . . . , ν, and consider the identities [30] Due to the complete connectivity, the i -th element of V (cid:2) (ξ) , can be written as [26] The i -th equation in (9) then forms a polynomial equation of degree i .”
BackgroundXue, X., Yuan, B., Yi, Y., Zhang, Y. M., Yue, X., & Mu, L. (2024) · ISA Transactions · doi:10.1016/j.isatra.2024.06.021 · Cited by 13
Distributed Bargaining in Dyadic-Exchange Networks
Richert, D., & Cortés, J. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2476215 · Cited by 7
“erature review. Examples of networked systems where performance benefits arise from agents cooperating with each other towards the achievement of a common goal are by now pervasive, see e.g. [1], [2], [3] and references therein. Of particular relevance to this paper are scenarios where individual agents have the abilit…”
BackgroundDistributed fault detection and recovery for networked robots
Arrichiello, F., Marino, A., & Pierri, F. (2014) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2014.6943086 · Cited by 8
“, the set V of the indexes labeling the N vertices (nodes), the set of edges (arcs) E = V × V connecting the nodes, and its L(N × N ) Laplacian matrix [11].”
Sadikhov, T., Haddad, W. M., Goebel, R. K., et al. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859152 · Cited by 8
“The consensus problem involves the design of a dynamic algorithm that guarantees system state equipartition [8], [10], that is, limk→∞ xi(k) = q ∈ R for i = 1, .”
BackgroundSelf-citationReactive power consensus in microgrids
Contzen, M. P., & Raisch, J. (2016) · European Control Conference (ECC) · doi:10.1109/ecc.2016.7810307 · Cited by 8
“For further details refer to [3] and [7].”
BackgroundEvent-triggered control for multi-agent systems with output saturation
Yi, X., Yang, T., Wu, J., & Johansson, K. H. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028693 · Cited by 7
“2 Preliminaries In this section, we present some definitions from algebraic graph theory [25] and the formulation of the problem.”
BackgroundSelf-triggered cooperative path following control of fixed wing Unmanned Aerial Vehicles
Jain, R. P., Aguiar, A. P., & de Sousa, J. B. (2017) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas.2017.7991375 · Cited by 8
“References [18], [19] form a good source for results on graph theory and their application for cooperative control and consensus in multi-agent systems.”
BackgroundDai, M., & Xiao, F. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.05.026 · Cited by 8
Byun, H. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2855202 · Cited by 8
“Note that the matrix Ae takes the form of a symmetric Laplacian matrix L [10] such that”
BackgroundReview of two non-centralized observer-based diagnosis schemes for interconnected systems
Martínez-Villegas, C. T., Theilliol, D., & Torres, L. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.09.630 · Cited by 8
Optimal Time-Invariant Formation Tracking for a Second-Order Multi-Agent System
Fabris, M., Cenedese, A., & Hauser, J. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796245 · Cited by 8
“Related work: In the scientific community, a significant research effort has focused on the control of multi-agent systems and its mathematical foundation on graph-based networks [3].”
BackgroundRobustness of Finite-Time Distributed Control Algorithm with Time Transformation
Arabi, E., Yucelen, T., & Singler, J. R. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814735 · Cited by 8
A Supervisory Algorithm Against Intermittent and Temporary Faults in Consensus-Based Networks
Parlangeli, G. (2020) · IEEE Access · doi:10.1109/access.2020.2997100 · Cited by 8
“…the zero eigenvalue of L and, in turn, the eigenvalue λ = 1 of A are always reachable and observable from any node of a (strongly) connected graph [52], so that the condition ν n corresponds to a lower degree of the minimal polynomial nulling the sequence x (cid:96) ( t ), and it has the…”
BackgroundAryankia, K., & Šelmić, R. R. (2020) · European Control Conference (ECC) · doi:10.23919/ecc51009.2020.9143930 · Cited by 8
“Lemma 3 ([16]): A framework with n > 2 in 2D is said to be infinitesimally rigid, if and only if rank(Rp) = 2|n| − 3.”
BackgroundDistributed infinite‐horizon optimal control of continuous‐time linear systems over network
Battilotti, S., Cacace, F., & d’Angelo, M. (2020) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5316 · Cited by 8
Dogan, K. M., Yucelen, T., & Muse, J. A. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-0530 · Cited by 8
Neural Network-based Control for Multi-Agent Systems from Spatio-Temporal Specifications
Alsalehi, S., Mehdipour, N., Bartocci, E., et al. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9682921 · Cited by 8
“Existing approaches include consensus algorithms [1], [2], in which the specification is to reach a desired global state (e.”
BackgroundGraph Structure-Based Heuristics for Optimal Targeting in Social Networks
Bini, M., Frasca, P., Ravazzi, C., et al. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3163665 · Cited by 8
“More precisely, the following proposition holds [14].”
A Time Transformation Approach to Finite-Time Distributed Control With Reduced Information Exchange
Kurtoglu, D., & Yucelen, T. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3080204 · Cited by 8
“From [20], we next recall necessary graph theory notions.”
BackgroundSample Complexity of Block-Sparse System Identification Problem
Fattahi, S., & Sojoudi, S. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3089141 · Cited by 16
Zou, Y., Zuo, Z., & Xia, K. (2021) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2021.101108 · Cited by 8
Scalable multi‐agent formation control under switching leader–follower directed graph
Djamari, D. W., Nurprasetio, I. P., Veza, I., et al. (2021) · Asian Journal of Control · doi:10.1002/asjc.2698 · Cited by 8
“The works of Coogan et al. [11] and Coogan and Arcak [12] discuss scalable formation for double integrator agents under a fixed communication network, where their formulations are based on the consensus algorithm (see Mesbahi and Egerstedt [17]).”
Global Max-Tracking of Multiple Time-Varying Signals Using a Distributed Protocol
Sen, A., Sahoo, S. R., & Singh, B. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3179334 · Cited by 8
Dogan, K. M., Yucelen, T., Aly, I. A., & Muse, J. A. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867263 · Cited by 8
“We next recall necessary notions from graph theory, where we refer to [3] and [19] for details.”
BackgroundMethodKron Reduction and Effective Resistance of Directed Graphs
Sugiyama, T., & Sato, K. (2023) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/22m1480823 · Cited by 8
“Electrical networks, smart power grids [19], social networks [16], and multi-agent systems [17] are only a few examples.”
BackgroundFormation Control Over Delaunay Triangulation Networks With Guaranteed Collision Avoidance
Schwab, A., & Lunze, J. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3203351 · Cited by 8
“In order to solve such formation control problems, gradient-based control schemes with artificial potential fields are predes-tined due to the target-oriented influence on the agents [7], [8].”
BackgroundEnd-to-end decentralized formation control using a graph neural network-based learning method
Jiang, C., Huang, X., & Guo, Y. P. (2023) · Frontiers in Robotics and AI · doi:10.3389/frobt.2023.1285412 · Cited by 14
“…studied under the control regime using analytical model-based methods (Cortés and Egerstedt, 2017; Guo, 2017); the dynamic model-based expert controller used in this paper is mathematically provably correct and guarantees formation convergence of multi-robot systems (Mesbahi and Egerstedt, 2010).”
BackgroundMethodInfluentialRobust synchronization of Lur'e networks with incremental nonlinearities
Zhang, F., Trentelman, H. L., & Scherpen, J. M. A. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760410 · Cited by 10
“Consensus and synchronization problems for linear multiagent networks have been extensively studied, see [9], [16], [17] and the references therein.”
BackgroundMotion planning for two 3D-Dubins vehicles with distance constraint
Marino, H., Bonizzato, M., Bartalucci, R., Salaris, P., & Pallottino, L. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6385866 · Cited by 11
“distances) while moving as a whole group [2], [3], [4].”
BackgroundDecentralized learning-based planning for multiagent missions in the presence of actuator failures
Üre, N. K., Chowdhary, G. V., Chen, Y. F., Cutler, M., How, J. P., & Vian, J. L. (2013) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas.2013.6564803 · Cited by 8
“, the literature on scalable consensus-based multiagent control [5]).”
BackgroundFormation Control Protocols for Nonlinear Dynamical Systems Via Hybrid Stabilization of Sets
Haddad, W. M., Nersesov, S. G., Hui, Q., et al. (2014) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4027501 · Cited by 8
“For our result, we assume that the graph G of the communication topology for the mobile agents is undirected and strongly connected [3].”
BackgroundObserver Design for a class of complex networks with unknown topoloy
Schmidt, P., Moreno, J. A., & Schaum, A. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.01716 · Cited by 8
“Analysis and control of dynamical systems interconnected in a network structure, also referred to as Multi-Agent Systems (MAS), has gained a lot of interest during the past years due to its emerging variety of applications [Mesbahi and Egerstedt, 2010, Ch. 1].”
BackgroundFinite-time coordination in multiagent systems using sliding mode control approach
Ghasemi, M., & Nersesov, S. G. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580137 · Cited by 8
Distributed online topology design for network-level disturbance rejection
Chapman, A., Schoof, E., & Mesbahi, M. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6759983 · Cited by 8
“The dynamics governing this foreign signal takes the form of the popular leader-follower consensus dynamics [4], where the incorrectly identified agent plays the role of a leader, and the native agents in the network as followers.”
BackgroundMethodSelf-citationDetection and isolation of link failures under the agreement protocol
Rahimian, M. A., & Preciado, V. M. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6761058 · Cited by 8
“Multi-agent network systems, which consist of a group of interacting dynamic agents, have found promising applications in areas such as motion coordination of robots [1].”
BackgroundDragicevic, A. Z., & Sinclair‐Désgagné, B. (2011) · Ecological Modelling · doi:10.1016/j.ecolmodel.2013.09.003 · Cited by 8
“The dynamics of unmarked nodes is given by the Laplacian-based control strategy (consensus) differential equation, meaning that each node moves in the direction of the average position of its utility nodes (Mesbahi and Egerstedt 2010).”
Method
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.