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,601–1,700 of 2,960
Distributed fault detection of nonlinear large-scale dynamic systems
Noursadeghi, E., & Raptis, I. A. (2015) · ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS) · doi:10.1145/2735960.2735981 · Cited by 4
“So, taking the natural logarithm of (22) yields to: The above sum is calculated in a distributed way by means of a distributed average consensus algorithm [43, 44, 30, 25].”
MethodEdge-Event Based Consensus in Networks with Common Time-Varying Delays
Xiao, F., Chen, T., & Gao, H. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.01759 · Cited by 4
“Note that the definition of M I M IT is independent of the choice of M I , and matrices M I M IT and L E share the same non-zero eigenvalues (Mesbahi and Egerstedt, 2010).”
BackgroundNetwork Topology Design for UAV Swarming with Wind Gusts
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_5 · Cited by 4
“We quote the following well-known Lemma [5] which can be used to determine the connectivity of the graph.”
MethodZhang, K., & Demetriou, M. A. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760754 · Cited by 4
“Following [24], the weighted Laplacian matrix has one zero eigenvalue and the others have positive real parts.”
BackgroundInfluentialAn Averaging Method for Synchronization in Kuramoto Models
Okaniwa, M., & Ishii, H. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00071 · Cited by 4
Optimality of consensus protocols for multi-agent systems with interaction
Katsuura, H., & Fujisaki, Y. (2014) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/isic.2014.6967600 · Cited by 4
“Since multi-agent systems are driven thorough networks, the investigation of their graph topology is regarded as a focal point of researches on multi-agent networks [6], even though protocol design can be done by using a standard method such as LMI approach [7].”
MethodThermodynamics-based network systems control by thermal analogy
Berg, J. M., Maithripala, D. H. S., Hui, Q., et al. (2012) · doi:10.1109/cdc.2012.6426012 · Cited by 4
Identifiability of links and nodes in multi-agent systems under the agreement protocol
Rahimian, M. A., Ajorlou, A., Tutunov, R., & Aghdam, A. G. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580915 · Cited by 3
“Multi-agent network systems consist of a group of dynamic agents, which interact according to a given information flow structure [1].”
BackgroundNeural-network-based cooperative adaptive identification of nonlinear systems
Chen, W., Hua, S., Ren, W., & Hu, W. (2012) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2012.6485135 · Cited by 4
“Lemma 1 [21]: Let L be the symmetric Laplacian matrix associated with the undirected graph G of order p.”
BackgroundSparse distributed observers for a network of dynamical systems
Edwards, C., & Menon, P. P. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760655 · Cited by 4
Efficient distributed sensing using adaptive censoring based inference
Mu, B., Chowdhary, G. V., & How, J. P. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580477 · Cited by 5
Hierarchical nearly cyclic pursuit for consensus in large‐scale multi‐agent systems
Iqbal, M., Leth, J., & Ngo, T. D. (2016) · IET Control Theory and Applications · doi:10.1049/iet-cta.2016.0315 · Cited by 4
A Survey of Recent Progress in the Study of Distributed High-Order Linear Multi-Agent Coordination
Huang, J., Fang, H., Chen, J., Dou, L., & Zeng, J. (2014) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2014.p0083 · Cited by 4
Delay Robustness of Nonlinear Consensus Protocols: Analytic Criteria
Proskurnikov, A. V. (2016) · Advances in delays and dynamics · doi:10.1007/978-3-319-26369-4_7 · Cited by 3
Morisi, R., Gnecco, G., & Bemporad, A. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2016.08.018 · Cited by 4
“Control problems on such systems are strongly influenced by structural properties of their graph of interconnections, described, e.g., in terms of a weighted/unweighted adjacency or graph-Laplacian matrix (Mesbahi and Egerstedt, 2010; Liu et al., 2011).”
BackgroundA Fault Tolerant Protocol for Clock Synchronization in Sensor Networks
Kikuya, Y., & Ishii, H. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.10.393 · Cited by 4
Hoffmann, C., & Werner, H. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2645178 · Cited by 4
“An important subclass of Interconnected Systems (ISs) are MultiAgent Systems (MASs) [8], where directed communication topologies subject to connectivity failures are of special interest.”
BackgroundCooperative control for load transportation using two PVTOL vehicles with a passivity approach
Escobar, J. C., Bonilla, M., & Lozano, R. (2017) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas.2017.7991470 · Cited by 4
“One of the main approaches to the stability analysis of these cooperative systems is modeling the communication between each agent as a directed graph, as seen in [1] [2], [3] and [4].”
BackgroundAn Accurate Clock Synchronization Method among Moving Objects Based on Maximum Likelihood Estimation
Hara, S., Danjo, A., & Matsui, K. (2018) · doi:10.1109/ict.2018.8464907 · Cited by 4
“(27) This principle is referred to as consensus algorithm, where it is proven that the clocks of all objects can converge to a common value only when all objects are connected [9].”
BackgroundResidual Generation Synthesis for Sensor Fault Diagnosis in Multi-Agent Systems
Martínez-Villegas, C. T., Torres, L., & Theilliol, D. (2018) · UKACC International Conference on Control · doi:10.1109/control.2018.8516890 · Cited by 4
“For more more information about graph theory and its applications in multi-agent systems see [16].”
BackgroundGeneralising Laplacian controllability of paths
Hsu, S., & Yang, P. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.6214 · Cited by 4
“The Laplacian controllability problem of linear systems has been an active research topic in the past decade due to its important application in multiagent networks [11].”
BackgroundCoupled 6-DOF Control for Distributed Aerospace Systems
Reynolds, T. P., & Mesbahi, M. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619618 · Cited by 4
“If we consider solely the agent’s position as the state, then the consensus dynamics (see [1] Ch.”
BackgroundInfluentialSelf-citationA Discontinuous Consensus Algorithm with Neighbor Counting
Sen, A., Sahoo, S. R., & Kothari, M. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796096 · Cited by 4
“Details of graph theory can be found in [24].”
BackgroundDecentralized synchronization of time-varying oscillators under time-varying bidirectional graphs
Maghenem, M. A., Lekefouet, H., Lorı́a, A., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815146 · Cited by 4
“That is, the overall interconnectivity of the network is characterized by a graph [9].”
BackgroundLiu, Z., Saberi, A., Stoorvogel, A. A., et al. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8832399 · Cited by 4
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1, 7, 9, 11, 13, 17, 24] and references therein).”
BackgroundMeasurement-Induced Boolean Dynamics for Open Quantum Networks
Qi, H., Mu, B., Petersen, I. R., & Shi, G. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3188480 · Cited by 5
“The (weighted) Laplacian of G, denoted L(G), is defined as [29]”
BackgroundDecentralized Multiple V-Formation Control in Undirected Time-Varying Network Topologies
Choi, J., Song, Y., Lim, S., et al. (2019) · Workshop on Research, Education and Development of Unmanned Aerial Systems (RED-UAS) · doi:10.1109/reduas47371.2019.8999720 · Cited by 4
“This is because span{1n} is the null space of the connected graph Laplacian L [15].”
BackgroundMahulea, C., González, R., Montijano, E., et al. (2020) · Revista Iberoamericana de Automática e Informática Industrial RIAI · doi:10.4995/riai.2020.13785 · Cited by 4
“Para llevar a cabo esta tarea, se explotan las propiedades que tienen los algoritmos de consenso distribuidos en el ámbito de la percepción (Mesbahi and Egerstedt, 2010; Montijano and Sagüés, 2015).”
BackgroundMulti-agent systems for quadcopters
Carney, R., Chyba, M., Gray, C., et al. (2021) · The Journal of Geometric Mechanics · doi:10.3934/jgm.2021005 · Cited by 4
“The relative simplicity of these methods makes them an attractive choice in terms of both scalability and the desire for real-time control ([25, 27]).”
BackgroundAutonomous Vehicle Convoy Formation Control with Size/Shape Switching for Automated Highways
Jond, H. B., Platoša, J., & Sadreddini, Z. (2020) · International Journal of Engineering · doi:10.5829/ije.2020.33.11b.07 · Cited by 4
“An illustrative example is given in [15], where a group of agents is to traverse a narrow passage while maintaining a desired triangular shape.”
BackgroundSocial Shaping of Competitive Equilibriums for Resilient Multi-Agent Systems
Chen, Y., Islam, R., Ratnam, E. L., et al. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683243 · Cited by 4
“Next generation technologies are leveraging the internet of things (IoT) to support critical infrastructure systems including energy distribution and automotive transportation, and are being organized as interconnected multi-agent systems [6].”
BackgroundMethodHow zealots affect the energy cost for controlling complex social networks
Chen, H., & Yong, E. H. (2022) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0085222 · Cited by 4
An agent based observer model of the networked DC drives for speed coordination
Masroor, S., & Peng, C. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2021.126633 · Cited by 4
On the Robust Network Design for MUM-T
Hamdipoor, V., & Kim, Y. (2021) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3129720 · Cited by 4
Social Shaping of Linear Quadratic Multi-Agent Systems
Salehi, Z., Chen, Y., Ratnam, E. L., et al. (2021) · Australian & New Zealand Control Conference (ANZCC) · doi:10.1109/anzcc53563.2021.9628389 · Cited by 4
“Agents in distributed and networked multi-agent systems have their own decisions, preferences, and objectives, and operate in concert with each other in order to achieve systemlevel objectives [1]–[6].”
BackgroundInfluentialDritsas, L. D., & Tzes, A. P. (2021) · European Control Conference (ECC) · doi:10.23919/ecc54610.2021.9655063 · Cited by 4
HDP Algorithms for Trajectory Tracking and Formation Control of Multi-Agent Systems
Ferreira, E. F. M., Neto, J. V. D. F., & Šelmić, R. R. (2022) · IEEE Access · doi:10.1109/access.2022.3156092 · Cited by 5
“The scientific research and practical implementations of MAS are focused on development of standards, principles, and models that allow the creation of groups of autonomous or semi-autonomous agents, capable of interacting properly to accomplish common objectives [6].”
Block sparse design of distributed controllers for dynamical network systems
Adachi, R., Yamashita, Y., & Kobayashi, K. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6092 · Cited by 4
Mallick, P., Bhowmick, S., & Panja, S. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.04.113 · Cited by 4
“Network-based epidemic models are provided in Mesbahi and Egerstedt (2010).”
MethodShirsat, A., Mishra, S., Zhang, W., & Berman, S. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2022.3171905 · Cited by 6
Wang, X., Chu, X., Meng, Y., Wen, G., & Jiang, Q. (2022) · Nonlinear Dynamics · doi:10.1007/s11071-022-07638-6 · Cited by 4
“[ 36].”
Fedele, G., D’Alfonso, L., & Franzè, G. (2022) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.10.023 · Cited by 4
Unifying Control Architecture for Reactive Particle Swarms
Hart, S. T., & Kitts, C. (2022) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2022.3211155 · Cited by 4
“Mesbahi and Egersted’s method has been used for formation control, rendezvous problems, the containment problem [16], and maintaining connections with different barrier functions [20].”
BackgroundMethodResultInfluentialConsensus-based Normalizing-Flow Control: A Case Study in Learning Dual-Arm Coordination
Yin, H., Verginis, C. K., & Kragić, D. (2022) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros47612.2022.9981827 · Cited by 5
“If the multirobot graph is connected, then x converges to the kernel of L , which is span { 1 } , implying that lim t → ∞ ( x i ( t ) − x j ( t )) = 0, for i , j ∈ N , i ̸ = j [13].”
BackgroundInfluentialPredefined Time Synchronization of Multi-Agent Systems: A Passivity Based Analysis
Pandey, V. K., Taslima, E., Singh, B., et al. (2023) · Sensors · doi:10.3390/s23083865 · Cited by 4
Kashyap, A., Plis, S., Schirner, M., Ritter, P., & Keilholz, S. D. (2023) · Frontiers in Neuroscience · doi:10.3389/fnins.2023.1159914 · Cited by 5
“, 2012; Kashyap and Keilholz, 2019), where closer toward zero it simplifies to the well-known consensus problem where the timeseries converge to the attractor at the origin (Mesbahi and Egerstedt, 2010), and at higher degrees of noise the system becomes completely chaotic and non-deterministic.”
BackgroundGradient-Based Distributed Controller Design Over Directed Networks
Watanabe, Y., Sakurama, K., & Ahn, H. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3371599 · Cited by 4
Consensus in the network with uniform constant communication delay
Wang, X., Saberi, A., Stoorvogel, A. A., et al. (2012) · doi:10.1109/cdc.2012.6426845 · Cited by 4
Zhang, M., Stoorvogel, A. A., & Saberi, A. (2015) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-21003-2_6 · Cited by 4
A fault detection and isolation scheme for formation control of fixed-wing UAVs
Sequeira, P. M., & Aguiar, A. P. (2017) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas.2017.7991454 · Cited by 4
“In (3), the vector vi ∈ R(2), which is given by vi = Rṗi, is the velocity vector of UAV i expressed in the global coordinate frame, and ξi ∈ R(2) denotes a constant term that specifies a translational invariant formation [6].”
BackgroundLanguage Semantics Driven Design and Formal Analysis for Distributed Cyber-Physical Systems
Ghosh, R., Misailovíc, S., & Mitra, S. (2018) · doi:10.1145/3231104.3231958 · Cited by 4
“This type of synchronous update rule of Line 19 is a typical example of a large family of textbook algorithms for distributed consensus, rendezvous, optimization, flocking, and pattern formation [2, 11, 17].”
BackgroundResilient Information-Exchange Protocol for Distributed Model Predictive Control Schemes
Ananduta, W., Barreiro‐Gomez, J., Ocampo‐Martínez, C., et al. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430923 · Cited by 4
“Remark 1: The convergence rate of the consensus is characterized by the second smallest eigenvalue of L, denoted by λ2(L), which is positive for a connected graph [11].”
BackgroundInfluentialPatrolling and collision avoidance beyond classical Navigation Functions
Possieri, C., & Sassano, M. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550515 · Cited by 4
“It appears evident that the task hinted at above can be approached from several different perspectives, which are in general encompassed by the theory concerning the so-called multi-agent models [1], [2], [3], which include for instance the problems of collaborative, cooperative and formation control, [4], [5], [6], […”
BackgroundSelf-Assembly of a Class of Infinitesimally Shape-Similar Frameworks
Buckley, I., & Egerstedt, M. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594381 · Cited by 4
Self-citationStochastic Bregman Parallel Direction Method of Multipliers for Distributed Optimization
Yu, Y., & Acikmese, B. A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029539 · Cited by 5
“In addition to classical applications such as formation control [1], distributed tracking [2] and estimation [3], [4], problem (1) also arises in collaborative learning scenarios [5], [6], where problem (1) represents distributed learning from data collected by multiple agents.”
BackgroundDetermining driver nodes in dynamic signed biological networks
Tahmassebi, A., Mohebali, B., Meyer-Baese, L., Solimine, P. C., Pinker, K., & Meyer‐Baese, A. (2019) · Smart Biomedical and Physiological Sensor Technology · doi:10.1117/12.2519550 · Cited by 4
“The complexity of the actual networks poses many limitations to traditional analysis tools: 25 (1) most graph networks are directed, (2) the size of the network does not allow testing of several combinations to determine driver nodes, and (3) the weights between nodes are not equal and…”
BackgroundInfluenced Consensus for Multi-Scale Networks
Foight, D. R., & Mesbahi, M. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815252 · Cited by 4
“From [22, Observation 7.1.6], for PSD matrix L, QTLQ is also PSD; now let Q = E−1/2.”
BackgroundMethodInfluentialSelf-citationEnforcing Spatiotemporal Constraints in Control of Multiagent Systems with Uncertainties
Arabi, E., & Yucelen, T. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815116 · Cited by 4
“Next, we overview several notions from graph theory (see [18, 19] for more details).”
BackgroundClustering-Based Model Order Reduction for Nonlinear Network Systems
Benner, P., Grundel, S., & Mlinarić, P. (2021) · International series of numerical mathematics · doi:10.1007/978-3-030-72983-7_4 · Cited by 4
“1 Graph theory The notation in this section is based on [19] and [7].”
BackgroundControllability over Graphs for Bilinear Systems over Lie Groups
Wang, X., Li, B., Li, J.-S., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304294 · Cited by 4
“In the past decade, a new thriving line of research in control systems has involved the control of multi-agent or networked systems, where subsystems are interconnected according to a graph representing the system interaction structure [19], [20].”
BackgroundConvergence Rates of Distributed Consensus over Cluster Networks: A Two-Time-Scale Approach
Dutta, A., Boker, A., & Doan, T. T. (2022) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc51059.2022.9992395 · Cited by 4
“It is known that for (undirected) connected networks, all the nodes will reach consensus regardless of the network topology [13].”
BackgroundWell-Posedness, Internal Stability and Input-Output Stability in Networked Multi-Agent Systems
Datta, S. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3122544 · Cited by 4
Fault Tolerant Consensus of Multi Agent Systems Under Actuator Faults
Ramachandran, K., & Juang, J. (2022) · IEEE Access · doi:10.1109/access.2022.3142320 · Cited by 4
Katz, R., Fridman, E., & Basre, I. (2022) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc51059.2022.9992575 · Cited by 4
Cartesian Products of Z-matrix Networks: Factorization and Interval Analysis
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_6 · Cited by 4
“In parallel, Z-matrices are used to model synchronization in networks [10], population migration [6], Markov processes, and supply and demand in economic systems [1].”
MethodZeng, Z., Wang, X., & Zheng, Z. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260777 · Cited by 4
“1 Step 1 – The xT -subsystem For the kinematics system (18), we take the well-known continuous-time consensus algorithm described in [20]”
MethodBhattacharya, S., Gupta, A., & Başar, T. (2011) · IFAC Proceedings Volumes · doi:10.3182/20110828-6-it-1002.02186 · Cited by 4
“Since the agents as well as the jammer are mobile, I is a function of t and therefore, a dynamic graph [19], [6].”
BackgroundCycles and sparse design of consensus networks
Zelazo, D., Schuler, S., & Allgöwer, F. (2012) · doi:10.1109/cdc.2012.6426450 · Cited by 4
“The dynamics of each agent comprising these systems and the interaction structure that couples them leads to a highly complex network that requires new perspectives and tools for their analysis [1].”
BackgroundCyclic Constraint Analysis for Attitude Synchronization of Networked Spacecraft Agents
Wang, H., & Xie, Y. (2013) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4024802 · Cited by 4
Multi-agent consensus under communication-broadcast mixed environment
Azuma, S., Tanaka, Y., & Sugie, T. (2012) · doi:10.1109/cdc.2012.6426830 · Cited by 4
Distributed network localization using angle-of-arrival information Part I: Continuous-time protocol
Zhu, G., & Hu, J. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6579968 · Cited by 4
Self-Reconfiguration Using Graph Grammars for Modular Robotics
Pickem, D., & Egerstedt, M. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120606-3-nl-3011.00034 · Cited by 4
Self-citationGraph-Theoretic Methods for Networked Dynamic Systems: Heterogeneity and H 2 Performance
Zelazo, D., & Mesbahi, M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5757-3_9 · Cited by 4
Self-citationControllability of deterministic complex networks
Li, X., Lu, Z., & Li, H. (2014) · International Journal of Modern Physics C · doi:10.1142/s012918311550028x · Cited by 4
Path following with disturbance rejection for inhomogeneous formations with underactuated agents
Belleter, D. J. W., & Pettersen, K. Y. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330675 · Cited by 4
“In this work the communication is described by algebraic graph theory (for more information see [20]).”
Backgroundoptimal decentralised static output feedback stabilisation of a network of dynamical systems
Menon, P. P., Edwards, C., & Postlethwaite, I. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2013.11.008 · Cited by 4
Formation of Connected Network for Fractionated Spacecraft
Dai, R., Maximoff, J., & Mesbahi, M. (2012) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2012-5047 · Cited by 4
Self-citationBroadcast Control with Constant-distance Random Movement
Tanaka, Y., Azuma, S., & Sugie, T. (2014) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.50.139 · Cited by 4
Analyzing human-swarm interactions using control Lyapunov functions and optimal control
de la Croix, J.-P., & Egerstedt, M. (2015) · Networks and Heterogeneous Media · doi:10.3934/nhm.2015.10.609 · Cited by 4
Self-citationGao, L., Zhao, G., Li, G., et al. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.11.111 · Cited by 4
Input-output stability of linear consensus processes
Liu, J., Başar, T., & Nedić, A. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799344 · Cited by 4
“Over the past few decades, there has been much attention paid to developing algorithms for information distribution and computation among a group of interactive agents via local interactions [1]–[3].”
BackgroundNonlinear optimization for multi-agent motion planning in a multi-obstacle environment
Tran, N. Q. H., Prodan, I., & Lefèvre, L. (2017) · International Conference on System Theory, Control and Computing (ICSTCC) · doi:10.1109/icstcc.2017.8107082 · Cited by 4
“The design and use of multi-agent frameworks have been the object of significant research focus in recent years [1].”
BackgroundA dynamical systems approach to distributed eigenvector computation
Leonardos, S., Preciado, V. M., & Daniilidis, K. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263972 · Cited by 4
“For an in depth analysis, we refer the reader to [21], [22].”
BackgroundControl of Multiagent Systems with Local and Global Objectives
Sarsılmaz, S. B., & Yucelen, T. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619693 · Cited by 4
Dynamic event-triggered control for networked Euler-Lagrange systems
Wei, B., Xiao, F., & Shi, Y. (2019) · IEEE International Symposium on Industrial Electronics (ISIE) · doi:10.1109/isie.2019.8781362 · Cited by 6
“Owing to the needs in real-world applications, coordination control is becoming increasingly relevant and consequently has attracted much attention in the last decade [1], [2].”
BackgroundDistributed Strategies for Dynamic Coverage with Limited Sensing Capabilities
Fabris, M., & Cenedese, A. (2019) · Mediterranean Conference on Control and Automation (MED) · doi:10.1109/med.2019.8798554 · Cited by 4
“In the recent decades, researchers have focused their attention in multi-agent networks [1] composed by a large number of smart devices that can collaborate to achieve a common goal and are capable of taking local decisions independently, without any supervisory framework.”
BackgroundInput-Output Properties of the Power Grid’s Swing Dynamics: Dependence on Network Parameters
Koorehdavoudi, K., Roy, S., Prévost, T., et al. (2019) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2019.8920431 · Cited by 4
“ically with the classical swing-dynamics model, it is part of a broader effort to characterize input-output properties of canonical dynamical-network models [12]– [16].”
BackgroundInformation Flow in Formation Control for Nonholonomic Agents Modeled as LPV Systems
Attallah, A., & Werner, H. (2020) · European Control Conference (ECC) · doi:10.23919/ecc51009.2020.9143664 · Cited by 4
“The approach presented in this paper is based on concepts of system decomposition [7], graph theory [13] and tools for discrete-time LPV controller design [12], [14]–[16].”
BackgroundMethodRobustness Analysis for Multi-Agent Consensus Systems with Application to DC Motor Synchronization
Olivares, D., Romero, G., Guerrero, J. A., et al. (2020) · Applied Sciences · doi:10.3390/app10186521 · Cited by 4
“This leads us to the fact that a graph G has a spanning tree if and only if G is connected [27].”
BackgroundMultiplex Centrality Measurements Applied to Islanded Microgrids
Toro, V., Mojica‐Nava, E., & Rakoto–Ravalontsalama, N. (2020) · International Journal of Control Automation and Systems · doi:10.1007/s12555-019-0801-2 · Cited by 5
Initial-Value Privacy of Linear Dynamical Systems
Wang, L., Manchester, I. R., Trumpf, J., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9303900 · Cited by 4
“, [24].”
Spectral Properties of the Normalized Rigidity Matrix for Triangular Formations
Aryankia, K., & Šelmić, R. R. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3089136 · Cited by 4
Laplacian Controllability of Oriented Threshold Graphs
Mousavi, S. S., & Kouvelas, A. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9482624 · Cited by 4
Network Topology Design for UAV Swarming with Wind Gusts
Chapman, A., Dai, R., & Mesbahi, M. (2011) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2011-6477 · Cited by 4
Self-citationBavafa-Toosi, Y. (2017) · Elsevier eBooks · doi:10.1016/b978-0-12-812748-3.00001-x · Cited by 4
Multi-Layered Formation Control of Autonomous Marine Vehicles with Nonlinear Dynamics
Vaddipalli, R. K. N., Šelmić, R. R., & Rathore, A. K. (2018) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon.2018.8591617 · Cited by 4
“It is said to be minimally rigid if the graph is rigid and removal of any edge makes it flexible [15], [16].”
BackgroundConsensus and Pursuit-Evasion in Nonlinear Multi-Agent Systems
Thunberg, J. (2014) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 3
Detection and Isolation of Failures in Linear Multi-Agent NetworksPreprint
Rahimian, M. A., & Preciado, V. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.5540 · Cited by 4
“sults are explained through elaborative examples and computer experiments. I. INTRODUCTION Multi-agent network systems have found promising applications in areas such as motion coordination of robots [1]. Cooperative dynamics over a network can be strongly affected by the network failures. Hence, studying the effects…”
BackgroundShi, G., Fu, S., & Petersen, I. R. (2014) · arXiv (Cornell University) · Cited by 4
Biologically inspired heterogeneous multi-agent systems
Egerstedt, M., & Haque, M. A. (2010) · SMARTech Repository (Georgia Institute of Technology) · Cited by 4
Self-citation
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.