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 101–200 of 2,960
Decentralized rigidity maintenance control with range measurements for multi-robot systems
Zelazo, D., Franchi, A., Bülthoff, H., & Giordano, P. R. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914546173 · Cited by 140
Lindemann, L., & Dimarogonas, D. V. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2917975 · Cited by 111
“COLLABORATIVE control of multi-agent systems deals with achieving global tasks such as consensus, formation control, connectivity maintenance, and collision avoidance (see [1] for an overview).”
BackgroundLi, L., Ho, D. W. C., & Xu, S. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2013.0761 · Cited by 109
“For a detail discussion on graph theory as mathematical formalisation of multi-agent system, refer to [27, 28].”
BackgroundMulti-Agent Cooperative Control Consensus: A Comparative Review
Gulzar, M. M., Rizvi, S. T. H., Javed, M. Y., Munir, U., & Asif, H. (2018) · Electronics · doi:10.3390/electronics7020022 · Cited by 122
On the Stabilizability and Consensus of Positive Homogeneous Multi-Agent Dynamical Systems
Valcher, M. E., & Mısra, P. K. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2294621 · Cited by 107
“, [22], [24], [32]).”
Wang, D., Wang, Z., Chen, M., & Wang, W. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.040 · Cited by 108
Resilient consensus of switched multi-agent systems
Shang, Y. (2018) · Systems & Control Letters · doi:10.1016/j.sysconle.2018.10.001 · Cited by 107
“In general, the main goal of consensus problems is to reach agreement collectively on global quantities of interest, such as the centroid of the network or the average temperature of the environment, using nearestneighbor rules due to the limited communication capability of each agent in the network [1].”
BackgroundMultiagent Reinforcement Learning: Rollout and Policy Iteration
Bertsekas, D. P. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003814 · Cited by 138
“For more recent works, see Bauso and Pesenti [25], [26], Nayyar, Mahajan, and Teneketzis [27], Nayyar and Teneketzis [28], Li et al. [29], Qu and Li [30], Gupta [31], the books by Bullo, Cortes, and Martinez [32], Mesbahi and Egerstedt [33], Mahmoud [34], and Zoppoli, Sanguineti, Gnecco, and Parisini [35], and the ref…”
BackgroundDuality and network theory in passivity-based cooperative control
Bürger, M., Zelazo, D., & Allgöwer, F. (2014) · Automatica · doi:10.1016/j.automatica.2014.06.002 · Cited by 121
“A fundamental goal for the analysis of these systems is to reveal the interplay between properties of the individual dynamic agents, the underlying network topology, and the interaction protocols that influence the functionality of the overall system [5].”
The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
Dhingra, N. K., Khong, S. Z., & Jovanovic, M. R. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2867589 · Cited by 149
“Any vector of edge weights z that satisfies this constraint can be written as z = Tx where the columns of T span the nullspace of the matrix E and provide a basis for the space of balanced graphs, i.e., the cycle space [44].”
InfluentialFormation flight of fixed-wing UAV swarms: A group-based hierarchical approach
Chen, H., Wang, X., Shen, L., & Cong, Y. (2020) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2020.03.006 · Cited by 114
Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
Aguilar, C. O., & Gharesifard, B. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2381435 · Cited by 110
“Examples include distributed energy resources, oscillator synchronization, distributed robotic networks [2], [3], [4], and also cascades of information and opinions in social networks [5].”
Backgroundvan der Schaft, A. J., Rao, S., & Jayawardhana, B. (2013) · SIAM Journal on Applied Mathematics · doi:10.1137/11085431x · Cited by 101
“This means that the elements of the vector γ of complex thermodynamical affinities belonging to the same connected component of the complex graph converge to the same value, similar to standard consensus algorithms [20].”
Cardona, G. A., & Calderón, J. M. (2019) · Applied Sciences · doi:10.3390/app9081702 · Cited by 118
“According to [38] the consensus equation shown above will have a space of agreement A = X ∈ R n | x i = x j ∀ i , j (cid:9) in which, when ˙ x i = 0 there will be a consensus.”
BackgroundMethodInfluentialControlling Noncooperative Herds with Robotic Herders
Pierson, A. N., & Schwager, M. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2017.2776308 · Cited by 119
“We assume the dogs are able to perfectly track their desired positions, a common assumption in the multirobot literature [8], [25].”
BackgroundLearning-Based Quantum Robust Control: Algorithm, Applications, and Experiments
Dong, D., Xing, X., Ma, H., Chen, C., Liu, Z., & RABITZ, H. A. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2921424 · Cited by 125
“Achieving consensus is one of the primary objectives in distributed coordination and control of classical (nonquantum) networked systems [36].”
Abbas, W., Lászka, Á., & Koutsoukos, X. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2782486 · Cited by 101
“distributed optimization, parameter estimation, and flocking, the consensus problem is of significant importance in distributed networks and cooperative control [34].”
BackgroundFree-Will Arbitrary Time Consensus for Multiagent Systems
Pal, A. K., Kamal, S., Yu, X., et al. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3032217 · Cited by 101
“The initial states of the agents are given by x0 = [1, 2, 3, 4, 5] .”
BackgroundFully distributed robust synchronization of networked Lur’e systems with incremental nonlinearities
Zhang, F., Trentelman, H. L., & Scherpen, J. M. A. (2014) · Automatica · doi:10.1016/j.automatica.2014.08.033 · Cited by 100
“The graph G is connected if and only if its Laplacian eigenvalue 0 has geometric multiplicity one, see [17].”
BackgroundProjection-Based Model Reduction of Multi-Agent Systems Using Graph Partitions
Monshizadeh, N., Trentelman, H. L., & Camlibel, M. K. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2311883 · Cited by 109
Multi-objective compositions for collision-free connectivity maintenance in teams of mobile robots
Wang, L., Ames, A. D., & Egerstedt, M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798663 · Cited by 104
“Multi-robot coordination strategies are often designed to achieve team level collective goals, such as covering areas, forming speci fi ed shapes, search and surveillance, see e.g. [5], [11], [4], [12].”
BackgroundSelf-citationModel Reduction and Clusterization of Large-Scale Bidirectional Networks
Ishizaki, T., Kashima, K., Imura, J., & Aihara, K. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2275891 · Cited by 105
“Given a constant , find a -dimensional approximant such that and (8) Our approach to solving Problem 1 is as follows.”
BackgroundCollective Circular Motion of Unicycle Type Vehicles With Nonidentical Constant Velocities
Seyboth, G. S., Wu, J., Qin, J., Yu, C. B., & Allgöwer, F. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2316995 · Cited by 97
“In the following, the entities in such a group are referred to as agents.”
BackgroundMondal, A., Bhowmick, C., Behera, L., & Jamshidi, M. M. (2017) · IEEE Systems Journal · doi:10.1109/jsyst.2017.2778063 · Cited by 100
“A multiagent system [2] can be defined as a group of intelligent agents that coordinate and cooperate with each other to complete some complex task that they have been designed to do for.”
BackgroundStochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
Lee, S., Nedić, A., & Raginsky, M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2650563 · Cited by 100
Observer-Based Decentralized Fault Detection and Isolation Strategy for Networked Multirobot Systems
Arrichiello, F., Marino, A., & Pierri, F. (2015) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2014.2377175 · Cited by 102
“A wide overview on such a problem can be found in [7] and [19].”
BackgroundMethodLi, M. (2018) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2018.2842085 · Cited by 96
“For more details consult [18].”
Distributed stabilization control of rigid formations with prescribed orientation
Sun, Z., Park, M., Anderson, B. D. O., & Ahn, H. (2017) · Automatica · doi:10.1016/j.automatica.2016.12.031 · Cited by 91
Shape Formation in Homogeneous Swarms Using Local Task Swapping
Wang, H., & Rubenstein, M. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.2967656 · Cited by 111
On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems
Nedić, A., & Liu, J. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2572004 · Cited by 107
Bastianello, N., Carli, R., Schenato, L., & Todescato, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3011358 · Cited by 119
“This section collects some preliminary definitions in graph theory [40] and convex analysis [41], as well as a brief review of the necessary background regarding operator theory [25] and the R-ADMM [20], [23].”
BackgroundYi, P., & Pavel, L. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2908091 · Cited by 92
“s one points to i and the other starts from i. Define an edge neighbour set of e l as N e l = fe pj[L] lp6= 0 g. Notice that e l2Ne l . Moreover, we know that Ne l = S j2N l E j. Refer to Chapter 2 of [35] for edge Laplacian and its application in consensus problems. We introduce variables in the distributed algorithm.…”
BackgroundSafety barrier certificates for heterogeneous multi-robot systems
Wang, L., Ames, A. D., & Egerstedt, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526486 · Cited by 93
“This, however, means that the already established, coordinated multi-robot controllers in the literature [6], [8], [11] are no longer valid and must be revisited.”
BackgroundMethodSelf-citationPerformance and design of cycles in consensus networks
Zelazo, D., Schuler, S., & Allgöwer, F. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2012.10.014 · Cited by 90
Synchronization and consensus controllers for a class of parabolic distributed parameter systems
Demetriou, M. A. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2012.10.010 · Cited by 90
Synchronous Hybrid Event- and Time-Driven Consensus in Multiagent Networks With Time Delays
Xiao, F., Chen, T., & Gao, H. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2428056 · Cited by 96
“Note that, the definition of MIMI is independent of the choice of MI and matrices MIMI and MIMI share the same nonzero eigenvalues [28], where matrix MIMI is called edge Laplacian and denoted by LE = [lE ij ] in this paper.”
A Distributed Feedback Motion Planning Protocol for Multiple Unicycle Agents of Different Classes
Panagou, D. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2576020 · Cited by 90
Soares, C., Xavier, J., & Gomes, J. P. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2454853 · Cited by 90
Distributed Adaptive Control of Networked Cooperative Mobile Manipulators
Marino, A. (2017) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2017.2720673 · Cited by 90
“Hence, rank(L) ≤ N − 1 where the equality holds for strongly connected [19].”
BackgroundGroup consensus of multi-agent systems in directed networks with noises and time delays
Shang, Y. (2013) · International Journal of Systems Science · doi:10.1080/00207721.2013.862582 · Cited by 86
“…many research have been focused on the distributed coordination of multi-agent systems (see e.g. Fax & Murray, 2004; Gao, Zuo, Jiang, Du, & Ma, 2013; Jadbabaie, Lin, & Morse, 2003; Mesbahi & Egerstedt, 2010; Olfati-Saber & Murray, 2004; Ren & Beard, 2005; Ren, Beard, & Atkins, 2005; Shang, 2012a).”
Yi, X., Yao, L., Yang, T., George, J., & Johansson, K. H. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618989 · Cited by 112
“In this section, we present some definitions from algebraic graph theory [30] and the problem formulation.”
MethodGenetic Optimization-Based Consensus Control of Multi-Agent 6-DoF UAV System
Najm, A. A., Ibraheem, I. K., Azar, A. T., & Humaidi, A. J. (2020) · Sensors · doi:10.3390/s20123576 · Cited by 92
“Consensus and formation control algorithms can be categorized into leaderless and leader–follower depending on how the agents are connected in the communication network represented using graph theory [14].”
BackgroundOn the Controllability Properties of Circulant Networks
Nabi-Abdolyousefi, M., & Mesbahi, M. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2259992 · Cited by 87
Self-citationDistributed Matrix Scaling and Application to Average Consensus in Directed Graphs
Domínguez-García, A. D., & Hadjicostis, C. N. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2219953 · Cited by 89
“…IEEE The problem of obtaining a doubly stochastic matrix and the distributed solutions proposed in this paper are related to matrix scaling problems, which have been addressed in the context of nonnegative matrices [14]–[16] (the comparison of these works with ours is deferred to Section III-B).”
BackgroundControl of multiagent systems under persistent disturbances
Yucelen, T., & Egerstedt, M. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314791 · Cited by 94
“We refer to [3] and [1] for more details about graph theory and multiagent networks.”
BackgroundSelf-citationStructural controllability of multi-agent networks: Robustness against simultaneous failures
Rahimian, M. A., & Aghdam, A. G. (2013) · Automatica · doi:10.1016/j.automatica.2013.06.023 · Cited by 80
“This type of system consists of a group of dynamic agents which interact according to a given information flow topology [1,2].”
BackgroundEvent-Based Distributed Clock Synchronization for Wireless Sensor Networks
Kadowaki, Y., & Ishii, H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2372932 · Cited by 84
“It is clear that the scheme (12) takes the form of a discrete-time consensus algorithm [12].”
Controller architectures: Tradeoffs between performance and structure
Jovanović, M. R., & Dhingra, N. K. (2016) · European Journal of Control · doi:10.1016/j.ejcon.2016.05.003 · Cited by 107
“Optimal edge addition in consensus networks Reaching consensus via distributed information exchange across a network has garnered much recent attention [79] with applications ranging from social networks [22,47], to distributed computing networks [19,7], to cooperative control of vehicular formations [53,88,80,104,15,…”
The GRITSBot in its natural habitat - A multi-robot testbed
Pickem, D., Lee, M., & Egerstedt, M. (2015) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2015.7139767 · Cited by 86
“The rendezvous problem is a canonical problem in multiagent robotics and involves N agents reaching an agreement of some scalar or vector quantity in a network (see [10]).”
BackgroundSelf-citationClark, A., Alomair, B., Bushnell, L. G., & Poovendran, R. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2303236 · Cited by 92
“Surveys of recent results can be found in [18] and [19].”
Graph-Theoretic Analysis of Power Systems
Ishizaki, T., Chakrabortty, A., & Imura, J. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2812298 · Cited by 97
“This type of graph symmetry is called graph automorphism in graph theory [35], [36].”
BackgroundConsensus in networked multi-agent systems with adversaries
LeBlanc, H. J., & Koutsoukos, X. (2011) · International Conference on Hybrid Systems: computation and control · doi:10.1145/1967701.1967742 · Cited by 95
“In control, consensus algorithms have been used for the coordination of dynamic agents for group formation [10, 33], conflict resolution [24], and a host of other problems [19, 21].”
Finite-Time Cooperative Engagement
Yucelen, T., Kan, Z., & Pasiliao, E. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2881132 · Cited by 84
“We now recall some notions from graph theory (see [3], [42] for details).”
BackgroundBarrier Function Based Collaborative Control of Multiple Robots Under Signal Temporal Logic Tasks
Lindemann, L., & Dimarogonas, D. V. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3014602 · Cited by 83
“Collaborative control of multi-agent systems deals with achieving tasks such as consensus [1], formation control [2], connectivity maintenance [3], and collision avoidance [4] (see [5] for an overview).”
Background1Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator NetworksPreprint
Fardad, M., Lin, F., & Jovanović, M. R. (2016) · Cited by 83
Tran, D. M., & Yucelen, T. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.104605 · Cited by 90
Formation Control of Mobile Robots Using Multiple Aerial Cameras
Aranda, M., Nicolás, G. L., Sagüés, C., et al. (2015) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2452777 · Cited by 81
“Typically, the formation to be stabilized is defined in terms of absolute positions for the robots to reach [1], [2], or as relative position vectors or distances between the agents [3].”
BackgroundFu, J., Wan, Y., Wen, G., & Huang, T. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2893665 · Cited by 81
“Furthermore, some sophisticated missions can be realized more efficiently using multiagent systems such as coverage, search and tracking, surveillance, mapping, and exploring [3]–[5].”
BackgroundFormally Correct Composition of Coordinated Behaviors Using Control Barrier Certificates
Li, A., Wang, L., Pierpaoli, P., & Egerstedt, M. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594302 · Cited by 96
“For example, a strongly connected communication graph guarantees that the flocking and rendezvous behaviors can be achieved through consensus [18], and a rigid graph is required for a formation control law to function correctly [15].”
BackgroundSelf-citationDistributed Fault-Tolerant Control of Multiagent Systems: An Adaptive Learning Approach
Khalili, M., Zhang, X., Cao, Y., Polycarpou, M. M., & Parisini, T. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2904277 · Cited by 80
Sampled-data consensus in switching networks of integrators based on edge events
Xiao, F., Meng, X., & Chen, T. (2014) · International Journal of Control · doi:10.1080/00207179.2014.955530 · Cited by 80
Multirobot Coordination With Counting Temporal Logics
Sahin, Y. E., Nilsson, P., & Özay, N. (2019) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2957669 · Cited by 80
“Traditional algorithms for multirobot coordination tend to focus on relatively simple tasks such as reaching a goal state while avoiding unsafe regions and collisions [32], [41], [38], or reaching a consensus [14], [22].”
BackgroundBipartite Consensus on Matrix-Valued Weighted Networks
Pan, L., Shao, H., Mesbahi, M., et al. (2018) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2018.2884483 · Cited by 80
“, A23 = [ 2 0 0 1 ] ;”
Self-citationAlgorithms for leader selection in large dynamical networks: Noise-free leaders
Fardad, M., Lin, F., & Jovanović, M. R. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161482 · Cited by 73
“INTRODUCTION The consensus of the multi-agent networks is of fundamental interest in the context of distributed control [1]– [4].”
BackgroundCircular Formation Control of Multiple Unicycle-Type Agents With Nonidentical Constant Speeds
Sun, Z., de Marina, H. G., Seyboth, G. S., Anderson, B. D. O., & Yu, C. B. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2017.2763938 · Cited by 79
“Remark 3: The main idea in the controller design is inspired by the consensus-based linear formation control [29], [31].”
BackgroundConsensus and formation control on SE(3) for switching topologies
Thunberg, J., Gonçalves, J. M., & Xiaoming Hu, A. (2016) · Automatica · doi:10.1016/j.automatica.2015.12.035 · Cited by 79
“The structure of these second control laws and especially (11) and (13) are well known from the literature [20,21].”
BackgroundZeno-free, distributed event-triggered communication and control for multi-agent average consensus
Nowzari, C., & Cortés, J. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859495 · Cited by 80
“Regarding average consensus, the available literature is ample, see e.g., [11], [12], [13].”
How to Secure Distributed Filters Under Sensor Attacks
He, X., Ren, X., Sandberg, H., & Johansson, K. H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3092603 · Cited by 88
“[38] The undirected graph G is connected if and only if λ2(L) > 0.”
BackgroundOn the complexity of the constrained input selection problem for structural linear systems
Pequito, S., Kar, S., & Aguiar, A. P. (2015) · Automatica · doi:10.1016/j.automatica.2015.06.022 · Cited by 73
“Furthermore, this restricted class is practically relevant and, as shown later, subsumes important applications in multi-agent control such as leader-follower problems [8,9]; as a demonstration, we show how our reduction can be used to solve the leader-selection problem and a more general variant of it, which we refer…”
Consensus networks over finite fields
Pasqualetti, F., Borra, D., & Bullo, F. (2013) · Automatica · doi:10.1016/j.automatica.2013.11.011 · Cited by 84
“Sensor and actuator networks have recently attracted interest from different research communities, and, in the last years, classic computation, control, and estimation problems have been reformulated to conform the distributed nature of these networked systems [1,2,3].”
BackgroundExponentially fast parameter estimation in networks using distributed dual averaging
Shahrampour, S., & Jadbabaie, A. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760868 · Cited by 84
Fixed-time Group Consensus of Nonlinear Multi-agent Systems via Pinning Control
Hao, L., Zhan, X., Wu, J., et al. (2020) · International Journal of Control Automation and Systems · doi:10.1007/s12555-019-1005-5 · Cited by 77
Resilient Consensus Through Event-Based Communication
Wang, Y., & Ishii, H. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2924235 · Cited by 78
“Robust graphs may not be strongly connected in general, but this property indicates that the notion of robust graphs is a generalization of graphs containing directed spanning trees, which are of great relevance in the literature of consensus [22].”
BackgroundDistributed edge-based event-triggered coordination control for multi-agent systems
Zhao, H., Meng, X., & Wu, S. (2021) · Automatica · doi:10.1016/j.automatica.2021.109797 · Cited by 80
Restrepo, E., Lorı́a, A., Sarras, I., & Marzat, J. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3144107 · Cited by 76
“THE literature on consensus control, which constitutes the basis of cooperative interaction for multiagent systems, is rife with works addressing diverse problems for a variety of dynamical systems, both linear [1]–[3] and nonlinear—most often second-order mechanical systems [4]–[8], but consensus of high-order system…”
BackgroundContinuous-time proportional-integral distributed optimisation for networked systems
Droge, G. N., Kawashima, H., & Egerstedt, M. (2014) · Journal of Control and Decision · doi:10.1080/23307706.2014.926622 · Cited by 78
“The graph Laplacian for a connected graph with N nodes always has rank N − 1 , [2].”
InfluentialSelf-citationAinsworth, N., & Grijalva, S. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2257887 · Cited by 78
“Since is connected, (see [13]), and therefore in space (14) corresponds to”
BackgroundMethodXiao, F., & Chen, T. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.12.006 · Cited by 73
“To describe the structure of interaction topology G, we use an incidencematrixD ofG, which is defined based on some given edge orientations; the matrix DTD, denoted by LE = [lEij], is called Edge Laplacian and it has the same non-zero eigenvalues as the graph Laplacian DDT [31].”
MethodInfluentialZhang, S., Camlibel, M. K., & Cao, M. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160658 · Cited by 78
“[11], [14], the controllability problem of multi-agent systems is sometimes studied in a different setting where it is assumed that the dynamics of the leaders are completely determined by the control input.”
BackgroundMethodInfluentialFranchi, A., & Giordano, P. R. (2012) · doi:10.1109/cdc.2012.6426034 · Cited by 73
“Decentralized accomplishment of a prescribed formation is a cardinal problem in multi-agent control, see, e.g,. [1], [2], [3], [4].”
BackgroundDesign of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
Fardad, M., Lin, F., & Jovanovic, M. R. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2301577 · Cited by 86
Circumnavigation on Multiple Circles Around a Nonstationary Target With Desired Angular Spacing
Sen, A., Sahoo, S. R., & Kothari, M. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2935839 · Cited by 71
“A detailed preliminary on the graph theory is given in [26].”
BackgroundDistributed dynamic event-triggered control for multi-agent systems
Yi, X., Liu, K., Dimarogonas, D. V., & Johansson, K. H. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264666 · Cited by 82
“PRELIMINARIES In this section, we present some definitions from algebraic graph theory [24] and the considered multi-agent system.”
BackgroundAn overview of consensus problems in constrained multi-agent coordination
Wang, Q., Gao, H., Alsaadi, F. E., & Hayat, T. (2014) · Systems Science & Control Engineering · doi:10.1080/21642583.2014.897658 · Cited by 77
“…2009; Leonard et al., 2007; Olfati-Saber, Fax, & Murray, 2007; Ren, Beard, & Atkins, 2007; Zhang, Gao, & Kaynak, 2013), the books (Bai, Arcak, & Wen, 2011; Gazi & Fidan, 2007; Mesbahi & Egerstedt, 2010; Qu, 2009; Ren & Beard, 2008; Ren & Cao, 2011; Shamma, 2007; Wu, 2007) and references therein.”
Group consensus for heterogeneous multi-agent systems with parametric uncertainties
Hu, H., Yu, W., Xuan, Q., Zhang, C., & Xie, G. (2014) · Neurocomputing · doi:10.1016/j.neucom.2014.04.021 · Cited by 69
“Please be referred to [21,22] for a more comprehensive overview of the field.”
BackgroundElahi, A., Alfi, A., & Modares, H. (2019) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2019.1911474 · Cited by 69
“Distributed multiagent CPSs, in which a set of agents share their information throughout a communication network to achieve a common group objective, have been the subject of renewed surge of interest due to their potential applications in various engineering disciplines such as power and energy systems [1], robotic n…”
BackgroundDistributed state estimation for discrete-time linear time invariant systems: A survey
Rego, F., Pascoal, A., Aguiar, A. P., et al. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.08.003 · Cited by 69
Distributed Implementation of Control Barrier Functions for Multi-agent Systems
Tan, X., & Dimarogonas, D. V. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3133802 · Cited by 68
“The associated Laplacian matrix [14] is denoted as L and the neighborhood set of agent i is defined as N i := { j ∈ I : ( i, j ) ∈ E . state x ⊤ Thus, the stacked locally available loc,i : x loc,i stores the states of agent i and all it neighboring agents j ∈ N i . the In many applications, stacked…”
BackgroundContinuous-time opinion dynamics on multiple interdependent topics
Ye, M., Trinh, M. H., Lim, Y., Anderson, B. D. O., & Ahn, H. (2020) · Automatica · doi:10.1016/j.automatica.2020.108884 · Cited by 94
“ph is strongly connected if and only if, for every node v i, there exists a directed path to every other node v j. The following is a standard result that will be used throughout this paper. Lemma 1 ([16]) The Laplacian Lassociated with a graph G= (V;E;A) has a single eigenvalue at 0 if and only if Ghas a directed spa…”
MethodRigidity Maintenance Control for Multi-Robot Systems
Zelazo, D., Franchi, A., Allgöwer, F., Bülthoff, H., & Giordano, P. R. (2012) · Robotics: Science and Systems · doi:10.15607/rss.2012.viii.060 · Cited by 81
“Applications that rely on multi-agent solutions vary from interferometry in deep space, distributed sensing and data collection, surveillance, construction and transportation, and search and rescue operations [1, 2, 7, 22, 23, 24, 25].”
BackgroundPath Laplacian matrices: Introduction and application to the analysis of consensus in networks
Estrada, E. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.11.032 · Cited by 72
Fixed‐time group consensus for multi‐agent systems with non‐linear dynamics and uncertainties
Shang, Y. (2017) · IET Control Theory and Applications · doi:10.1049/iet-cta.2017.1021 · Cited by 67
“The communication topology of a multi-agent system can often be described by a graph [37].”
BackgroundZhao, Y., Wang, T., & Bi, W. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2814632 · Cited by 73
Jin, L., Liang, S., Luo, X., & Zhou, M. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3159367 · Cited by 66
“Lemma 1 [37]: For a connected undirected graph with n nodes, the graph Laplace is real symmetric and positive semidefinite.”
BackgroundMethodInfluentialPirani, M., & Sundaram, S. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859421 · Cited by 73
“, unweighted ErdosRenyi random graphs), the algebraic connectivity grows unboundedly [27] while λ(Lg) remains bounded.”
BackgroundFault-Tolerant Clock Synchronization Over Unreliable Channels in Wireless Sensor Networks
Kikuya, Y., Dibaji, S. M., & Ishii, H. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2732169 · Cited by 65
“Consensus-type problems for multiagent systems have been studied in a range of disciplines [2], [15], [26], [28].”
BackgroundNetwork Identification via Node Knockout
Nabi-Abdolyousefi, M., & Mesbahi, M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2200376 · Cited by 81
Self-citationUAVs Trajectory Planning by Distributed MPC under Radio Communication Path Loss Constraints
Grancharova, A., Grøtli, E. I., Ho, T. D., & Johansen, T. A. (2014) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-014-0090-1 · Cited by 71
“In [44], the focus is on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks.”
BackgroundAryankia, K., & Šelmić, R. R. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3006187 · Cited by 71
“A graph is minimally rigid in 2D if and only if |E| = 2|V|− 3; for more details please see [14].”
BackgroundProbabilistic swarm guidance using optimal transport
Bandyopadhyay, S., Chung, S., & Hadaegh, F. Y. (2014) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/cca.2014.6981395 · Cited by 80
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.