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 2,301–2,400 of 2,960
Algorithm for Simultaneous Target Interception by Group of Unmanned Aerial Vehicles
Popov, A. M., Kostrygin, D. G., & Shevchik, A. A. (2024) · International Russian Smart Industry Conference (SmartIndustryCon) · doi:10.1109/smartindustrycon61328.2024.10515733 · Cited by 1
“The method involves using an information graph to connect agents, which is constructed according to certain rules [6, 13].”
MethodConsensus-Based Thompson Sampling for Stochastic Multiarmed Bandits
Hayashi, N. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3426379 · Cited by 1
“Since the communication graph G is undirected and connected, all eigenvalues of the Laplacian matrix L are real, L has the simple eigenvalue of 0, and all other eigenvalues are positive [36].”
Robust Stability for Multiagent Systems with Spatio-Temporally Correlated Packet Loss
Hespe, C., Datar, A., & Werner, H. (2024) · European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10591287 · Cited by 1
Leader-Follower Consensus on Matrix-Weighted Switching Networks
Wang, K., Pan, L., Shao, H., et al. (2024) · doi:10.1109/icca62789.2024.10591853 · Cited by 1
“Distributed consensus algorithms play a crucial role in distributed estimation, control, optimization, and learning of multi-agent networks [1], [2], [3].”
BackgroundLiu, Z., Zhang, M., Saberi, A., et al. (2024) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7605 · Cited by 1
“Some of the existing work can be found in [1, 2, 5, 13, 16, 18, 24] and the references therein.”
BackgroundDistributed Least-Squares Optimization Solvers with Differential Privacy
Liu, W., Wang, L., Guo, F., Wu, Z., & Su, H. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644636
“(Privacy) The ( ϵ, δ ) -differential privacy of θ i , i ∈ V is preserved under µ adjacency. ii).”
Strong Structural Controllability of Linear Descriptor Systems
Mousavi, S. S., Bahrami, S., & Fekih, A. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644477 · Cited by 1
“In recent years, network controllability of dynamical systems has received significant attention from both control and network communities as it allows for a structural analysis and synthesis of large-scale networks [1].”
BackgroundAn Auxiliary Graph for Clock Rigidity Analysis
Wen, R., Schoof, E., & Chapman, A. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644699 · Cited by 1
“Corollary 9: Given a generically clock rigid graph G , a configuration (cid:101) φ is generic for clock rigidity of G if and only if p ( G , (cid:101) φ ) is generic for bearing rigidity of G ′ ( G ) .”
BackgroundInfluentialClosed-loop Analysis of Thermal Energy Storage Device Arrangement in a Thermal Management System
Dewanatha, P. P., Gulewicz, D., & Jain, N. (2024) · I-THERM :/I-THERM - Intersociety Conference on Thermal Phenomena in Electronic Systems · doi:10.1109/itherm55375.2024.10709619 · Cited by 1
“A major advantage of using this approach is that the mathematical properties of graphs facilitate analysis of the open and closed-loop dynamics, as well as control synthesis [21].”
BackgroundPoint Cloud-Based End-to-End Formation Control Using a Two Stage SAC Algorithm
Li, M., Liu, H., Xie, F., et al. (2025) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2025.3530161 · Cited by 1
Sarioglu, E., Kurttisi, A., & Dogan, K. M. (2025) · AIAA SciTech Forum · doi:10.2514/6.2025-0104 · Cited by 1
Assignment and distributed control of laplacian null space in multiagent systems
Tran, D. M., Yucelen, T., Kurtoglu, D., & Sarsılmaz, S. B. (2025) · International Journal of Control · doi:10.1080/00207179.2025.2463568 · Cited by 2
“…is connected (hereinafter referred to as the standard Laplacian matrix) (Das et al., 2002; Lewis et al.,2014 ; Li et al., 2015; Liu et al.,2017 ; Mesbahi & Egerstedt,2010 ; Mesbahi & Hadaegh, 2001; Olfati-Saber & Murray,2004 ; Ren & Beard, 2007; Ren & Sorensen, 2008; Su & Lin, 2016; Tanner et…”
InfluentialCommunication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks
Xu, Z., Garimella, S. S., & Tzoumas, V. (2025) · IEEE Transactions on Robotics · doi:10.1109/tro.2025.3567540 · Cited by 14
“…action through a communication channel ( i → j ) ∈ E ; 3) τ # is the time for transmitting a real number through a communication channel ( i → j ) ∈ E ; evidently, τ # τ f and τ # τ c ; 4) diam ( G ) is the diameter of a graph G , i.e., the longest shortest path among any pair of nodes in G [56].”
Hierarchical structures in multi-agent systems: Containment control and opinion dynamics
D’Alfonso, L., & Fedele, G. (2025) · Systems & Control Letters · doi:10.1016/j.sysconle.2025.106188 · Cited by 1
Distributed graph augmentation protocols to achieve strong connectivity in multi-agent networks
Ramos, G., Poças, D., & Pequito, S. (2025) · Automatica · doi:10.1016/j.automatica.2025.112539 · Cited by 2
On the discrepancy between the task and communication graphs in multi-agent control systems
Charitidou, M., & Dimarogonas, D. V. (2025) · European Control Conference (ECC) · doi:10.23919/ecc65951.2025.11186910 · Cited by 1
“■ Notice that according to Proposition 2 the notion of path homeomorphism is less strong than graph automorphism [17, Def.”
Nonnegative Matrices and Graph Theory
Fuhrmann, P. A., & Helmke, U. (2015) · Universitext · doi:10.1007/978-3-319-16646-9_8 · Cited by 1
Spatial Dynamics of Green Corridors
Boulanger, V., Bruchiamacchie, M., Chauchard, S., et al. (2013) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1
Consensus Problem of Multi-agent Systems with Sensing Constraint on Range
Wang, M., & Uchida, K. (2012) · International Symposium on Computational Intelligence and Design · doi:10.1109/iscid.2012.124 · Cited by 1
The second-order parametric consensus protocol
Morbidi, F. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862289 · Cited by 1
“In recent years, a large body of research has started to explore the system-theoretic properties of the consensus protocol [1], such as its robustness against communication delays, noisy measurements and switching topologies [2], [3], and − by introducing suitable input/output signals − its controllability and observa…”
BackgroundAttitude consensus using networks of uncalibrated cameras
Thunberg, J., & Xiaoming Hu, A. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896841 · Cited by 1
“, ξn) ∈ R such that L′ = diag(ξ)L(G, A) is the Graph Laplacian matrix of a balanced graph G′, where L is the graph Laplacian matrix of the graph G with adjacency matrix A [23].”
BackgroundConsensus of complex network systems and ergodicity of Markov chains
Han, H., Wang, Z., & Zhou, Q. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.0060 · Cited by 1
Consensus analysis of double integrator agents with persistent interaction graphs
Chowdhury, N. R., & Sukumar, S. (2015) · Australian Control Conference · Cited by 1
A Combinatorial Necessary and Sufficient Condition for Cluster Consensus
Shang, Y. (2015) · Northumbria Research Link (Northumbria University) · doi:10.48550/arxiv.1509.01123 · Cited by 1
“We refer th reader to the textbooks [4], [17] for more details.”
Zhai, S., Xiong, S., Liu, G., & Li, Q. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554563 · Cited by 1
Madjidian, D., & Mirkin, L. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.07.508 · Cited by 1
Adaptive formation control with self-equilibrium forces
MASUDA, Y., & NAGASE, K. (2016) · IEEE International Conference on Advanced Intelligent Mechatronics (AIM) · doi:10.1109/aim.2016.7576915 · Cited by 1
“Assumption 1 is the condition that the system has no degree of freedom except the rigid-body motion [11].”
BackgroundGroup-Size Selection for a Parameterized Class of Predator-Prey Models
de la Croix, J.-P., & Egerstedt, M. (2014) · SMARTech Repository (Georgia Institute of Technology) · Cited by 1
Self-citationA variant of the cyclic pursuit scheme for consensus in multi-agent systems
Iqbal, M., Hung, P. D., Leth, J., et al. (2016) · International Conference on Advanced Technologies for Communications · doi:10.1109/atc.2016.7764827 · Cited by 1
“INTRODUCTION The unprecedented growth in the literature of distributed control is due to the potential applications such as satellite formation control, sensors network, control of UAVs, etc, [1], [2].”
BackgroundMulti-leader selection in complex networks
Wang, D., Chen, W., & Qiu, L. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798518 · Cited by 1
“Many studies on single leader selection have been reported during past decades, e.g., [8], [9].”
BackgroundCluster consensus of multi-agent systems with communication delay (ICCAS 2013)
Wang, M., & Uchida, K. (2013) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.1109/iccas.2013.6703942 · Cited by 1
“More details can be found in [31] [32].”
BackgroundDiscrete Consensus Achievement in Artificial Systems
Valentini, G. (2017) · Studies in computational intelligence · doi:10.1007/978-3-319-53609-5_2 · Cited by 2
Graph factorization methods in linear formation control
Yang, E., & Wu, Q. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028763 · Cited by 1
“1 Single-Integrator Agent Model The model for single integrator agents is specified as 1, 2, , i i x t u t i n (1)”
BackgroundFully distributed consensus algorithms for double integrators under heterogeneous topologies
Liang, J., & Mei, J. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028748 · Cited by 1
“, [1], [2], [3], [4].”
Retaining Connectivity In Mobile Communication Mesh Networks
Pisano, A., Franceschelli, M., Pilloni, A., et al. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.143 · Cited by 1
A note on monostability and bistability of boolean networks based on structure graphs
Chen, S., Wu, Y., & Wang, L. (2017) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2017.8105668 · Cited by 1
“A structure graph is called connected if for every pair of nodes there is a path between them [13].”
BackgroundAlgebraic-graphical approach for signed dynamical networks
Shi, G., Altafini, C., & Baras, J. S. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263943 · Cited by 1
“The Laplacian of the positive graph G is defined as [20]”
BackgroundThe bearing-based multi-agent rendezvous problem on a circle
Trinh, M. H., & Ahn, H. (2017) · International Automatic Control Conference · doi:10.1109/cacs.2017.8284233 · Cited by 1
“The complete graph of n vertices, denoted by Kn, has the vertex set V and the edge set E = {(i, j)| 1 ≤ i, j ≤ n, i = j} [20].”
BackgroundCao, H., Wu, Y., & Wang, Z. (2018) · Cluster Computing · doi:10.1007/s10586-018-2326-5 · Cited by 1
“Lemma 1 [18] For an undirected graph G, L 1⁄4 DWD , where W 2 R E j j E j j is a diagonal matrix whose diagonal items are positive aij.”
BackgroundDistributed output feedback stationary consensus of multi-vehicle systems in unknown environments
Rezaei, V., & Stefanovic, M. (2018) · Control Theory and Technology · doi:10.1007/s11768-018-8015-3 · Cited by 1
“The graph Laplacian matrix L ∈ R N × N is further defined by The following fact holds for any undirected graphs [28].”
BackgroundMaadani, M., Butcher, E. A., & Yucelen, T. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431606 · Cited by 1
Range-based relative localization using a fixed number of measurements
Zhang, L., & Yu, L. J. (2018) · Intelligent Service Robotics · doi:10.1007/s11370-018-0261-1 · Cited by 1
“The graph G [17] is defined as the pair G = (V , E) that describes the relationship of vertices V (G) = {v1, v2, .”
BackgroundMaximum Capability of Feedback Control for Network Systems
Li, B., & Shi, G. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8483298 · Cited by 1
“The notion of distributed control consists of three basis elements [7]: nodes only have a local knowledge of the network structure; nodes only receive and send information to a few neighbors; control and decision are computed by each node independently.”
BackgroundPerspectives on Network Systems and Mathematical Sociology
Bullo, F., & Friedkin, N. E. (2018) · Systems & control · doi:10.1007/978-3-030-04630-9_11 · Cited by 2
“…Santa Barbara, CA 93106-5070, USA e-mail: friedkin@ soc.ucsb.edu 1 tions are given in the recent books [Ren and Beard, 2008, Bullo et al., 2009, Mesbahi and Egerstedt, 2010, Bai et al., 2011, Cristiani et al., 2014, Francis and Maggiore, 2016, Arcak et al., 2016, Bullo, 2018] and recent…”
BackgroundRomero, G., Guerrero, J. A., Reyes, L., et al. (2018) · Proceedings of the Annual Conference of the IEEE Industrial Electronics Society · doi:10.1109/iecon.2018.8591297 · Cited by 1
“For a detailed overview on multi-agent consensus the reader is referred to [12], [13] and [14].”
BackgroundEvent-Triggered Control on Quasi-Average Consensus in the Cooperation-Competition Network
Hu, H., Chen, G., & Wen, G. (2018) · Proceedings of the Annual Conference of the IEEE Industrial Electronics Society · doi:10.1109/iecon.2018.8592897 · Cited by 1
“Please refer to [16], [17] for a more comprehensive overview of the field.”
BackgroundResultYuan, C., & Wu, F. (2019) · Elsevier eBooks · doi:10.1016/b978-0-12-814928-7.00005-6 · Cited by 1
Min–max time consensus tracking on a multi-quadrotor testbed
Joshi, A., Sawant, V., Chakraborty, D., et al. (2019) · Control Engineering Practice · doi:10.1016/j.conengprac.2019.104128 · Cited by 1
Active-Passive Dynamic Consensus Filters for Linear Time-Invariant Multiagent Systems
Peterson, J., Yucelen, T., & Jagannathan, S. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814349 · Cited by 1
“Next, we concisely overview some key notions from graph theory (see, for example, [18], [19] for details).”
BackgroundMultiplex Networks Centrality Measurements for Microgrids
Toro, V., Mojica‐Nava, E., & Rakoto–Ravalontsalama, N. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.08.149 · Cited by 4
Stoorvogel, A. A., Nojavanzadeh, D., Liu, Z., et al. (2019) · European Journal of Control · doi:10.1016/j.ejcon.2019.11.008 · Cited by 1
Consensus control of multi-agent systems with input delays: a descriptor model approach
Lyubchyk, L. M., & Dorofieiev, Y. (2019) · Mathematical Modeling and Computing · doi:10.23939/mmc2019.02.333 · Cited by 2
Distributed Energy Management of Grid Connected PV-Prosumers Using Consensus Protocol
Waqar, A., Awais, M., Li, Y., & Hu, J. (2019) · IEEE Sustainable Power and Energy Conference (iSPEC) · doi:10.1109/ispec48194.2019.8974874 · Cited by 1
“From [30], a discrete consensus algorithm can be defined as: ( ) ( ) ( ) ( ) 1 ,”
BackgroundDesign of Sustainable Resource Consumption Networks
Ruf, S. F., Hale, M., Manzoor, T., et al. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029324 · Cited by 1
“Understanding the interplay between network structure and dynamics that evolve over that structure has been studied extensively in the controls and network science literatures [17], [18], see for instance the work relating network structure to controllability properties [19], [20].”
BackgroundBuzorgnia, D., & Aghdam, A. G. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147933 · Cited by 1
“Graph theory has been used extensively in the literature to analyze various aspects of multi-agent networks, where each agent is considered as a node and interaction between any pair of agents is represented by an edge [8].”
BackgroundCooperative Pursuit Control Based on Networked Visual Motion Observer in Three Dimensions
Yamauchi, J., Harada, Y., Hatanaka, T., et al. (2020) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.56.386 · Cited by 1
Distributed Winner-Take-All Teleoperation of A Multi-Robot System
Yang, Y., Constantinescu, D., & Shi, Y. (2020) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra40945.2020.9197535 · Cited by 1
“Then, the incidence matrix D and the unweighted Laplacian matrix L of the decision-making network are de-fined the same as in [23, Chapter 2] Let ” ◦ ” be an operator that takes the product of two vectors component-wisely (their Haddamard product).”
MethodAdaptive Active-Passive Networked Multiagent Systems
Arabi, E., Panagou, D., & Yucelen, T. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483258 · Cited by 1
“Necessary notions from graph theory are next concisely overviewed (details in [13, 14]).”
BackgroundRezaei, V. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-0977 · Cited by 1
Rezaei, V., & Stefanovic, M. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-0648 · Cited by 1
Formation control using optimal time multiplexing
Oza, H., Banavar, R. N., Sukumar, S., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304506 · Cited by 1
“Multi-agent robotic systems find wide applications in areas such as autonomous vehicle fleet, surveillance, rescue operations etc [1] - [2].”
BackgroundPrivacy-Friendly Decentralized Data Aggregation For Mobile Crowdsensing
Wang, X., Ying, C., & Luo, Y. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322169 · Cited by 1
“Interested readers may refer to [11] for the feasible range of h and the theoretical support.”
BackgroundActuator fault detection and isolation for multi-agent systems by an observer approach
Bai, Y., & Wang, J. (2020) · Chinese Automation Congress · doi:10.1109/cac51589.2020.9327254 · Cited by 1
“Lemma 1: [18] In terms of an undirected graph, the Laplacian matrix L is positive semi-definite.”
BackgroundDiscrete Networked Dynamic Systems with Eigen-Spectrum Gap: Analysis and Performance
Mahmoud, M. S., & Karaki, B. J. (2021) · Fundamental Journal of Mathematics and Applications · doi:10.33401/fujma.815819 · Cited by 1
Sensitivity-based link addition for robust linear dynamical networks
Hamdipoor, V., Moon, J., & Kim, Y. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.02.034 · Cited by 1
Pursuing robust decisions in uncertain traffic equilibrium problems
Fabiani, F. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683786 · Cited by 2
“2) Graph theory ([20]): A directed graph (or digraph) is a pair G := (V, E), where V denotes the finite set of nodes (or vertices), while E ⊆ V × V the set of edges (or arcs), and (i, j) ∈ E if there exists an oriented edge from node i to j.”
BackgroundDistributed coordinated path following using guiding vector fields
Yao, W., de Marina, H. G., Sun, Z., et al. (2021) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.48550/arxiv.2103.12372 · Cited by 1
“Please see [35] for an introduction to graph theory.”
BackgroundSimple Utility Design for Welfare Games under Global Information
Wada, T., Makabe, A., & Fujisaki, Y. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.1244 · Cited by 1
“Many researches have been done, for example, consensus control, formation control, distributed Kalman filter, distributed optimization, and so on (Mesbahi and Egerstedt, 2010; Nedić et al., 2010).”
MethodMeasurement-Induced Boolean Dynamics from Open Quantum Networks
Qi, H., Mu, B., Petersen, I. R., et al. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.135 · Cited by 1
A Network Optimization Framework for Controller Synthesis
Sharf, M. (2021) · Springer theses · doi:10.1007/978-3-030-72991-2_4 · Cited by 1
Synthesizing Simultaneous Arrival from Single Agent Time Optimal Controllers
Tran, D. M., Casbeer, D. W., & Milutinović, D. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9482855 · Cited by 1
Observer-based event-triggered networked multi-drives speed consensus
Masroor, S., & Peng, C. (2021) · Digital Communications and Networks · doi:10.1016/j.dcan.2021.07.010 · Cited by 1
Leader-Follower Multimotor Speed Coordination via Adaptive Fuzzy Multiagent Consensus Scheme
Masroor, S., Peng, C., & Alkhammash, E. H. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/2932788 · Cited by 1
Robust Event-Triggered Consensus of Uncertain Network Systems
Zhang, S., & Li, Z. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549575 · Cited by 1
Distributed algorithm for nonuniform deployment of the agents on the segment
Semenov, A. (2021) · Scientific School Dynamics of Complex Networks and their Applications (DCNA) · doi:10.1109/dcna53427.2021.9586888 · Cited by 1
Toward the Theory of Using Information for Actions in Systems: Prospects for Research and Reviews
Geyda, A. (2021) · Conference of Open Innovations Association (FRUCT) · doi:10.23919/fruct53335.2021.9599969 · Cited by 2
Coordination for Antagonistic Impulsive Network Systems
Zhang, Y., & Liu, Y. (2021) · International Conference on Control, Automation and Information Sciences (ICCAIS) · doi:10.1109/iccais52680.2021.9624646 · Cited by 1
Event-Triggered Control for Weight-Unbalanced Directed Robot Networks
Pabon, J. D., Cardona, G. A., Ospina, N. I., et al. (2021) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros51168.2021.9636574 · Cited by 1
“According to [19, Theorem 2.12], if we choose the connections among the reference robot and other robots such that in the directed graph D formed by all robots, including the reference robot, this robot is chosen as the root of D .”
BackgroundInfluentialIdentification of closed-loop systems using binary measurement on the output
Oualla, H., Pouliquen, M., Frikel, M., et al. (2021) · International Conference on Systems and Control (ICSC) · doi:10.1109/icsc50472.2021.9666694 · Cited by 1
Rodríguez, F. R., & Rivera, S. R. (2022) · WSEAS TRANSACTIONS ON POWER SYSTEMS · doi:10.37394/232016.2022.17.3 · Cited by 1
Performance Measure of Hierarchical Structures for Multi-agent Systems
Raza, A., Iqbal, M., Moon, J., et al. (2022) · International Journal of Control Automation and Systems · doi:10.1007/s12555-020-0767-0 · Cited by 1
Structure-Preserving Model Reduction of Physical Network Systems
van der Schaft, A. J. (2022) · Springer eBooks · doi:10.1007/978-3-030-95157-3_16 · Cited by 1
Avoiding Ambiguous Framework in Distance-based Formation Control Using Virtual Followers
Bayati, R. (2022) · International Journal of Current Science Research and Review · doi:10.47191/ijcsrr/v5-i7-14 · Cited by 1
Guaranteed consensus performance in second-order networked multi-agent systems with induced delay
Nasir, M. A., Ahmed, Z., Hayat, M. F., et al. (2022) · Mehran University Research Journal of Engineering and Technology · doi:10.22581/muet1982.2203.09 · Cited by 1
Kurtoglu, D., Yucelen, T., & Yildirim, E. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.07.260 · Cited by 1
Multi-agent consensus over signed graphs with switching topology
Wang, L., Fontan, A., Hong, Y., et al. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9837983 · Cited by 1
Guralnik, D. P., Stiller, P. F., Zegers, F. M., et al. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867699 · Cited by 1
“where Lw : RV → RV is the weighted Laplace operator with non-negative symmetric weights satisfying wpq = 0 if pq / ∈ E and otherwise wpq = r(∥xp − xq∥); r is a positive real-valued function; and (Rd)V is identified with RV⊗Rd in the usual way [4], [7], [24] (second-order variants exist as well, e.”
BackgroundMorita, S., Okura, Y., & Kojima, C. (2022) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice56594.2022.9905786 · Cited by 1
“A multi-agent system [2-4] is a system where multiple control objects perform works while exchanging information through mutual communication.”
BackgroundLiu, Z., Saberi, A., & Stoorvogel, A. A. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9901674 · Cited by 1
“See for instance the books [1, 2, 11, 22, 26, 27, 38] and references therein.”
BackgroundLiu, Z., Saberi, A., & Stoorvogel, A. A. (2023) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc58219.2023.10326820 · Cited by 1
“The work can be seen, for example in the books [1], [2], [4], [14], [15], [16], [19] and references therein.”
BackgroundAfzalian, A. A., & Talatape, M. P. (2023) · Journal of Control · doi:10.61186/joc.17.2.129 · Cited by 1
Reaching Consensus in Quantum Networks with Continuous-time Markovian DynamicsPreprint
Shi, G., Dong, D., Petersen, I. R., et al. (2014) · arXiv (Cornell University) · Cited by 1
Sparse Stable MatricesPreprint
Belabbas, M.-A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.3478 · Cited by 1
“While the use of graphical methods in control is not new (see [Lin(1974),Mesbahi and Egerstedt(2010)] or the early monograph [Reinschke(1988)]), our approach departs from earlier work in the sense that it relates graph theoretic properties to systems’ stability.”
Efficient distributed information fusion using value of information based censoring
Mu, B., How, J. P., & Chowdhary, G. V. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Graphs for Modeling Networked Interactions
Mesbahi, M., & Egerstedt, M. (2020) · Springer eBooks · doi:10.1007/978-1-4471-5102-9_212-2 · Cited by 1
Self-citationMusical swarm robot simulation strategies
Albin, A. (2011) · SMARTech Repository (Georgia Institute of Technology) · Cited by 1
Synchronization and Noise: A Mechanism for Regularization in Neural SystemsPreprint
Bouvrie, J., & Slotine, J.-J. E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.1632 · Cited by 2
“D SDEs were coupled with diffusive coupling according to an all-to-all network topology with uniform strength κ, giving the system dXt = − γ σ2N [ U(Xt + ξt)−U(Xt) ] ξtdt+ LXt + σ 2dBt (35) where Xt = (X1t , . . . , X n t ) >,U(X) = (U(X1), . . . , U(Xn))>, ξt ∼ N (0, σ2NI),∀t, Bt is standard ndimensional Brownian mot…”
BackgroundInfluentialFormation Control with Size Scaling using Relative Position Feedback
Coogan, S. (2013) · UC Berkeley · Cited by 1
Feedback Capacity over NetworksPreprint
Li, B., & Shi, G. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03186 · Cited by 1
“Besides the tremendous success of in-network control design [28], it is equally important to understand the limitations of feedback mechanism over network dynamics facing uncertainty.”
BackgroundDistributed Resource Allocation Over a Class of Nonlinear Multi-agent Systems.Preprint
Tang, Y., & Yi, P. (2017) · arXiv (Cornell University) · Cited by 1
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.