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 301–400 of 2,960
Multi-Agent System Dynamics: Bifurcation and Behavior of Animal Groups
Leonard, N. E. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130904-3-fr-2041.00211 · Cited by 48
Containment control for a social network with state-dependent connectivity
Kan, Z., Klotz, J. R., Pasiliao, E. L., et al. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.026 · Cited by 45
“P [26] and [27]) is widely used to represent a networked system.”
Graph-theoretic approach for connectivity maintenance in mobile networks in the presence of a jammer
Bhattacharya, S., & Başar, T. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717917 · Cited by 48
“From [18] [19], the state dependent graph is defined as follows:”
BackgroundMachine-to-Machine Communications for Healthcare
Chen, K. (2012) · Journal of Computing Science and Engineering · doi:10.5626/jcse.2012.6.2.119 · Cited by 47
“Therefore, a rigid trajectory represents a rigid motion of the network, starting from the formation during which the distances of all machines are maintained [25].”
BackgroundDistributed Formation Stabilization Using Relative Position Measurements in Local Coordinates
Aranda, M., Nicolás, G. L., Sagüés, C., & Zavlanos, M. M. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2527719 · Cited by 47
“We address, in particular, the problem of distributed formation stabilization [1].”
BackgroundClustering-Based Model Reduction of Networked Passive Systems
Besselink, B., Sandberg, H., & Johansson, K. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2505418 · Cited by 45
“The following result can be found in [22], [30].”
BackgroundA Speeding-Up and Slowing-Down Strategy for Distributed Source Seeking With Robustness Analysis
Wu, W., & Zhang, F. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2459414 · Cited by 46
“, N , which indicates that qi converges to q described by α [28]–[30].”
BackgroundVamvoudakis, K. G., & Hespanha, J. P. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2734840 · Cited by 46
“Related work There is an extensive research on multi-agent coordination from several scientific societies including control systems society [20] and artificial intelligence society [36].”
BackgroundOn the timed temporal logic planning of coupled multi-agent systems
Nikou, A., Boskos, D., Tůmová, J., & Dimarogonas, D. V. (2018) · Automatica · doi:10.1016/j.automatica.2018.08.023 · Cited by 44
Reset control for synchronization of multi-agent systems
Meng, X., Xie, L., & Soh, Y. C. (2019) · Automatica · doi:10.1016/j.automatica.2019.02.042 · Cited by 45
Modeling of physical network systems
van der Schaft, A. J. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.08.013 · Cited by 44
“This conserved quantity is nontrivial if there exists at least one spanning tree, which is [11] the necessary and sufficient condition for convergence of the dynamics (22) to consensus, that is, to a vector c1, where c is the consensus value corresponding to the initial condition x(0).”
Cluster consensus on matrix-weighted switching networks
Pan, L., Shao, H., Mesbahi, M., Li, D., & Xi, Y. (2022) · Automatica · doi:10.1016/j.automatica.2022.110308 · Cited by 56
“Achieving consensus via local interactions amongst agents turns out to be an important paradigm in distributed control of multi-agent networks Mesbahi and Egerstedt [13], Olfati-Saber et al.”
BackgroundSelf-citationAutonomy and machine intelligence in complex systems: A tutorial
Vamvoudakis, K. G., Antsaklis, P. J., Dixon, W. E., Hespanha, J. P., Lewis, F. L., Modares, H., & Kiumarsi, B. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7172127 · Cited by 51
“There is an extensive research on complex systems coordination from several scientific societies including control systems society [55] and computational intelligence society [91].”
BackgroundFormation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs
Yazıcıoğlu, Y., Egerstedt, M., & Shamma, J. S. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2503983 · Cited by 46
“Therefore, graph theoretic analysis of networked systems has received a considerable amount of attention during the last decade (e.g., [6], [7]).”
Self-citationBroadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs
Wu, S., & Rabbat, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2264056 · Cited by 46
“G OSSIP algorithms are an attractive solution for information processing in applications such as distributed signal processing [1], networked control [2], and multi-robot systems [3].”
BackgroundResilient consensus protocol in the presence of trusted nodes
Abbas, W., Vorobeychik, Y., & Koutsoukos, X. (2014) · International Symposium on Resilient Control Systems (ISRCS) · doi:10.1109/isrcs.2014.6900100 · Cited by 44
“One of the integral problems in distributed networks and controls is distributed consensus, which finds a wide variety of applications in the domain of distributed optimization, clock synchronization, social networks, coverage, and formation control to name a few (see e.g., [1], [2]).”
BackgroundTrends in Control and Decision-Making for Human–Robot Collaboration Systems
Wang, Y., & Zhang, F. (2017) · Springer eBooks · doi:10.1007/978-3-319-40533-9 · Cited by 44
Edge event-triggered control for multi-agent systems under directed communication topologies
Wei, B., Xiao, F., & Dai, M. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1295320 · Cited by 44
“Through a shared communication network, a number of agents can operate as a group and perform challenging tasks with many superiorities, such as greater efficiency, higher robustness and flexibility (Fax & Murray, 2004; Mesbahi & Egerstedt, 2010).”
BackgroundResilient Leader-Follower Consensus to Arbitrary Reference Values
Usevitch, J., & Panagou, D. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431573 · Cited by 43
“with a reference state which may or may not lie within the convex hull of initial state values (see [5]–[7] and references).”
Connectivity-Maintenance Teleoperation of a UAV Fleet With Wearable Haptic Feedback
Aggravi, M., Pacchierotti, C., & Giordano, P. R. (2020) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2020.3000060 · Cited by 46
“…and landing capabilities (such as quadrotors) produce strong turbulence that can destabilize other flying robots passing below. second-smallest eigenvalue of L , denoted as λ 2 , is a metric for determining the connectivity of a graph, since λ 2 > 0 for a connected graph and λ 2 = 0 otherwise [35].”
Aryankia, K., & Šelmić, R. R. (2021) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3111719 · Cited by 45
Robust Graph Topologies for Networked Systems
Abbas, W., & Egerstedt, M. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00052 · Cited by 43
“In fact, connectivity of the underlying graph structure is a necessary requirement for theconsensus protocol to work (see Mesbahi and Egerstedt (2010) as example).”
BackgroundInfluentialSelf-citationA Formal Methods Approach to Pattern Recognition and Synthesis in Reaction Diffusion Networks
Bartocci, E., Göl, E. A., Haghighi, I., & Belta, C. A. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2609138 · Cited by 41
Consensus on spheres: Convergence analysis and perturbation theory
Lageman, C., & Sun, Z. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798240 · Cited by 43
“Since Γ is undirected and connected, L is symmetric, positive-semidefinite with rank n− 1 [2].”
BackgroundPoveda, J. I., & Teel, A. R. (2018) · Automatica · doi:10.1016/j.automatica.2018.10.010 · Cited by 40
Bhowmick, S., & Panja, S. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2913908 · Cited by 43
“Most of the existing pertinent literature on consensus of MAS consider cooperative or collaborative control over regular unsigned graphs [5] where the agents cooperate or col-”
BackgroundWireless Sensor Network Deployment of 3D Surface Based on Enhanced Grey Wolf Optimizer
Wang, Z., & Xie, H. (2020) · IEEE Access · doi:10.1109/access.2020.2982441 · Cited by 42
“Finally, the connectivity of the entire network is judged according to the matrix power algorithm in [52].”
MethodFully Distributed Control of Multiagent Networks With Edge-Based Event-Triggered Communication
Guo, S., & Meng, X. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3223973 · Cited by 46
“The reason for causing this difference is that (i, j) and (j, i) are considered as one element in E in [26], while they are regarded as two edges with opposite orientations here.”
BackgroundRaveh, A., Zarai, Y., Michael Margaliot, A., & Tuller, T. (2015) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2418782 · Cited by 41
“Remark 1 It is possible also to give a simple and selfcontained proof of Corollary 1 using standard tools from the literature on consensus networks [30].”
BackgroundMethodCzyzowicz, J., Georgiou, K., & Kranakis, E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-11072-7_14 · Cited by 42
Chowdhury, D., & Khalil, H. K. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2981084 · Cited by 42
“The survey papers [5], [6], and the books [7], [8] provide an exhaustive material of the consensus problems in multiagent systems.”
BackgroundMulti-agent system dynamics: Bifurcation and behavior of animal groups
Leonard, N. E. (2014) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2014.09.002 · Cited by 49
Xue, X., Yue, X., & Yuan, J. (2020) · Advances in Space Research · doi:10.1016/j.asr.2020.05.036 · Cited by 41
Optimal k-leader selection for coherence and convergence rate in one-dimensional networks
Patterson, S., McGlohon, N., & Dyagilev, K. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2520201 · Cited by 39
“Since G is connected, Lff is positive definite [26].”
BackgroundDecentralized Supervisory Control of Networks of Nonlinear Control Systems
Pola, G., Pepe, P., & Benedetto, M. D. D. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2775962 · Cited by 39
Ebel, H., & Eberhard, P. (2020) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2020.103686 · Cited by 44
Human-swarm interactions based on managing attractors
Brown, D. S., Kerman, S. C., & Goodrich, M. A. (2014) · ACM/IEEE International Conference on Human-Robot Interaction (HRI) · doi:10.1145/2559636.2559661 · Cited by 49
“When the underlying orientation graph is connected, (10) is known to cause all agents to converge to a common heading [21].”
BackgroundLiu, W., Hu, J., Zhang, H., et al. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3339989 · Cited by 40
A differential game approach to formation control for a team of agents with one leader
Mylvaganam, T., & Astolfi, A. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170940 · Cited by 40
“Graph-theoretic methods are often used to take into account inter-agent communications [2], [12], [13].”
MethodAverage consensus in networks with nonlinearly delayed couplings and switching topology
Proskurnikov, A. V. (2013) · Automatica · doi:10.1016/j.automatica.2013.06.007 · Cited by 40
Yucelen, T., & Haddad, W. M. (2014) · International Journal of Control · doi:10.1080/00207179.2014.883647 · Cited by 40
“Networked multi-agent systems consist of a group of agents that locally sense their environment, communicate with each other, and process information in order to achieve a given set of system objectives.”
BackgroundMethodInfluentialAdaptive Communication-Constrained Deployment of Unmanned Vehicle Systems
Ny, J. L., Ribeiro, A., & Pappas, G. J. (2012) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2012.120608 · Cited by 40
“In particular, the disc model enables the use of graph theoretical methods to account for connectivity constraints, see e.g. [5], [6].”
MethodChapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_1 · Cited by 40
Topology identification of undirected consensus networks via sparse inverse covariance estimation
Hassan-Moghaddam, S., Dhingra, N. K., & Jovanović, M. R. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798973 · Cited by 38
“In order to achieve consensus in the absence of disturbances, it is required that the closed-loop graph Laplacian, Lx, be positive definite on the orthogonal complement of the vector of all ones, 1⊥ [32].”
BackgroundFormations on directed cycles with bearing‐only measurements
Trinh, M. H., Mukherjee, D., Zelazo, D., & Ahn, H. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3921 · Cited by 38
Distributed Optimal Transport for the Deployment of Swarms
Krishnan, V., & Martínez, S. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619816 · Cited by 61
“Literature review: The problems of deployment and formation control of groups of robots have been extensively studied in the past [1], [2].”
BackgroundDistributed Control of Multiconsensus
Gambuzza, L. V., & Frasca, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3006820 · Cited by 41
“1: Equations (2) are widely used in multi-agent problems such as flocking, swarming, and distributed estimation involving a scalar variable for each node [8].”
BackgroundDistributed Optimization Methods for Multi-Robot Systems: Part 2—A Survey
Shorinwa, O., Halsted, T., Yu, J., & Schwager, M. (2024) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2024.3352852 · Cited by 67
“Other useful background material can be found for distributed computation [30] [31], and on multi-robot systems in [32] [33].”
Portraits of self-organization in fish schools interacting with robots
Aureli, M., Fiorilli, F., & Porfiri, M. (2012) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2012.02.005 · Cited by 41
Eigenvector-based intergroup connection of low rank for hierarchical multi-agent dynamical systems
Tsubakino, D., & Hara, S. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2011.11.008 · Cited by 40
“A great number of researchers have paid attention to this field, especially consensus problems and cooperative con-trol [1, 2, 3, 4].”
BackgroundClark, A., Alomair, B., Bushnell, L. G., & Poovendran, R. (2017) · IEEE Control Systems · doi:10.1109/mcs.2017.2743518 · Cited by 44
Tong, D., Rao, P., Chen, Q., et al. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.04.067 · Cited by 39
Zegers, F. M., Hale, M., Shea, J. M., & Dixon, W. E. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3068348 · Cited by 46
Cooperative object transportation with differential-drive mobile robots: Control and experimentation
Ebel, H., Rosenfelder, M., & Eberhard, P. (2024) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2023.104612 · Cited by 39
Evolution and Controllability of Cancer Networks: A Boolean Perspective
Srihari, S., Raman, V., Leong, H. W., & Ragan, M. A. (2013) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2013.128 · Cited by 42
“…involved in core cell-cycle and DNA-damage repair pathways are signi.cantly rewired in tumours, indicating signi.cant impact to key genome-stabilizing mechanisms; (ii) several of the genes .ipped are serine/threonine kinases which act as biological switches, re.ecting cellular switching…”
BackgroundA framework for distributed control via dynamic periodic event-triggering mechanisms
Dhullipalla, M. H., Yu, H., & Chen, T. (2022) · Automatica · doi:10.1016/j.automatica.2022.110548 · Cited by 38
Distributed backstepping-based adaptive fuzzy control of multiple high-order nonlinear dynamics
Huang, J., Dou, L., Fang, H., et al. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-1973-9 · Cited by 38
“The neighbor set of node v j is denoted by N j , where j / ∈ N j [25].”
BackgroundPeriodic event-triggered average consensus over directed graphs
Meng, X., Xie, L., Soh, Y. C., Nowzari, C., & Pappas, G. J. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402866 · Cited by 39
“In the literature, an underlying fact behind discretetime consensus algorithms is that the sampling behavior is synchronous among all agents [1], [2].”
Pan, Y., Werner, H., Huang, Z., & Bartels, M. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.06.002 · Cited by 38
“In [27], a directed graph also called digraph consists of a set of vertices V together with a set of edges E.”
BackgroundVelocity Field Generation for Density Control of Swarms using Heat Equation and Smoothing Kernels
Eren, U., & Acikmese, B. A. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1454 · Cited by 41
“…such as leader-follower Desai et al. (2001); Yu et al. (2010) based solutions, algorithms that takes advantage of graph theory and consensus notion Mesbahi and Egerstedt (2010); Chapman (2015); Gal-busera et al. (2007), distributed optimization techniques Zhu and Mart´ınez (2015) and artificial…”
BackgroundStrong Structural Controllability of Systems on Colored Graphs
Jia, J., Trentelman, H. L., Baar, W., et al. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2948425 · Cited by 38
“The spreading interest in social networks and biological systems have also contributed to this surge [1], [2], [3], [4].”
BackgroundStructural Controllability of Directed Signed Networks
Guan, Y., Li, A., & Wang, L. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3059836 · Cited by 38
“…have been extensively studied, and related control theories and techniques have been widely applied in the field of social and engineering, such as cyber-physical systems, multirobot systems, smart power grids, aerospace and intelligent transportation systems, social networked systems [1]–[3], etc.”
BackgroundGraph-theoretic estimation of reconfigurability in origami-based metamaterials
Yamaguchi, K., Yasuda, H., Tsujikawa, K., Kunimine, T., & Yang, J. (2021) · Materials & Design · doi:10.1016/j.matdes.2021.110343 · Cited by 39
Consensus-Based Distributed Optimization Enhanced by Integral Feedback
Wang, X., Mou, S., & Anderson, B. D. O. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3169179 · Cited by 40
“The aim of consensus is to drive all agents in the network to reach an agreement regarding a certain quantity, which has served as a basis in deriving many distributed algorithms for multiagent systems such as motion synchronization [1], multirobot path planning/formation control [17], flocking of mobile robots [18],…”
BackgroundTwo invariants of human-swarm interaction
Brown, D. S., Goodrich, M. A., Jung, S.-Y., & Kerman, S. C. (2015) · Journal of Human-Robot Interaction · doi:10.5898/jhri.5.1.brown · Cited by 38
“…perspective, work in flocking and foraging relies on the robustness of these collective patterns, and much work has been dedicated to deriving decision rules for individual agents that, when combined, produce reliable patterns (Olfati-Saber, 2006; Jadbabaie et al., 2003; Mesbahi & Egerstedt, 2010).”
BackgroundResultInfluentialMulti-robot rendezvous based on bearing-aided hierarchical tracking of network topology
Luo, S., Kim, J., Parasuraman, R. N., et al. (2018) · Ad Hoc Networks · doi:10.1016/j.adhoc.2018.11.004 · Cited by 37
“A theoretical graph approach has been the base of many rendezvous control solutions as it provides a theoretical foundation to propose and validate control laws [23, 24, 25, 26].”
BackgroundChoiRbot: A ROS 2 Toolbox for Cooperative Robotics
Testa, A., Camisa, A., & Notarstefano, G. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3061366 · Cited by 56
A Reset Algorithm Solving Coordination With Antagonistic Reciprocity
Zhang, Y., Liu, Y., Yang, X., & Qiu, J. (2021) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2021.3049149 · Cited by 37
“Whereas, the final aggregated value of consensus merely links to the nodes contained in the unique maximum strongly connected component of the communication topology (see [2]).”
BackgroundInfluentialEvent/Self-Triggered Approximate Leader-Follower Consensus With Resilience to Byzantine Adversaries
Zegers, F. M., Deptula, P., Shea, J. M., & Dixon, W. E. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3074849 · Cited by 42
“A PPROXIMATE leader-follower consensus along with several other consensus variants have been extensively studied since they have a wide range of applications in multi-agent systems (MASs) and distributed computing (see [1]–[9]).”
BackgroundDecentralized Control of a Heterogeneous Human–Robot Team for Exploration and Patrolling
Aggravi, M., Sirignano, G., Giordano, P. R., & Pacchierotti, C. (2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2021.3106386 · Cited by 37
“A measure of the connectivity of the robot group is, as well-known, the second smallest eigenvalue λ 2 ≥ 0 of the Laplacian matrix L associated to graph G : the graph is connected iff λ 2 > 0 , [76].”
BackgroundDecentralized online optimization with global objectives and local communication
Nedić, A., Lee, S., & Raginsky, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7172037 · Cited by 43
Partial Stability Approach to Consensus Problem of Linear Multi-agent Systems
Chen, Y., Ge, Y., & Zhang, Y. (2014) · Acta Automatica Sinica · doi:10.1016/s1874-1029(14)60403-1 · Cited by 39
Resilient networked multiagent systems: A distributed adaptive control approachy
Torre, G. D. L., Yucelen, T., & Peterson, J. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040228 · Cited by 36
“Next, we recall some of the basic notions from graph theory and networked multiagent systems [16,17].”
BackgroundProblems and methods of network control
Proskurnikov, A. V., & Fradkov, А. L. (2016) · Automation and Remote Control · doi:10.1134/s0005117916100015 · Cited by 41
Liu, Z., Zhang, M., Saberi, A., et al. (2018) · European Journal of Control · doi:10.1016/j.ejcon.2018.01.007 · Cited by 36
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [14], [19], [26], [35] and references therein).”
BackgroundFeedback control strategies for multi-agent systems under a fragment of signal temporal logic tasks
Lindemann, L., & Dimarogonas, D. V. (2019) · Automatica · doi:10.1016/j.automatica.2019.05.013 · Cited by 38
“…a promising research area where scholars have addressed multi-agent navigation (Dimarogonas et al., 2006), consensus (Ren and Beard, 2005), formation control (Tanner et al., 2003), and connectivity maintenance problems (Zavlanos and Pappas, 2008), see Mesbahi and Egerstedt (2010) for an overview.”
InfluentialResilient Consensus for Robust Multiplex Networks with Asymmetric Confidence Intervals
Shang, Y. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3025621 · Cited by 41
Belabbas, M.-A. (2013) · Systems & Control Letters · doi:10.1016/j.sysconle.2013.07.004 · Cited by 33
“While the use of graphical methods in control is not new (see Lin [10], Mesbahi and Egerstedt [11], or the early monograph [12]), our approach departs from earlier work in the sense that it relates graph-theoretic properties to system stability.”
MethodA decentralized algorithm for balancing a strongly connected weighted digraph
Priolo, A., Gasparri, A., Montijano, E., & Sagüés, C. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580866 · Cited by 43
“A common assumption in the multi-agent literature is to model the communication among the agents as an undirected communication graph (see [6], [7] and the references therein).”
BackgroundCooperative target capture using predefined-time consensus over fixed and switching networks
Sinha, A., & Kumar, S. R. (2022) · Aerospace Science and Technology · doi:10.1016/j.ast.2022.107686 · Cited by 35
Active-passive networked multiagent systems
Yucelen, T., & Peterson, J. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040479 · Cited by 35
“Since P(Ḡ) ∈ Sn×n + (and R(Ḡ) ∈ Sm×m + ) holds [1], [14] and P(Ḡ) = F(G) = L(G) + K based on the above construction of the expanded graph, then it follows that F(G) is a nonsingular, symmetric, and positive-definite real matrix.”
BackgroundPulse width modulation for multi-agent systems
Meng, X., Meng, Z., Chen, T., Dimarogonas, D. V., & Johansson, K. H. (2016) · Automatica · doi:10.1016/j.automatica.2016.03.012 · Cited by 38
“The research interest in consensus problems for multi-agent systems is evident with recent monographs (Ren & Beard 2008), (Mesbahi & Egerstedt 2010) and papers (Xiao & Wang 2008), (Meng, Ren & You 2010), (Qin, Zheng & Gao 2011), (Liu, Li, Xie, Fu & Zhang 2013).”
Cloud-Supported Formation Control of Second-Order Multiagent Systems
Adaldo, A., Liuzza, D., Dimarogonas, D. V., & Johansson, K. H. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2732819 · Cited by 35
“This type of graph is known in the literature as a simple weighted digraph [20].”
BackgroundOpinion Dynamics-Based Vehicle Velocity Estimation and Diagnosis
Hashemi, E., Pirani, M., Khajepour, A., et al. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2724852 · Cited by 35
“Many engineering applications of such mathematical approaches have been developed in engineering disciplines as well [21], [22].”
BackgroundAsynchronous distributed event-triggered circle formation of multi-agent systems
Wen, J., Wang, C., & Xie, G. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.03.018 · Cited by 35
Khalili, M., Zhang, X., Cao, Y., Polycarpou, M. M., & Parisini, T. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4232 · Cited by 35
“The difference between the nominal model (2) and the actual (healthy) system dynamics (3) is because of ηi(xi, t), characterizing the modeling uncertainty in the state dynamics of the healthy agent, including disturbances and modeling errors.”
BackgroundRobustness of Consensus over Weighted Digraphs
Mukherjee, D., & Zelazo, D. (2018) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2018.2866780 · Cited by 33
Khan, A. S., Khan, A. Q., Iqbal, N., et al. (2020) · ISA Transactions · doi:10.1016/j.isatra.2020.03.014 · Cited by 35
Deng, Z., & Wang, L. (2020) · IET Control Theory and Applications · doi:10.1049/iet-cta.2019.1169 · Cited by 35
“In this section, we introduce related notations and some basic concepts about graph theory [37] and convex analysis [38].”
BackgroundMethodAggravi, M., Elsherif, A. A. S., Giordano, P. R., & Pacchierotti, C. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3067859 · Cited by 34
“These constraints are encoded, via suitable weights, into the adjacency matrix A ∈ RN×N associated to the graph G [6], from which one can compute the so-called Laplacian matrix and its second smallest eigenvalue λ2 that acts as a connectivity metric: λ2 > 0 for a connected graph and λ2 = 0 otherwise [23].”
MethodOn symmetry and controllability of multi-agent systems
Chapman, A., & Mesbahi, M. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039451 · Cited by 38
“Such scenarios include networked robotic systems, human-swarm interaction, and network security [3], [4], and in areas such as quantum networks [5].”
BackgroundSelf-citationCharacterizing the positive semidefiniteness of signed Laplacians via Effective Resistances
Chen, W., Liu, J., Chen, Y., Khong, S. Z., Wang, D., Başar, T., Qiu, L., & Johansson, K. H. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798396 · Cited by 34
Localization in Densely Packed Swarms Using Interrobot Collisions as a Sensing Modality
Mayya, S., Pierpaoli, P., Nair, G. N., & Egerstedt, M. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2872285 · Cited by 34
“, [3] and [4].”
Self-citationBalanced truncation of networked linear passive systems
Cheng, X., Scherpen, J. M. A., & Besselink, B. (2019) · Automatica · doi:10.1016/j.automatica.2019.02.045 · Cited by 35
“, [17,23] for an overview).”
Tran, Q. V., Lee, C., Kim, J., et al. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3259105 · Cited by 34
Hierarchical Clustering of Dynamical Networks Using a Saddle-Point Analysis
Bürger, M., Zelazo, D., & Allgöwer, F. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2206695 · Cited by 34
“theory has been recently developed [4], including a variety of”
BackgroundCao, Y., & Ren, W. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160725 · Cited by 33
“For more results about consensus, the readers are referred to [6]–[9] and references therein.”
BackgroundGraph-Theoretic Analysis and Synthesis of Relative Sensing Networks
Zelazo, D., & Mesbahi, M. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2085312 · Cited by 34
“Recent examples of such graph-centric analysis include relating closedloop stability properties of multi-agent systems to the spectral properties of the graph Laplacian [11], relating controllability in consensus seeking systems to graph symmetry [29], [36], graph-theoretic analysis and performance bounds for consensu…”
BackgroundSelf-citationAnalysis and prediction of vulnerability in smart power transmission system: A geometrical approach
Gupta, S. R., Kazi, F., Wagh, S. R., & Singh, N. (2017) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2017.06.033 · Cited by 34
Consensus Conditions for Multi-Agent Systems Under Delayed Information
Wang, Z., Xu, J., Song, X., et al. (2018) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2017.2788564 · Cited by 34
“Remark 3: It should be noted that average consensus [14] can be derived in Corollary 1 when the undirected graph G is regular [25].”
Background
Metadata
- Authors
- Mesbahi, M., & Egerstedt, M.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 2010-12-31
- OpenAlex
- W613360614
- Cited by
- 2,897
- References
- 0
- Citations by year
- 2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
- FWCI
- 74.30
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Princeton University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.