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 201–300 of 2,960
Network Identification via Node Knockout
Nabi-Abdolyousefi, M. (2014) · Springer theses · doi:10.1007/978-3-319-02429-5_2 · Cited by 64
A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
Cao, M., Zhang, S., & Camlibel, M. K. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2208314 · Cited by 64
“When the agents’ dynamics are determined by linear nearestneighbor couplings and thus the overall system can be modeled as a linear system, it is clear from the classical systems theory that such controllability conditions can be delineated explicitly using algebraic conditions by computing the eigenstructure of the s…”
BackgroundRobustness of Leader–Follower Networked Dynamical Systems
Pirani, M., Shahrivar, E. M., Fidan, B., & Sundaram, S. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2756346 · Cited by 70
“Using Weyl’s inequality (31) for constant p we have (1 − o(1))(n − |S|)p ≤ λn−|S|(L̄) ≤ (1 + o(1))(n − |S|)p asymptotically almost surely [52].”
Decentralized observers with consensus filters for distributed discrete-time linear systems
Acikmese, B. A., Mandić, M., & Speyer, J. L. (2014) · Automatica · doi:10.1016/j.automatica.2014.02.008 · Cited by 64
“We refer to Mesbahi and Egerstedt (2010) for a graph theoretic view of multi-agent networks.”
Resilient and Consistent Multirobot Cooperative Localization With Covariance Intersection
Chang, T.-K., Chen, K., & Mehta, A. M. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3104965 · Cited by 68
Adaptive Fault-Tolerant Distributed Formation Control of Clustered Vertical Takeoff and Landing UAVs
Zou, Y., Xia, K., & He, W. (2021) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3117368 · Cited by 63
“Inspired by the bioclustering behavior, recent years have witnessed the rapid development in multiagent systems, by virtue of their potential in characterizing a variety of social or natural phenomena and engineering applications including sociology, biology, mechanics, and robotics [1]–[4].”
BackgroundOn the control of microgrids against cyber-attacks: A review of methods and applications
Solat, A., Gharehpetian, G. B., Naderi, M. S., & Anvari‐Moghaddam, A. (2023) · Applied Energy · doi:10.1016/j.apenergy.2023.122037 · Cited by 76
“Considering MASs, the communication topology is described by an indirect graph [58-65].”
MethodConstrained consensus via logarithmic barrier functions
Lee, U., & Mesbahi, M. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161496 · Cited by 64
“In particular, any graph Laplacian matrix associated with a connected graph can be written as the sum where G tree = ( V, E 1 ) , G edge = ( V, E 2 ) , and Proof: See [2] Proposition 3: The constrained agreement protocol, Eq.”
BackgroundSelf-citationFormation Control and Trajectory Tracking of Nonholonomic Mobile Robots
Saradagi, A., Muralidharan, V., Krishnan, V., et al. (2017) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2017.2749563 · Cited by 63
“In comparison, the literature on nonholonomic robots, such as unicycles and mobile inverted pendulum (MIP) robots [8], [9], is not significant as is evident from the recent surveys [5], [6].”
BackgroundResultDynamics and control of state-dependent networks for probing genomic organization
Rajapakse, I., Groudine, M. T., & Mesbahi, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1113249108 · Cited by 74
Self-citationChen, W., & Li, X. (2012) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.2906 · Cited by 62
“Up until now, lots of interesting results have been obtained, for example, see the survey papers [5,6] and books [7–9] and reference therein, just to name a few.”
ResultMarkov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents
Acikmese, B. A., & Bayard, D. S. (2014) · Asian Journal of Control · doi:10.1002/asjc.982 · Cited by 67
“Various schemes applicable for swarm guidance have appeared in the literature [1–12].”
BackgroundMethodRobust Distributed Linear Programming
Richert, D., & Cortés, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2404451 · Cited by 60
“build on consensus-based dynamics [17]–[20] whereby individual agents agree on the global solution to the optimization prob-”
BackgroundBroadcast control of multi-agent systems
Azuma, S., Yoshimura, R., & Sugie, T. (2013) · Automatica · doi:10.1016/j.automatica.2013.04.022 · Cited by 62
Persistification of Robotic Tasks
Notomista, G., & Egerstedt, M. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2020.2978913 · Cited by 62
“…x − x i (cid:17) ) = (cid:17) x − x i 2 allows us to define the following gradient descent flow to be used as a control law for moving the robots [44]: In (24), k p > 0 is a proportional gain and C V i is the centroid of the i th Voronoi cell defined as (cid:28) (cid:26)(cid:28) In case the map φ…”
BackgroundSelf-citationD’Alfonso, L., Giannini, F., Franzè, G., Fedele, G., Pupo, F., & Fortino, G. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2023.123705 · Cited by 68
Reaching a Quantum Consensus: Master Equations that Generate Symmetrization and Synchronization
Shi, G., Dong, D., Petersen, I. R., & Johansson, K. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2434034 · Cited by 63
“IN the past decades, distributed control and optimization methods have witnessed a wide range of applications in network systems such as multi-vehicle systems, wireless communication networks, smart grids, and social networks [2]–[6].”
BackgroundSpectral identification of topological domains
Chen, J., Hero, A. O., & Rajapakse, I. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw221 · Cited by 67
“See (Mesbahi and Egerstedt, 2010; Chung, 1997) for more details on spectral matrix theory for weighted matrices.”
BackgroundNeural Dynamics for Distributed Collaborative Control of Manipulators With Time Delays
Jin, L., Zheng, X., & Luo, X. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105446 · Cited by 60
Dynamic Distributed Control for Networks With Cooperative–Antagonistic Interactions
Meng, D. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2763536 · Cited by 60
“Clearly, in the trivial case when A ≥ 0 is a nonnegative matrix, LA becomes a traditional Laplacian matrix such that LA 1n = 0 [1], [2], [5].”
BackgroundWang, Z., Xie, H., Hu, Z., et al. (2019) · Journal of Algorithms & Computational Technology · doi:10.1177/1748302619889498 · Cited by 60
“The wolves are mutated according to equations (18) and (19), and the wolves are processed out of range according to equation (22).”
BackgroundZou, Y., Wang, L., & Meng, Z. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2020.3032395 · Cited by 61
Structural Monostability of Activation-Inhibition Boolean Networks
Azuma, S., Yoshida, T., & Sugie, T. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2485440 · Cited by 59
“(See, for example, [1], [2], and references therein.”
On the Delayed Scaled Consensus Problems
Shang, Y. (2017) · Applied Sciences · doi:10.3390/app7070713 · Cited by 59
“Different from traditional centralized controllers, the designed protocols take advantage of nearest-neighbor rules rendering the multi-agent systems in a distributed network framework governed by the graph Laplacians [1] since each agent can only interact with those within its local area due to limited communication…”
BackgroundInfluentialConsensus on Matrix-Weighted Switching Networks
Pan, L., Shao, H., Mesbahi, M., Xi, Y., & Li, D. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3063115 · Cited by 75
Self-citationIntroduction to Complex Networks: Structure and Dynamics
Estrada, E. (2014) · Lecture notes in mathematics · doi:10.1007/978-3-319-11322-7_3 · Cited by 62
“7 Illustration of the trajectory of the consensus model (adapted from [30]) 0 u”
BackgroundInfluentialTorre, G. D. L., & Yucelen, T. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1286040 · Cited by 58
“We now recall some of the basic notions from graph theory and networked multiagent systems (Mesbahi & Egerstedt, 2010; Ren & Beard, 2007).”
BackgroundMethodYi, P., & Pavel, L. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264224 · Cited by 57
“The following concepts of graph theory are reviewed from [28].”
BackgroundYi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3108501 · Cited by 83
“If the graph G is connected, then its Laplacian matrix L is positive semi-definite and null( L ) = { 1 n } , see [67].”
BackgroundRigidity theory in SE(2) for unscaled relative position estimation using only bearing measurements
Zelazo, D., Franchi, A., & Giordano, P. R. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862558 · Cited by 56
Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
Kohnosuke, O., Fukami, T., & Takahashi, N. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2503561 · Cited by 65
Human-Guided Multirobot Cooperative Manipulation
Sieber, D., & Hirche, S. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2018.2813323 · Cited by 54
“Since Afms is always regular [31], α =−1 and bfms = 1.”
BackgroundZhang, X., Zhang, F., & Huang, P. (2023) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2023.3279827 · Cited by 55
Couple-group consensus of continuous-time multi-agent systems under Markovian switching topologies
Shang, Y. (2015) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2015.08.003 · Cited by 55
Control of multivehicle systems in the presence of uncertain dynamics
Yucelen, T., & Johnson, E. N. (2013) · International Journal of Control · doi:10.1080/00207179.2013.790077 · Cited by 55
“…decades have witnessed increasing attention to the problem of cooperative control (see, for example, Ren et al. (2005), Olfati-Saber et al. (2007), Mesbahi & Egerstedt (2010), and references therein). o The vehicle models used in the design of cooperative control methodologies are often based on…”
BackgroundMethodInfluentialLow complexity resilient consensus in networked multi-agent systems with adversaries
LeBlanc, H. J., & Koutsoukos, X. (2012) · ACM International Conference on Hybrid Systems: Computation and Control (HSCC) · doi:10.1145/2185632.2185637 · Cited by 52
“As is common when dealing with multiagent networks, we model the networked multi-agent system with a (finite, simple, labelled) digraph, D = (V, E) [12].”
BackgroundA Decentralized Controller-Observer Scheme for Multi-Agent Weighted Centroid Tracking
Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2220032 · Cited by 56
“A wide overview on such problems can be found in [10], [16] or in the recent books [4], [13], [19].”
BackgroundObserver-based cyber attack detection and isolation in smart grids
Luo, X., Yao, Q., Wang, X., et al. (2018) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2018.02.039 · Cited by 55
Continuous-time stochastic Mirror Descent on a network: Variance reduction, consensus, convergence
Raginsky, M., & Bouvrie, J. (2012) · doi:10.1109/cdc.2012.6426639 · Cited by 54
“This observation then motivates a distributed implementation of MD by a network of noisy agents (processors), coupled linearly through the Laplacian of the network graph [12].”
BackgroundMethodInfluentialEvent-Based Vehicle Coordination Using Nonlinear Unidirectional Controllers
Linsenmayer, S., Dimarogonas, D. V., & Allgöwer, F. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2733959 · Cited by 54
“Due to the definition in [16] given in Section II one of the key properties of a rooted out-branching is that it does not contain (directed) cycles.”
BackgroundResultTang, W., & Daoutidis, P. (2018) · Journal of Process Control · doi:10.1016/j.jprocont.2018.01.009 · Cited by 54
Optimization-Based Distributed Flocking Control for Multiple Rigid Bodies
Ibuki, T., Wilson, S., Yamauchi, J., Fujita, M., & Egerstedt, M. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2969950 · Cited by 69
“The interconnection topology between rigid bodies is represented by an undirected graph G = (V, E) [23], where V is the set of rigid bodies and E ⊂ V × V the edge set defining information flow between rigid bodies.”
BackgroundSelf-citationLag consensus of the second-order leader-following multi-agent systems with nonlinear dynamics
Wang, Y., & Ma, Z. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.06.020 · Cited by 56
An Artificially Weighted Spanning Tree Coverage Algorithm for Decentralized Flying Robots
Dong, W., Liu, S., Ding, Y., Sheng, X., & Zhu, X. (2020) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2020.2971324 · Cited by 54
“occurs in part of cooperation members [17].”
MethodCoverage-Based Interception Algorithm of Multiple Interceptors Against the Target Involving Decoys
Zhai, C., He, F., Hong, Y., et al. (2016) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g001535 · Cited by 53
Leader-Follower Fixed-Time Group Consensus Control of Multiagent Systems under Directed Topology
Shang, Y., & Ye, Y. (2017) · Complexity · doi:10.1155/2017/3465076 · Cited by 56
“Each subgroupGk (1 ≤ k ≤ K) inherits the structure ofG naturally in the sense of induced subgraph [34].”
BackgroundAhmed, Z., Khan, M. M., Saeed, M. A., et al. (2020) · ISA Transactions · doi:10.1016/j.isatra.2020.02.005 · Cited by 53
Data-Based Receding Horizon Control of Linear Network Systems
Allibhoy, A., & Cortes, J. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3021050 · Cited by 63
On the Definiteness of the Weighted Laplacian and its Connection to Effective ResistancePreprint
Zelazo, D. (2016) · Cited by 53
Robust Coordinated Hybrid Source Seeking With Obstacle Avoidance in Multivehicle Autonomous Systems
Poveda, J. I., Benosman, M., Teel, A. R., & Sanfelice, R. G. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3056365 · Cited by 53
Consensus and disturbance attenuation in multi‐agent chains with nonlinear control and time delays
Zhang, L., & Orosz, G. (2016) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3600 · Cited by 55
“One fundamental design objective of multi-agent networks is to achieve consensus, which requires all agents to maintain desired relative states with respect to their neighbors [6].”
BackgroundCommunication-Based Decentralized Demand Response for Smart Microgrids
Sakurama, K., & Miura, M. (2016) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2631133 · Cited by 52
“If Gcom m does not contain a spanning tree, consensus is not achieved, namely (11) does not hold [59].”
BackgroundConvergence analysis of directed signed networks via an M-matrix approach
Meng, D. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1294263 · Cited by 52
“Networks which consist of multiple nodes/agents have attracted considerable research interests (see e.g. Cao, Yu, Ren, & Chen, 2013; Mesbahi & Egerstedt, 2010; OlfatiSaber, Fax, & Murray, 2007; and references therein).”
BackgroundCooperative Orbital Control of Multiple Satellites via Consensus
Zhang, H., & Gurfil, P. (2018) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2018.2808118 · Cited by 53
“Algebraic graph theory [27] is crucial for analyzing stability and convergence.”
BackgroundStability and synchronization preserving model reduction of multi-agent systems
Monshizadeh, N., Trentelman, H. L., & Camlibel, M. K. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2012.10.011 · Cited by 51
“After the edges are labeled and oriented arbitrarily, the incidence matrix of G , denoted by R , is defined as (see [14, p. 21]): for i = 1 , 2 , . . . , p and j = 1 , 2 , . . . , q , where p and q are the total number of vertices and edges, respectively.”
InfluentialOptimal topology design for dynamic networks
Dai, R., & Mesbahi, M. (2011) · doi:10.1109/cdc.2011.6161026 · Cited by 51
“Lemma 2: Let M be a positive semidefinite matrix.”
MethodSelf-citationDistributed estimation of algebraic connectivity of directed networks
Li, C., & Qu, Z. (2013) · Systems & Control Letters · doi:10.1016/j.sysconle.2013.03.002 · Cited by 51
“Suppose the smallest non-zero eigenvalue of L is denoted by λ2(L), and [20, 21]”
BackgroundAsynchronous Multiagent Primal-Dual Optimization
Hale, M., Nedić, A., & Egerstedt, M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2662019 · Cited by 56
Self-citationReduction of Second-Order Network Systems With Structure Preservation
Cheng, X., Kawano, Y., & Scherpen, J. M. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2679479 · Cited by 51
“N ETWORK systems capture the behaviors and dynamics of many interconnected physical models and have received compelling attention from the system and control community, see [1]–[3] for an overview.”
BackgroundWireless Sensor Network Deployment Optimization Based on Two Flower Pollination Algorithms
Wang, Z., Xie, H., He, D., et al. (2019) · IEEE Access · doi:10.1109/access.2019.2959949 · Cited by 51
“Then, according to the matrix power algorithm of [29], it can be judged whether the whole network is connected using the”
Zhang, X., Zhang, F., Huang, P., Gao, J., Yu, H., Pei, C., & Zhang, Y. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3057294 · Cited by 57
“Lemma 1 ([26]): If a graph is connected, then its Laplacian matrix L is positive semidefinite.”
BackgroundA Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization
Yi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105554 · Cited by 57
“Recall that the Laplacian matrix L is positive semi-definite and null(L) = {1n} when G is connected [38].”
Wang, B., Nersesov, S. G., & Ashrafiuon, H. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3141022 · Cited by 50
“For more details on algebraic graph theory, see [19].”
Learning safe control for multi-robot systems: Methods, verification, and open challenges
Garg, K., Zhang, S., So, O., Dawson, C., & Fan, C. (2024) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2024.100948 · Cited by 75
A distributed algorithm for average consensus on strongly connected weighted digraphs
Priolo, A., Gasparri, A., Montijano, E., & Sagüés, C. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.026 · Cited by 52
Zeng, Z., Wang, X., & Zheng, Z. (2015) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3351 · Cited by 48
“As known that the “out-degree” relates how each node in the network impacts on other nodes, but the “in-degree” directly captures how the dynamics of an agent is influenced by others [15].”
Decentralized probabilistic density control of autonomous swarms with safety constraints
Demir, N., Eren, U., & Acikmese, B. A. (2015) · Autonomous Robots · doi:10.1007/s10514-015-9470-z · Cited by 49
“…(Richards et al. 2002; Tillerson et al. 2002; Scharf et al. 2003; Kim et al. 2004; Hadaegh et al. 2013; Açıkme¸se et al. 2007; Ramirez et al. 2010; Mesbahi and Egerstedt 2010) appeared in the literature that control individual agents’ motions directly and in a tightly coupled manner in order to…”
BackgroundDistributed graph-based convoy control for networked intelligent vehicles
Marjovi, A., Vasic, M., Lemaitre, J., & Martinoli, A. (2015) · 2015 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2015.7225676 · Cited by 48
“This current study is integrated in an ongoing European project named AutoNet20301 and proposes a methodology for dynamic convoying of intelligent vehicles in highway scenarios.”
MethodSemi-Autonomous Consensus: Network Measures and Adaptive Trees
Chapman, A., & Mesbahi, M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2205429 · Cited by 49
“, , 3) is the velocity of agent , , and is dependent on the relative velocities of neighboring agents, used in scenarios such as UAV flocking and fish swarming [6], [11].”
BackgroundResultInfluentialSelf-citationFormation control using binary information
Jafarian, M., & Persis, C. D. (2015) · Automatica · doi:10.1016/j.automatica.2014.12.016 · Cited by 49
“This problem has been addressed with different approaches e.g. Arcak (2007), Bai, Arcak, and Wen (2011), Bullo, Cortés, and Martınez (2009), Mesbahi and Egerstedt (2010), Ren and Beard (2007) and Ren and Cao (2011).”
BackgroundMethodCoherence in synchronizing power networks with distributed integral control
Andreasson, M., Tegling, E., Sandberg, H., & Johansson, K. H. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264613 · Cited by 55
Autonomous collision avoidance for wheeled mobile robots using a differential game approach
Mylvaganam, T., & Sassano, M. (2017) · European Journal of Control · doi:10.1016/j.ejcon.2017.11.005 · Cited by 49
State synchronization of multi-agent systems via static or adaptive nonlinear dynamic protocols
Liu, Z., Zhang, M., Saberi, A., et al. (2018) · Automatica · doi:10.1016/j.automatica.2018.05.034 · Cited by 49
On multi-consensus and almost equitable graph partitions
Monaco, S., & Celsi, L. R. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.021 · Cited by 49
“It easily follows from the proof of Theorem 3.12 in (Mesbahi and Egerstedt, 2010), with the only difference that in this case we recover (4) since, by assumption, λ 1 = λ 2 = . . . = λ µ = 0 and λ µ +1 , . . . , λ n are such that their real parts are strictly positive.”
BackgroundInfluentialBüyükkoçak, A. T., Aksaray, D., & Yazıcıoğlu, Y. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3057049 · Cited by 49
“Accordingly, a great deal of research focuses on the design of scalable and provably correct algorithms for achieving cooperative tasks such as formation (e.g., [1]), consensus (e.g., [2], [3]), task allocation (e.g., [4], [5]), or coverage control (e.g., [6], [7]).”
BackgroundAlgorithms for leader selection in large dynamical networks: Noise-corrupted leaders
Fu, L., Fardad, M., & Jovanović, M. R. (2011) · doi:10.1109/cdc.2011.6161507 · Cited by 49
“INTRODUCTION The consensus of the multi-agent networks is of fundamental interest in the context of distributed control [1]– [4].”
BackgroundAminzare, Z., & Sontag, E. D. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2395075 · Cited by 54
“We will use ideas from spectral graph theory, see for example [47].”
MethodBuilding temperature control: A passivity-based approach
Mukherjee, S., Mishra, S., & Wen, J. T.-Y. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426676 · Cited by 50
Chicoli, A., Butail, S., Lun, Y., Bak-Coleman, J. B., Coombs, S., & Paley, D. A. (2014) · Journal of Fish Biology · doi:10.1111/jfb.12365 · Cited by 50
“Who interacts with whom can be represented and analysed by modelling the interaction network (Ballerini et al., 2008; Mesbahi & Egerstedt, 2010), in which each individual receives information from a possibly limited number of neighbours according to a set of interaction rules.”
BackgroundShang, Y. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2015.08.115 · Cited by 48
Strong targeted controllability of dynamical networks
Monshizadeh, N., Camlibel, M. K., & Trentelman, H. L. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402965 · Cited by 48
“The mainstream of research in this direction has been devoted to controllability analysis of networks with symmetric unweighted Laplacian matrix, see ⇤ Engineering and Technology Institute Groningen, University of Groningen, The Netherlands , Email: n.monshizadeh@rug.nl † Johann Bernoulli Institute for Mathematics and…”
BackgroundFixed-Time Group Tracking Control With Unknown Inherent Nonlinear Dynamics
Shang, Y., & Ye, Y. (2017) · IEEE Access · doi:10.1109/access.2017.2723462 · Cited by 48
“The communication topology of a multi-agent system can often be described by a graph [32].”
BackgroundRobust Multitask Formation Control via Parametric Lyapunov-Like Barrier Functions
Han, D., & Panagou, D. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2894587 · Cited by 48
“Note that system (1) is a practical model widely adopted in autonomous driving and wheeled swarm robotics [4], and the model with holonomic kinematics will also be discussed in Section IV.”
BackgroundDistance-Based Multiagent Formation Control With Energy Constraints Using SDRE
Babazadeh, R., & Šelmić, R. R. (2019) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2910361 · Cited by 48
“For the agent i, the neighboring set Ni is defined as a set of agents that are adjacent to it [34].”
Network-based deployment of nonlinear multi agents over open curves: A PDE approach
Terushkin, M., & Fridman, E. (2021) · Automatica · doi:10.1016/j.automatica.2021.109697 · Cited by 50
Bearing-compass formation control: A human-swarm interaction perspective
Schoof, E., Chapman, A., & Mesbahi, M. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859380 · Cited by 47
“Significant of late is the problem’s formulation from a distributed point-of-view, where an individual robotic agent only uses local information for its operation [1], [2].”
BackgroundInfluentialSelf-citationLearning Transferable Cooperative Behavior in Multi-Agent Teams
Agarwal, A., Kumar, S., Sycara, K. P., & Lewis, M. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/edcb3795 · Cited by 167
“We evaluate our proposed model on three standard swarm robotics tasks (Mesbahi and Egerstedt, 2010; Balch and Arkin, 1998): coverage control , formation control and line control .”
MethodDiscrete-Time Matrix-Weighted Consensus
Tran, Q. V., Trinh, M. H., & Ahn, H. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3068367 · Cited by 47
Network-based analysis of fluid flows: Progress and outlook
Taira, K., & Nair, A. (2022) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2022.100823 · Cited by 53
“Ö.D. Gürcan Physica D 426 (2021) 132983 This modeling effort also revealed that the first POD pair serves as the leader node and the remaining nodes act as followers (Mesbahi and Egerstedt, 2010).”
BackgroundInfluentialEgerstedt, M. (2011) · Nature · doi:10.1038/473158a · Cited by 47
Self-citationCoordinate-free formation stabilization based on relative position measurements
Aranda, M., Nicolás, G. L., Sagüés, C., & Zavlanos, M. M. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.030 · Cited by 46
“We also assume the agents have synchronized clocks, a common practical requirement in networked multiagent systems (Cortés, Mart́ınez, & Bullo, 2006; Mesbahi & Egerstedt, 2010; Schwager, Julian, Angermann, & Rus, 2011).”
BackgroundMethodInfluentialProvable self-organizing pattern formation by a swarm of robots with limited knowledge
Coppola, M., Guo, J., Gill, E. K. A., & de Croon, G. (2019) · Swarm Intelligence · doi:10.1007/s11721-019-00163-0 · Cited by 57
“To address that the swarm may not always begin in a fully connected topology, Ji and Egerstedt (2007) and Mesbahi and Egerstedt (2010) proposed the use of a gathering algorithm so that all robots come together prior to initiating the pattern formation task.”
BackgroundDistributed iterative learning control for multi-agent systems
Hock, A., & Schoellig, A. P. (2019) · Autonomous Robots · doi:10.1007/s10514-019-09845-4 · Cited by 48
Robust Cooperative Output Regulation for a Network of Parabolic PDE Systems
Deutscher, J. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3079352 · Cited by 46
Ju, Z., Zhang, H., & Tan, Y. (2021) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2021.3084964 · Cited by 50
Optimal leader allocation in UAV formation pairs ensuring cooperation
Richert, D., & Cortés, J. (2013) · Automatica · doi:10.1016/j.automatica.2013.07.030 · Cited by 46
“In the cooperative control literature, there are numerous instances of the performance benefits obtained by a group of agents collaborating towards the achievement of a commongoal, see e.g. Ren andBeard (2008), Bullo, Cortés, andMartínez (2009), Mesbahi and Egerstedt (2010) and references therein.”
BackgroundResilient control of multi-microgrids against false data injection attack
Yassaie, N., Hallajiyan, M., Sharifi, I., & Talebi, H. A. (2020) · ISA Transactions · doi:10.1016/j.isatra.2020.10.030 · Cited by 50
Bono, A., Fedele, G., & Franzè, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3070461 · Cited by 52
“In this respect, several contributions have been presented as outlined in [1] and [2] and the references therein.”
BackgroundResilient Monitoring in Heterogeneous Multi-Robot Systems Through Network Reconfiguration
Ramachandran, R. K., Pierpaoli, P., Egerstedt, M., & Sukhatme, G. S. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3128313 · Cited by 49
Self-citationPromkaew, N., Thammawiset, S., Srisan, P., Sanitchon, P., Tummawai, T., & Sukpancharoen, S. (2024) · Results in Engineering · doi:10.1016/j.rineng.2024.102280 · Cited by 53
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.