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,001–1,100 of 2,960
Nudell, T. R., & Chakrabortty, A. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859401 · Cited by 11
“[12], for details on network construction using the Cartesian product for graphs.”
MethodA graph realization approach to network identification
Nabi-Abdolyousefi, M., Fazel, M., & Mesbahi, M. (2012) · doi:10.1109/cdc.2012.6425884 · Cited by 11
Self-citationBroadcast control of multi-agent systems
Azuma, S., Yoshimura, R., & Sugie, T. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160216 · Cited by 12
On the Control and Estimation Over Relative Sensing Networks
Sandhu, J., Mesbahi, M., & Tsukamaki, T. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2033137 · Cited by 11
“1 where the signal captures the coordination state among multiple dynamic systems; signals , , and , denote, respectively, the system state- comprised of states of the individual dynamic elements, the exogenous signal, and the control input.”
BackgroundSelf-citationOutput consensus of nonlinear multi-agent systems with unknown control directions
Tang, Y. (2015) · Kybernetika · doi:10.14736/kyb-2015-2-0335 · Cited by 13
“8 in [13], y → span{1N}, which completes the proof.”
BackgroundInfluentialInferring Centrality from Network Snapshots
Shao, H., Mesbahi, M., Li, D., & Xi, Y. (2017) · Scientific Reports · doi:10.1038/srep40642 · Cited by 10
“The influence of this perturbation decreases when the network size grows, and consequently the term λ 1 ( ) i 1 { } would dominate qi in (13).”
Self-citationDistributed Energy Management of PV-Storage Systems for Voltage Rise Mitigation
Ansari, B., & Simões, M. G. (2017) · Technology and Economics of Smart Grids and Sustainable Energy · doi:10.1007/s40866-017-0033-6 · Cited by 11
“Also, we can show that the convergence time of consensus algorithm depends on the second smallest eigenvalue of LG [10], and, it is much smaller than the duration of system scheduling time step t which is an hour in this work.”
BackgroundDynamics of opinion-dependent product spread
Ruf, S. F., Paarporn, K., Paré, P. E., & Egerstedt, M. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264086 · Cited by 11
“Opinion dynamics have been of interest in sociology since the canonical models of Abelson and DeGroot [9], [10], and have since become of interest to the controls community [11].”
MethodSelf-citationMass–spring–damper networks for distributed optimization in non-Euclidean spaces
Yu, Y., Acikmese, B. A., & Mesbahi, M. (2019) · Automatica · doi:10.1016/j.automatica.2019.108703 · Cited by 11
“When the graph is connected, the nullspace of E(G) is spanned by 1 [Mesbahi and Egerstedt, 2010, Theorem 2.8], and the nullspace of E(G) is spanned by the signed path vector of cycles in G [Zelazo and Mesbahi, 2011, Thm. 2.3].”
BackgroundInfluentialSelf-citationDistributed multi-robot formation control under dynamic obstacle interference
Hu, J., Sun, J., Zou, Z., Ji, D., & Xiong, Z. (2020) · IEEE/ASME International Conference on Advanced Intelligent Mechatronics · doi:10.1109/aim43001.2020.9158809 · Cited by 12
Yi, X., Wei, J., Dimarogonas, D. V., & Johansson, K. H. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1444 · Cited by 47
“otation AbBmeans the Kronecker product of matrices Aand B. 2. PRELIMINARIES In this section we review some denitions and results on algebraic graph theory and formation control, for more details see Mesbahi and Egerstedt (2010). 2.1 Algebraic Graph Theory For a undirected graph G pV;E;Aqwith nnodes (vertices), the set…”
MethodInfluentialTime averaged consensus in a direct coupled distributed coherent quantum observer
Petersen, I. R. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170715 · Cited by 10
Formation feasibility on coordination control of networked heterogeneous systems with drift terms
Sun, Z., & Anderson, B. D. O. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798788 · Cited by 10
“Maintaining a formation is important in multi-agent coordination and in some cases would be a premise for agents to perform additional tasks such as surveillance, coverage, target detection, etc ([4], [5]).”
BackgroundDesign of Avionics Network Architecture Under a Reliability Constraint
Khamvilai, T., Mains, J. B., Sutter, L., et al. (2021) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3134750 · Cited by 10
“One method to do this is to construct the graph form the remaining components and compute eigenvalues of the graph Laplacian [40].”
MethodOn the Impact of Agents With Influenced Opinions in the Swarm Social Behavior
Fedele, G., Bozzo, E., & D’Alfonso, L. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3285884 · Cited by 10
“Since it is assumed that G is connected, L has the following properties [23]: L has one simple zero eigenvalue, i.e., λ n = 0, with the associated eigenvector 1 n ; the second smallest eigenvalue λ n − 1 > 0.”
BackgroundSimultaneous Topology Identification and Synchronization of Directed Dynamical Networks
Restrepo, E., Wang, N., & Dimarogonas, D. V. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3338253 · Cited by 10
Funada, R., Nishimoto, K., Ibuki, T., et al. (2024) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2024.3467809 · Cited by 10
“Note that although we assume a complete graph in Assumption 1 to make a discussion simpler, the proposed method can be extended to a distance-based graph, such as the (cid:49) -disk proximity graph [51], as conducted in [13] and [52].”
Resilient Consensus With Multihop Communication
Yuan, L., & Ishii, H. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3550065 · Cited by 10
“…input vector, respectively, and L [ k ] is the Laplacian matrix of the l th power of G determined by the messages If no adversary is present, it is straightforward from the one-hop result (e.g., [1], [34]) that with l -hop communication, consensus is possible if G l has a rooted spanning tree.”
Zhang, M., Saberi, A., & Stoorvogel, A. A. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171038 · Cited by 10
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [10], [15], [21]).”
BackgroundSafe Flocking in Spite of Actuator Faults using Directional Failure Detectors
Johnson, T. T., & Mitra, S. (2011) · Cited by 10
Robust synchronization of directed Lur'e networks with incremental nonlinearities
Zhang, F., Xia, W., Trentelman, H. L., et al. (2014) · IEEE International Symposium on Intelligent Control · doi:10.1109/isic.2014.6967599 · Cited by 10
“Synchronization problems for linear multi-agent networks have been extensively studied, see [7], [9] and the references therein.”
BackgroundEvent Triggered Multi-Agent Consensus of DC Motors to Regulate Speed by LQR Scheme
Masroor, S., Peng, C., & Ali, Z. A. (2017) · Mathematical and Computational Applications · doi:10.3390/mca22010014 · Cited by 10
“In [25], 0 if is connected and holds the property , .”
BackgroundTrajectory tracking in heterogeneous multi-agent system without and with input delay
Mehra, S., Sen, A., & Sahoo, S. R. (2017) · Indian Control Conference · doi:10.1109/indiancc.2017.7846498 · Cited by 10
Controllability and data-driven identification of bipartite consensus on nonlinear signed networks
de Badyn, M. H., Alemzadeh, S., & Mesbahi, M. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264181 · Cited by 9
“Previous research in this direction has examined the controllability of consensus networks in both the linear case and non-linear generalizations of consensus [15], [16], [17].”
BackgroundMethodSelf-citationWang, Z., Wang, D., Sun, J., & Wang, W. (2018) · IET Control Theory and Applications · doi:10.1049/iet-cta.2017.1322 · Cited by 10
“The following concepts of graph theory can be found in [31].”
BackgroundMatveev, A. S., & Ovchinnikov, K. S. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4427 · Cited by 10
Distributed Randomized Algorithms for PageRank Computation: Recent Advances
Ishii, H., & Suzuki, A. (2018) · Systems & control · doi:10.1007/978-3-030-04630-9_12 · Cited by 11
Event-triggered Consensus Problem of General Multi-agent System on Signed Networks
Pan, L., Shao, H., Li, D., Xi, Y., Li, X., & Xue, S. (2018) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2018.8581275 · Cited by 10
“Applications of consensus can be found in disciplines such as opinion dynamics, the diffusion process and a variety of distributed algorithms and so forth [2], [3].”
BackgroundRezaei, V., & Stefanovic, M. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4579 · Cited by 10
“For the given communication digraphs cx and cv that match the structure of (51), we now unify the findings of this subsection and establish a bound on the tolerable time-varying interconnected nonlinearities fi and gi in agent layer dynamics (40)-(41) by two-layer linear cooperative tracking protocol (44)-(45).”
BackgroundMethodInfluentialZhang, M., Saberi, A., & Stoorvogel, A. A. (2019) · European Journal of Control · doi:10.1016/j.ejcon.2019.12.006 · Cited by 10
Model Reduction Methods for Complex Network Systems
Cheng, X., Scherpen, J., et al. (2020) · Cambridge University Engineering Department Publications Database · Cited by 10
On the Efficiency of Decentralized Epidemic Management and Application to Covid-19
Silva, O. L. D., Lasaulce, S., & Morarescu, I.-C. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3087101 · Cited by 10
Momentum-Based Nash Set-Seeking Over Networks via Multitime Scale Hybrid Dynamic Inclusions
Ochoa, D. E., & Poveda, J. I. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3321901 · Cited by 14
“…different notions of equilibria related to game-theoretic models, the notion of Nash equilibrium (NE), introduced in [1], has become ubiquitous in many engineering and socio-technical systems such as transportation networks [2], energy systems [3], [4], and robotic networks [5], to name just a few.”
BackgroundIdentification of Diffusively Coupled Linear Networks Through Structured Polynomial Models
Kivits, E. M. M., & den Hof, P. M. J. V. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3191406 · Cited by 10
“Since ¯ Y 0 is Laplacian, the sum of each row is equal to 0, that is ¯ Y 0 1 = 0 , with (cid:8) (cid:9) [22].”
BackgroundLee, H.-Y., Zhou, P., Zhang, B., Qiu, L., Fan, B., Duan, A., Tang, J., Lam, T. L., & Navarro-Alarcón, D. (2023) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2023.3264034 · Cited by 11
“To achieve accurate control, we find a minimum cost path with the Dijkstra algorithm [30], [44] from the current capability attribute node that receives the new sensory data to the capability attribute node that equips the required action a i .”
BackgroundMethodTeam-level properties for haptic human-swarm interactions
Setter, T., Kawashima, H., & Egerstedt, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170777 · Cited by 10
“The ideas presented in this paper are summarized in Section V.”
BackgroundSelf-citationLin, Y., & Mitra, S. (2015) · doi:10.1145/2670529.2754966 · Cited by 10
“e body of theoretical work spanning control theory, computer science, and robotics that deals with development of distributed algorithms for ocking, coverage, and formation control for robotic swarms [10,38,33,28,25, 8,35]. The safety and convergence properties of algorithms are typically analyzed by hand (as opposed…”
BackgroundCollective behavior with heterogeneous controllers
Jain, A., & Ghose, D. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580553 · Cited by 10
Degree of relative influence for consensus-type networks
Shao, H., & Mesbahi, M. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859370 · Cited by 10
“In this work, we consider the continuous-time consensus protocol via which the state consensus can be guaranteed when the underlying communication network is connected [14], [17].”
BackgroundSelf-citationMusical abstractions in distributed multi-robot systems
Albin, A., Weinberg, G., & Egerstedt, M. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6385688 · Cited by 10
“Following the developments in [18], a general way of producing such a controller is to, for each j ∈ N i , define an edge-tension function E ij as a function of x i −x j and the desired inter-agent distance d ij .”
BackgroundSelf-citationLocal Synchronization of Linear Multi-Agent Systems Subject to Input Saturation
Takaba, K. (2015) · SICE Journal of Control Measurement and System Integration · doi:10.9746/jcmsi.8.334 · Cited by 10
Clustered model reduction of networked dissipative systems
Ishizaki, T., Ku, R., & Imura, J. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525482 · Cited by 10
“Examples include power networks, biochemical networks, ecological networks, and so forth [1], [2].”
BackgroundResultFormation control of underactuated bio-inspired snake robots
Rezapour, E., Pettersen, K. Y., Gravdahl, J. T., et al. (2016) · Artificial Life and Robotics · doi:10.1007/s10015-016-0297-2 · Cited by 10
Droop-free control for networked microgrids
Toro, V., & Mojica‐Nava, E. (2016) · IEEE Conference on Control Applications (CCA) · doi:10.1109/cca.2016.7587860 · Cited by 10
“Acording [15], equation (5) can be written as”
BackgroundInfluentialZhang, M., Saberi, A., & Stoorvogel, A. A. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799065 · Cited by 10
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [9], [14], [18] and references therein).”
BackgroundLeader-following consensus of parameter-dependent networks via distributed gain-scheduling control
Yuan, C. (2017) · International Journal of Systems Science · doi:10.1080/00207721.2017.1309597 · Cited by 10
“Numerous interesting results on multi-agent distributed consensus control have been reported in the literature (see, e.g. Bai, Arcak, & Wen (2011); Mesbahi & Egerstedt (2010); Ren, Beard, & Atkins (2007); Ren & Beard (2008); Wen, Duan, Chen, & Yu (2014); Wen, Yu, Hu, Cao, & Yu (2015) and the…”
BackgroundQuasirandom geometric networks from low-discrepancy sequences
Estrada, E. (2017) · Physical review. E · doi:10.1103/physreve.96.022314 · Cited by 10
“In the consensus protocols the problem consists of 732 making the scalar states of a set of agents converge to the same 733 value under local communication constraints [61,62].”
BackgroundMethodConsensus in networks with arbitrary time invariant linear agents
Contzen, M. P. (2017) · European Journal of Control · doi:10.1016/j.ejcon.2017.08.004 · Cited by 8
Sun, Z., de Marina, H. G., Anderson, B. D. O., & Cao, M. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4288 · Cited by 10
“Then again, the affine-subspace-preserving property of the z system in the sense of (26) follows from theorem 1 in the work of Sun and Yu.”
BackgroundDensity-Based Feedback Control for Earth Orbiting Swarms via Velocity Fields
Eren, U., Demirer, N., & Acikmese, B. A. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.07.086 · Cited by 10
Monsingh, J. M., & Sinha, A. (2018) · European Journal of Control · doi:10.1016/j.ejcon.2018.12.005 · Cited by 10
Robust controllability assessment and optimal actuator placement in dynamic networks
Babazadeh, M. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.104547 · Cited by 10
Distributed Force/Position Optimization Dynamics for Cooperative Unknown Payload Manipulation
Miyano, T., Romberg, J., & Egerstedt, M. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304246 · Cited by 10
“Hence, when the projection Π∂CN is absent, the average position 1 N ∑N i=1 pi of agent positions in the process of (19) is static in the same manner as the consensus algorithm [28].”
MethodResultSelf-citationRobust Maximization of Correlated Submodular Functions Under Cardinality and Matroid Constraints
Hou, Q., & Clark, A. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3061656 · Cited by 13
Edge Differential Privacy for Algebraic Connectivity of Graphs
Chen, B., Hawkins, C., Yazdani, K., et al. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683306 · Cited by 10
Consensus Congestion Control for Ad Hoc Networks: Time-Delay and Saturation
Alaoui, S. B., Haiek, B. E., Houssaine, T. E., Barbosa, K. A., & Rojas, A. J. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3235303 · Cited by 10
“Here, we recall that from [37], the adjacency matrix A = A ( G ) = ( a ij ) for an undirected graph G with N v vertices is the N v × N v matrix given by the elements, When there is an edge ( i, j ) ∈ E , then i, j are referred to as adjacent.”
BackgroundOptimal Multiple Controlling Nodes Problem for Multi-agent Systems via Alt-PageRank
Tsumura, K., & Yamamoto, H. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130925-2-de-4044.00071 · Cited by 10
A decentralized fault tolerant control strategy for multi-robot systems
Arrichiello, F., Marino, A., & Pierri, F. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.01875 · Cited by 10
“A comparison between a centralized and decentralized architectures is presented in Meskin and Khorasani [2009], where the diagnosis problem is formulated in terms of isolability index for a given family of fault signatures.”
BackgroundBroadcast Control of Markovian Multi-Agent Systems
Azuma, S., Baba, I., & Sugie, T. (2016) · SICE Journal of Control Measurement and System Integration · doi:10.9746/jcmsi.9.103 · Cited by 10
“As well as the networked multi-agent control which is actively studied in recent years [1]–[4], the broadcast control would be a key technique dealing with large-scale systems.”
BackgroundGrowing controllable networks via whiskering and submodular optimization
de Badyn, M. H., & Mesbahi, M. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798376 · Cited by 10
“A great amount of effort has recently been focused on understanding how the connection structure, or topology, of a network affects the behaviour or performance of a dynamical process on that network [1].”
BackgroundMethodInfluentialSelf-citationFabiani, F., Fenucci, D., Fabbri, T., et al. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.10.432 · Cited by 10
“For further details on the graph theory, refer to Mesbahi and Egerstedt (2010).”
BackgroundRobust consensus of Lur'e networks with uncertain communications
Liu, M., & Li, Z. (2017) · IET Control Theory and Applications · doi:10.1049/iet-cta.2016.1205 · Cited by 10
Edge addition in directed consensus networks
Hassan-Moghaddam, S., Wu, X., & Jovanović, M. R. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963825 · Cited by 10
“The following lemma summarizes the well-known conditions for achieving consensus in the absence of disturbances in directed networks [1].”
BackgroundInfluentialControllability Analysis of Threshold Graphs and Cographs
Mousavi, S. S., Haeri, ء., & Mesbahi, M. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550153 · Cited by 10
“First, note that for a threshold graph of size 1 which is an isolated node, Λ(G) = (0) and V (G) = [1].”
BackgroundSelf-citationGoing Viral: Stability of Consensus-Driven Adoptive Spread
Ruf, S. F., Paarporn, K., & Paré, P. E. (2019) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2019.2952986 · Cited by 10
“The primary opinion dynamic we consider in conjunction with the adoptive spread model in (1) is the canonical Abelson model, which in the 1960 s laid the foundation for the study of opinion dynamics [31] and which has also been studied in the controls community as the consensus protocol [57].”
MethodDistributed Line Formation Control in Swarm Robots
Jiang, Z., Wang, X., & Yang, J. (2018) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2018.8812317 · Cited by 9
“What’s more, Magnus Egerstedt professor[7] and Wei Ren[8] have mainly focused on consensus based formation control, both of them contributed a lot in this field, they also wrote some books about swarm robotics and multi-agent network system for the guidance of the research in the field.”
BackgroundIzumi, S., Azuma, S., & Sugie, T. (2020) · IEEE Access · doi:10.1109/access.2020.2974243 · Cited by 11
“This is because multi-agent control is necessary for realizing a variety of modern systems, such as unmanned aerial vehicles, sensor networks, and smart grids [1].”
BackgroundAlgorithms for sparse stable systems
Belabbas, M.-A. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760413 · Cited by 10
“[1], [2], [3], [4], [5], [6], [7] and references therein.”
A modular functional framework for the design and evaluation of multi-robot navigation
Baumann, C., & Martinoli, A. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103849 · Cited by 9
Tracking Control of Cooperative Marine Vehicles Under Hard and Soft Constraints
Restrepo, E., Matouš, J., & Pettersen, K. Y. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3378392 · Cited by 9
“To study the stability of the external dynamics (34b), we rely on the edge-agreement framework [11] where instead of considering the states of each individual agent (the nodes of the graph), we consider the relative variables that correspond to the edges in the graph.”
Control of multiconsensus in multi-agent systems based on eigenvector centrality
Tomaselli, C., Gambuzza, L. V., Sorrentino, F., & Frasca, M. (2024) · Automatica · doi:10.1016/j.automatica.2024.111638 · Cited by 9
Distributed Privacy-Preserving Optimization With Accumulated Noise in ADMM
Liu, Z., Wang, W., Guo, F., & Gao, Q. Z. (2024) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2024.3424221 · Cited by 10
“Consider an incidence matrix A 0 ∈ R m × n of graph G [37] such that [ A 0 ] ( i , j ) denotes the row corresponding to the edge ( i , j ) and set T ∈ R nd be the vector stacked by agents’ states.”
A matching problem between two decoupled multi-agent systems with reference tracking capabilities
Fedele, G., D’Alfonso, L., & Chen, B. (2024) · Automatica · doi:10.1016/j.automatica.2024.112047 · Cited by 10
“…consider the identities (Eisinberg & Fedele, 2006) Due to the complete connectivity, the i th element of the vector V 𭟋 ( ξ ), namely ( V 𭟋 ( ξ )) i , is (see Mesbahi & Egerstedt, 2010) where the term ξ i − 1 k − ξ i − 1 p can be expanded as It follows that the i th equation of (20) is a…”
Distributed coordination for separable convex optimization with coupling constraints
Niederländer, S. K., & Cortés, J. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402310 · Cited by 8
“works particularly build on consensus-based dynamics [8], [9], [10].”
BackgroundTime-scale separation on networks: Consensus, tracking, and state-dependent interactions
Awad, A., Chapman, A., Schoof, E., et al. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7403190 · Cited by 9
“I. INTRODUCTION Consensus-based systems are an effective approach for networked, multi-agent systems in settings such as multi-vehicle control, formation control, swarming, and distributed estimation [1], [2].”
BackgroundSelf-citationGeneralizations on active-passive dynamic consensus filters
Peterson, J., Yucelen, T., & Pasiliao, E. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525495 · Cited by 9
“PRELIMINARIES ON GRAPH THEORY AND ACTIVE-PASSIVE DYNAMIC CONSENSUS FILTERS First, we recall some basic notions from graph theory (see [12], [13] for further details).”
BackgroundJalalmaab, M., Pirani, M., Fi̇dan, B., et al. (2016) · IEEE Intelligent Vehicles Symposium · doi:10.1109/ivs.2016.7535522 · Cited by 9
“Theorem 1 ( [19]): Consider a multi-agent estimating system where agent ith individual estimate is θi0.”
BackgroundRezaei, V., & Stefanovic, M. (2016) · IEEE Conference on Control Applications (CCA) · doi:10.1109/cca.2016.7587862 · Cited by 9
Distributed Input and State Estimation Using Local Information in Heterogeneous Sensor Networks
Tran, D. M., Yucelen, T., Sarsılmaz, S. B., & Jagannathan, S. (2017) · Frontiers in Robotics and AI · doi:10.3389/frobt.2017.00030 · Cited by 9
Zhang, M., Saberi, A., & Stoorvogel, A. A. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4293 · Cited by 9
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [8], [14], [31] and references therein).”
Koorehdavoudi, K., Roy, S., & Xue, M. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619366 · Cited by 9
“opinion dynamics in networks in the controls community [4]–[9].”
BackgroundMethodInfluentialTop-down synthesis of multi-agent formation control: An eigenstructure assignment based approach
Motoyama, T., & Cai, K. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7962963 · Cited by 9
“Cooperative control of multi-agent systems has been an active research area in the systems control community [1], [2], [3].”
BackgroundContainment Using Incomplete Agent Information Over a Digraph
Sen, A., Sahoo, S. R., & Kothari, M. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2988162 · Cited by 9
“In a digraph, a sequence of edges connecting consecutive nodes is called a directed path [19].”
BackgroundSimultaneous Control of Relative Position and Absolute Attitude for Electromagnetic Spacecraft Swarm
Takahashi, Y., Sakamoto, H., & Sakai, S. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-1104 · Cited by 11
Secure Consensus via Objective Coding: Robustness Analysis to Channel Tampering
Fabris, M., & Zelazo, D. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3177756 · Cited by 9
“Also, the Laplacian matrix containing the topological information about G is addressed as L(G) = EWE> (see [19]).”
BackgroundStochastic control of ecological networks
Dragicevic, A. Z., & Gurtoo, A. (2022) · Journal of Mathematical Biology · doi:10.1007/s00285-022-01777-5 · Cited by 9
“This is a significant contribution to the existing literature, which only succeeded in applying the deterministic optimal control to graph theory (Mesbahi and Egerstedt 2010; Dragicevic 2018).”
BackgroundScaled consensus of second-order multi-agent systems based on edge-event driven control
Cao, M., Zhou, Q., & Cheng, Y. (2022) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.07.044 · Cited by 9
SIS Epidemic Spreading Under Multilayer Population Dispersal in Patchy Environments
Abhishek, V., & Srivastava, V. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3272839 · Cited by 9
“Some common generalizations of the SIR/SIS models include the SEIR model [11], [18], where an additional compartment “exposed” is introduced, SIRS [3], where individuals get temporary immunity after recovery and then become susceptible again, and SIRI [19], [20], where, after recovery, agents…”
BackgroundMulti-constructor CMSA for the maximum disjoint dominating sets problem
Rosati, R. M., Bouamama, S., & Blum, C. (2023) · Computers & Operations Research · doi:10.1016/j.cor.2023.106450 · Cited by 11
Network Controllability Perspectives on Graph Representation
Said, A., Ahmad, O. U., Abbas, W., Shabbir, M., & Koutsoukos, X. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3331318 · Cited by 9
“Inthis paper, wedesignanovel graphrepresentationgrounded in the network controllability paradigm [1].”
BackgroundInfluentialObservability Blocking for Functional Privacy of Linear Dynamic Networks
Zhang, Y., Cheng, R., & Xia, Y. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10384211 · Cited by 9
“A typical example is the multi-agent system where each agent is a single integrator running the consensus protocol [16].”
BackgroundInfluentialDistributed Hybrid Controllers for Multi‐Agent Mass Games By A Variable Number of Player Agents
Izumi, S., Azuma, S., & Sugie, T. (2014) · Asian Journal of Control · doi:10.1002/asjc.930 · Cited by 9
“It has been shown in [4] that the coverage controller in (5) corresponds to the gradient descent algorithm for J .”
BackgroundThe degree of nonholonomy in distributed computations
Costello, Z., & Egerstedt, M. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040343 · Cited by 7
“The initial state is x(t0) = [1, 2, 3, 4]T and the final state is x(tf ) = [2, 1, 4, 3]T , i.”
BackgroundSelf-citationGnecco, G., Morisi, R., & Bemporad, A. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039729 · Cited by 9
“Interestingly, in the undirected case, determining the weights that optimize such spectral properties can be formulated as a convex optimization problem [5] (specifically, as a semidefinite program (SDP)), which is known as the Fastest Mixing Markov-Chain problem (Problem FMMC, in the paper) and can be solved efficien…”
MethodInfluentialMulti-level holonification of multi-agent networks
Esmaeili, A., Mozayani, N., & Motlagh, M. R. J. (2014) · Iranian Conference on Intelligent Systems (ICIS) · doi:10.1109/iraniancis.2014.6802553 · Cited by 9
“In such problems, when modeled by a MAS, on the one hand the agents need to operate in concert with each other in order to achieve system level goals, and on the other hand, they have a limited access to the computational resources and communication capabilities.”
BackgroundApproximate manipulability of leader-follower networks
Kawashima, H., & Egerstedt, M. (2011) · doi:10.1109/cdc.2011.6160974 · Cited by 9
“An example for eij is (see [1] and the references therein) eij(||xi − xj ||) = ||xi − xj || − dij .”
BackgroundSelf-citationOn control of multiagent formations through local interactions
Tran, D. M., & Yucelen, T. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799061 · Cited by 10
“We first recall some basic notions from graph theory, where we refer to [2], [20] for details.”
BackgroundDecentralized Estimation of Spacecraft Relative Motion Using Consensus Extended Kalman Filter
Wang, J., & Butcher, E. A. (2018) · doi:10.2514/6.2018-1965 · Cited by 9
Distributed formation for robotic swarms considering their crossing motion
Kobayashi, Y., Endo, T., & Matsuno, F. (2018) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2018.09.012 · Cited by 11
Generalized Graph Product: Spectrum, Trajectories and Controllability
Tran, T. N., & Chapman, A. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8618713 · Cited by 9
“Network controllability becomes important when a networked system is controlled by an external signal or influence; example in networked systems are networked robotic systems [18], [19], humanswarm interaction [20], network security [21], and quantum networks [22].”
Background
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.