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 501–600 of 2,960
Prescribed Performance Control Guided Policy Improvement for Satisfying Signal Temporal Logic Tasks
Várnai, P., & Dimarogonas, D. V. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814999 · Cited by 25
“the consensus protocol [21] with additional free inputs, i.”
BackgroundDynamic Resilient Network Games With Applications to Multiagent Consensus
Nugraha, Y., Cetinkaya, A., Hayakawa, T., et al. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3016839 · Cited by 26
Influence of Opinion Dynamics to Inhibit Epidemic Spreading Over Multiplex Network
Bhowmick, S., & Panja, S. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3035873 · Cited by 27
“Both the networks are considered strongly connected [20].”
BackgroundRezaei, V., & Stefanovic, M. (2021) · Automatica · doi:10.1016/j.automatica.2021.109657 · Cited by 26
Decentralized Control of Multiagent Systems Using Local Density Feedback
Biswal, S., Elamvazhuthi, K., & Berman, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3109520 · Cited by 31
“In contrast to commonly used graph-theoretic approaches for controlling multi-agent systems [7], [24], control approaches based on mean-field models scale well to very large numbers of agents.”
ResultOnline distributed ADMM via dual averaging
Hosseini, S., Chapman, A., & Mesbahi, M. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039496 · Cited by 31
“Based on the construction of the weighted graph Laplacian, for every graph G, L(G) has a right eigenvector of 1 associated with eigenvalue Λ = 1 [12].”
MethodSelf-citationThe deformed consensus protocol
Morbidi, F. (2013) · Automatica · doi:10.1016/j.automatica.2013.07.006 · Cited by 26
Optimal Trajectory Generation for Establishing Connectivity in Proximity Networks
Dai, R., Maximoff, J., & Mesbahi, M. (2013) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2013.6558031 · Cited by 26
“for Establishing Connectivity in”
Self-citationCharacterization of link failures in multi-agent systems under the agreement protocol
Rahimian, M. A., Ajorlou, A., & Aghdam, A. G. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314875 · Cited by 24
“The design of agreement protocols with inputs and outputs is considered in Chapter 10 of [12], where the”
BackgroundMethodInfluentialResilience in consensus dynamics via competitive interconnections
Gharesifard, B., & Başar, T. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00018 · Cited by 26
“This paper is related to the literature on consensus dynamics [Olfati-Saber et al., 2007, Ren and Beard, 2008, Bullo et al., 2009b, Mesbahi and Egerstedt, 2010].”
BackgroundCooperative control of linear parameter-varying systems
Seyboth, G. S., Schmidt, G., & Allgöwer, F. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314912 · Cited by 28
“There is a steadily increasing interest in a cooperative control theory, providing analysis and design tools for distributed control of multi-agent systems [1]–[3].”
BackgroundTrust-based interactions in teams of mobile agents
Setter, T., Gasparri, A., & Egerstedt, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526637 · Cited by 25
“, [8]), this could be directly encoded using the trusts as weights, as done in the DeGroot Model in [20], thus yielding the composite system ẋ1 = τ1(x2 − x1) ẋ2 = τ2(x1 − x2) τ̇1 = τ2(x1 − x2)(2) τ̇2 = τ1(x1 − x2)(2), (1) which we note, due to the presence of square terms, is not globally Lipschitz, i.”
MethodSelf-citationLag‐bipartite consensus of linear multiagent systems under saturating input over signed graph
Bhowmick, S., & Panja, S. (2018) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.5223 · Cited by 26
“The interaction between the agents are represented by graphs [48].”
BackgroundEpidemic Forest: A Spatiotemporal Model for Communicable Diseases
Li, M., Shi, X., Li, X., Ma, W., He, J., & Liu, T. (2019) · Annals of the American Association of Geographers · doi:10.1080/24694452.2018.1511413 · Cited by 26
“Structural Information In terms of graph theory, an epidemic tree is a directed rooted tree (Williamson 1985; Mesbahi and Egerstedt 2010), for which we can use certain indexes to quantitatively characterize the tree’s structural properties (Karl and Danscoine 1989) to obtain knowledge about the…”
MethodConsensus of Heterogeneous Nonlinear Multiagent Systems With Duplex Control Laws
Yang, S., Wang, J., & Liu, Q. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2912533 · Cited by 26
“Some useful properties of the Laplacian matrix are summarized as below [29].”
BackgroundNetwork flows that solve least squares for linear equations
Liu, Y., Lou, Y., Anderson, B. D. O., & Shi, G. (2020) · Automatica · doi:10.1016/j.automatica.2020.109108 · Cited by 28
“In some cases, however, due to the comparatively weak computing power of any one agent or its limited access to the parameters and measurement data relevant to the whole problem, the notion of distributed computation over networks has been developed [6,13,14,21,25,26].”
BackgroundDritsas, L. D., Kontouras, E., Vlahakis, E. E., Kitsios, I., Halikias, G. D., & Tzes, A. P. (2020) · International Journal of Control · doi:10.1080/00207179.2020.1821248 · Cited by 26
“This is a sufficient condition that guarantees that GLM has a single eigenvalue at the origin (Mesbahi & Egerstedt, 2010).”
BackgroundInfluentialStability and power sharing in microgrids
Schiffer, J. (2015) · DepositOnce · doi:10.14279/depositonce-4581 · Cited by 29
“G is called strongly connected if for all i ∈ V and k ∈ V, there exists a path from i to k [141].”
BackgroundMatveev, A. S., Novinitsyn, I., & Proskurnikov, A. V. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669764 · Cited by 26
“The major research techniques include the use of relevant algebraic results [10], [13], [18] on convergence of infinite matrix products and Lyapunovlike methods [1], [3], [9], [11], [12], [20] based on shrinking properties of the convex hull of the agents states.”
BackgroundMethodDistributed iterative learning control for a team of quadrotors
Hock, A., & Schoellig, A. P. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798976 · Cited by 26
“For further information about graph theory, see [12].”
BackgroundControllability and stabilizability analysis of signed consensus networks
Alemzadeh, S., de Badyn, M. H., & Mesbahi, M. (2017) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2017.8062440 · Cited by 27
“A large amount of research has been dedicated to looking at the control of consensus [13].”
BackgroundInfluentialSelf-citationDilip, A. S. A. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2919278 · Cited by 25
“With the continuous rise of networked control in the past few years, the optimal actuator and sensor placement problem has attracted a lot of attention [2]–[11], [26]–[29], [35]–[37].”
BackgroundEvent-triggered control of second-order nonlinear multi-agent systems with directed topology
Liu, Z., Zhang, A., Qiu, J., & Li, Z. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.03.118 · Cited by 26
Bagchi, S., Aggarwal, V., Chaterji, S., Douglis, F., Gamal, A. E., Han, J., Henz, B. J., Hoffmann, H., Jana, S., Kulkarni, M., et al. (2020) · IEEE Open Journal of the Computer Society · doi:10.1109/ojcs.2020.3006807 · Cited by 31
“[16], control [41], [36], [72] in multi-agent networks.”
Li, L., Gan, J. Y., Qu, X., Mao, P., Yi, Z., & Ran, B. (2021) · Applied Sciences · doi:10.3390/app11030958 · Cited by 25
“Assume that the importance of each edge is consistent with the degree matrix, with reference to the definition of the incidence matrix I, the Laplacian matrix L can also be expressed in the following variants [33]:”
BackgroundEnergy-Aware Controllability of Complex Networks
Baggio, G., Pasqualetti, F., & Zampieri, S. (2021) · Annual Review of Control Robotics and Autonomous Systems · doi:10.1146/annurev-control-042920-014957 · Cited by 35
Mousavi, A., Aryankia, K., & Šelmić, R. R. (2022) · European Journal of Control · doi:10.1016/j.ejcon.2022.100646 · Cited by 25
Gkesoulis, A. K., Psillakis, H. E., & Lagos, A.-R. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3179218 · Cited by 25
Compound matrices in systems and control theory: a tutorial
Bar-Shalom, E., Dalin, O., & Margaliot, M. (2023) · Mathematics of Control Signals and Systems · doi:10.1007/s00498-023-00351-8 · Cited by 25
“k-Contraction on Networks There is considerable interest in dynamical system over networks motivated in part by applications in multi-agent systems, the electric grid, neuroscience, epidemiology, and more [47], [37], [13].”
BackgroundA Network Flow Approach to Battery Electric Bus Scheduling
Whitaker, J., Droge, G. N., Hansen, M., et al. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3276269 · Cited by 25
“As defined in [25], the incidence matrix can be used to represent the vertices and edges in matrix form and is denoted as D.”
BackgroundSampled-data consensus for multi-agent systems with quantised communication
Wu, Y., & Wang, L. (2014) · International Journal of Control · doi:10.1080/00207179.2014.955532 · Cited by 25
“According to Mesbahi and Egerstedt (2010), if we arbitrarily orient all edges in G to obtain a digraph (cid:12) G , then the incidence matrix of graph G can be defined by Concerning the Laplacian matrix L , incidence matrix B and edge weight matrix W of an undirected graph G , it holds that L = BWB…”
BackgroundOn the zeros of consensus networks
Briegel, B., Zelazo, D., Bürger, M., et al. (2011) · doi:10.1109/cdc.2011.6161047 · Cited by 25
“An undirected graphG = (V , E) is defined by the vertex (or node) setV with n = |V| and the edge setE ⊆ V × V .”
BackgroundThree-dimensional multirobot formation control for target enclosing
Aranda, M., Nicolás, G. L., Sagüés, C., et al. (2014) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2014.6942584 · Cited by 25
“The target enclosing problem pertains to the generic field of multiagent formation control [1], a wide area of research which encompasses very diverse scenarios.”
BackgroundMethodIndex-Free Multi-agent Systems: An Eulerian Approach
Kingston, P., & Egerstedt, M. (2010) · IFAC Proceedings Volumes · doi:10.3182/20100913-2-fr-4014.00064 · Cited by 31
“Since L is positive semidefinite (see Mesbahi and Egerstedt (2010)), the eigenvalues of the closed-loop system matrix lie within the unit circle for sufficiently small γ (for all but the 1 eigenvector, whose eigenvalue is exactly 1), e.g. γ = 1 2 ||L||2, and so the system is stable.”
BackgroundSelf-citationDynamic Feedback Synchronization of Lur'e Networks via Incremental Sector Boundedness
Zhang, F., Trentelman, H. L., & Scherpen, J. M. A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2494840 · Cited by 25
“The relevant algebraic graph theory and particularly the concepts of adjacency matrix and Laplacian matrix can be found in [11].”
BackgroundA distributed solution to the network reconstruction problem
Morbidi, F., & Kibangou, A. Y. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.05.008 · Cited by 24
“If the step size ς ∈ (0 , 1) satisfies the condition 1 ς 2 /λ n ( L ), cf. [ 22, Lemma 8.1], then lim (cid:7) (cid:7) , and node i asymptotically obtains an estimate x ( i ) of vector x at time k according to: (cid:15) Node i can then compute its local estimate (cid:15) (cid:15) (cid:15) and…”
InfluentialLeader selection via the manipulability of leader-follower networks
Kawashima, H., & Egerstedt, M. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315183 · Cited by 24
“, [1]), which enables agents to achieve a distance-based formation control.”
BackgroundInfluentialSelf-citationIdentification of sparse communication graphs in consensus networks
Lin, F., Fardad, M., & Jovanović, M. R. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483203 · Cited by 24
“However, using only relative information exchange (1), the control input u does not stabilize the average mode [4]”
BackgroundObservability and reachability of grid graphs via reduction and symmetries
Notarstefano, G., & Parlangeli, G. (2011) · doi:10.1109/cdc.2011.6161286 · Cited by 24
“We assume that the agents communicate according to a time-invariant undirected communication graph G = (I, E), where E = {(i, j) ∈ I × I | i and j communicate}.”
BackgroundSoares, J. M., Marjovi, A., Giezendanner, J., Kodiyan, A., Aguiar, A. P., Pascoal, A., & Martinoli, A. (2016) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2016.7759277 · Cited by 24
“Built upon basic linear algebra, a stable solution to the formation control problem in two dimensions [34] is given by”
BackgroundFormation Control With Multiplex Information Networks
Tran, D. M., Yucelen, T., & Pasiliao, E. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2018.2884234 · Cited by 25
“In this section, we use tools and methods from differential potential fields (see [1], [23], [24], [36], [37], and references therein) and generalize the results of Section IV-A to allow connectivity maintenance and collision avoidance that is needed in real-world applications.”
BackgroundMethodInfluentialAllocation of Excitation Signals for Generic Identifiability of Linear Dynamic Networks
Cheng, X., Shi, S., & den Hof, P. M. J. V. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3053540 · Cited by 24
“D YNAMIC networks adequately describe a wide class of complex engineering systems appearing in various applications, including multirobot coordination, power grids, and biochemical networks, see [1] for an overview.”
BackgroundMethodTime-Difference-of-Arrival (TDOA)-Based Distributed Target Localization by A Robotic Network
Ennasr, O. N., & Tan, X. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.2979864 · Cited by 27
“We first note the following property regarding the powers of the matrix W from [26].”
BackgroundAhmed, Z., Saeed, M. A., Jenabzadeh, A., et al. (2020) · ISA Transactions · doi:10.1016/j.isatra.2020.11.014 · Cited by 24
Passive Multiuser Teleoperation of a Multirobot System With Connectivity-Preserving Containment
Yang, Y., Constantinescu, D., & Shi, Y. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3086685 · Cited by 24
Cominelli, S., Quadrelli, D. E., Sinigaglia, C., & Braghin, F. (2022) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2021.0750 · Cited by 24
Tran, Q. V., & Kim, J. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3159128 · Cited by 24
“For a connected graph G, we have rank(H(G)) = n−1 and H(G)1n = 0 [20].”
BackgroundQuadratic Programming for Continuous Control of Safety-Critical Multiagent Systems Under Uncertainty
Wu, S., Liu, T., Egerstedt, M., & Jiang, Z. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3244745 · Cited by 35
“This has been one of the most attractive topics in the interdisciplinary literature of controls and robotics in the past decades [1], [2], [3], [4], [5], [6], [7], [8].”
BackgroundSelf-citationDistributed Data-Driven Predictive Control for Multi-Agent Collaborative Legged Locomotion
Fawcett, R. T., Amanzadeh, L., Kim, J., Ames, A. D., & Hamed, K. A. (2023) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48891.2023.10160914 · Cited by 27
“However, when considering many agents, the system is usually high-dimensional, which also motivates distributed approaches [8]–[10].”
BackgroundResilient consensus of double-integrator multi-agent systems
Dibaji, S. M., & Ishii, H. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859500 · Cited by 26
“The objective in consensus is agreement on some state values within the collection of agents [8, 10].”
BackgroundStability analysis of diagonally equipotent matrices
Altafini, C. (2013) · Automatica · doi:10.1016/j.automatica.2013.05.016 · Cited by 24
“This obviously means R i = C i , i = 1, . . . , n, a property which is called weight balance of Γ(A) in Altafini (2013); Gharesifard & Cortés (2009) (and is called simply " balanced " in the rest of the literature on distributed consensus problems, see Mesbahi & Egerstedt (2010); Ren et al. (2007)).”
Extended multi-agent consensus protocols for the generation of geometric patterns in the plane
Tsiotras, P., & Castro, L. I. R. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990927 · Cited by 24
“It can be easily shown [5] that the control law ~u1 =−γ1~r12, ~u2 =−γ2~r21, γ1 + γ2 > 0 (2) achieves consensus.”
BackgroundMethodInfluentialAsynchronous Distributed Blind Calibration of Sensor Networks Under Noisy Measurements
Stanković, M. S., Stankovic, S. S., & Johansson, K. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2633788 · Cited by 27
Tracking a mobile target by multi-robot circumnavigation using bearing measurements
Boccia, A., Adaldo, A., Dimarogonas, D. V., et al. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263800 · Cited by 24
“17 in [19], the homogeneous form of (37), ̇̃ β(t) = −kφLβ̃(t), is exponentially stable.”
BackgroundDecentralized Switched Current Control for DC Microgrids
Mojica‐Nava, E., Rey, J. M., Torres-Martínez, J., et al. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2018.2833020 · Cited by 24
“Using the transformation xe(t) = D(G) x(t) [29], the edge agreement protocol can be obtained from the weighted Laplacian as follows:”
Hierarchical reinforcement learning via dynamic subspace search for multi-agent planning
Ma, A., Ouimet, M., & Cortés, J. (2019) · Autonomous Robots · doi:10.1007/s10514-019-09871-2 · Cited by 31
Optimized transit planning and landing of aerial robotic swarms
Dono, T. F., & Chung, T. H. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6630820 · Cited by 23
“The relationship between the centralized network optimization problem and the decentralized stability and robustness of flocking algorithms [16], graph-theoretic coordination algorithms [17] , and other distributed multi-agent algorithms remains an active open area of research.”
BackgroundDistributed Control of Active–Passive Networked Multiagent Systems
Yucelen, T., & Peterson, J. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2545521 · Cited by 22
“Lemma 2 [1]: Let K = diag(k), k = [k1, k2, .”
BackgroundInfluentialRobust Distance-Based Formation Control of Multiple Rigid Bodies with Orientation Alignment
Nikou, A., Verginis, C. K., & Dimarogonas, D. V. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2104 · Cited by 26
“By considering a numbering k ∈ M = { 1 , ..., M } of the graph’s edge set, we define the N × M incidence matrix D ( G ) as it was given in [Mesbahi and Egerstedt, 2010].”
MethodIdentifiability of Undirected Dynamical Networks: A Graph-Theoretic Approach
van Waarde, H. J., Tesi, P., & Camlibel, M. K. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2846630 · Cited by 23
Indiscernible topological variations in DAE networks
Patil, D. U., Tesi, P., & Trenn, S. (2019) · Automatica · doi:10.1016/j.automatica.2018.12.012 · Cited by 23
“Moreover, for several fundamental graphs such as complete, star and grid graphs an analytical characterization of the eigenspaces is available (Mesbahi and Egerstedt, 2010, Section 2.4).”
MethodInfluentialSecure Distributed Filtering for Unstable Dynamics Under Compromised Observations
He, X., Ren, X., Sandberg, H., et al. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029701 · Cited by 23
Finite‐time distributed control with time transformation
Arabi, E., Yucelen, T., & Singler, J. R. (2020) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5264 · Cited by 23
“To address formation control, one can use a change of variable z i ( t ) = x i ( t ) − 𝜁 i , i ∈ { 1 , 2 , … , N } , where 𝜁 i ∈ R , i ∈ { 1 , 2 , … , N } denotes the desired distance from the leader in the formation of the multiagent system [ 2, section 6.3].”
BackgroundInfluentialWang, B., Ashrafiuon, H., & Nersesov, S. G. (2021) · Systems & Control Letters · doi:10.1016/j.sysconle.2021.105008 · Cited by 24
Free‐will arbitrary time consensus protocols with diffusive coupling
Tran, Q. V., Trinh, M. H., Nguyen, N. H., et al. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6267 · Cited by 23
“2 Formation control protocol Consider a system of four mobile robots in R2 whose local interaction is described by a ring graph = ( , ) with the agent index set = {1, 2, 3, 4} and the edge set = {(1, 2), (2, 3), (3, 4), (4, 1)}.”
AGDS: adaptive goal-directed strategy for swarm drones flying through unknown environments
Wang, F., Huang, J., Low, K. H., Nie, Z., & Hu, T. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00900-9 · Cited by 24
“Communication network between drones To describe the model of the drone swarm in mathematical language, we use an undirected graph [41] G(t) = (V, E(t)) to establish the communication network among N drones, where V = {v1, v2, .”
MethodEnhanced multi-agent systems formation and obstacle avoidance (EMAFOA) control algorithm
Aljassani, A. M. H., Ghani, S. N., & Al-Hajjar, A. M. H. (2023) · Results in Engineering · doi:10.1016/j.rineng.2023.101151 · Cited by 23
Deploying Robots With Two Sensors in K1, 6‐Free Graphs
Abbas, W., Egerstedt, M., Liu, C., et al. (2015) · Journal of Graph Theory · doi:10.1002/jgt.21898 · Cited by 23
“If G is a graph, f : V (G) → [5](2), and v ∈ V (G), then we say that v is satisfied with respect to f if ⋃ u∈N [v] f(u) = {1, 2, 3, 4, 5}.”
BackgroundMethodInfluentialSelf-citationOn aggregate control of clustered consensus networks
Boker, A., Nudell, T. R., & Chakrabortty, A. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7172204 · Cited by 23
“Finally, we prove that by combining the solutions of the two subproblems in one composite control and applying it to the actual model, we achieve a closed-loop performance that is close to the desired response provided that the clustering is strong.”
MethodDistributed formation control of fixed wing micro aerial vehicles for area coverage
Varga, M., Basiri, M., Heitz, G., et al. (2015) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7353444 · Cited by 23
“Based on the position of the neighboring MAVs and their respective virtual agents, each MAV can determine the phase of its neighbors and compute the change on its forward speed to synchronize the phase angle θ [15] by: where K sync is a tunable parameter that determines the speed of synchronization.”
BackgroundHuang, J., Chen, J., Fang, H., & Dou, L. (2015) · Journal of Control and Decision · doi:10.1080/23307706.2015.1004803 · Cited by 23
Singular surfaces in multi-agent connectivity maintenance games
Bhattacharya, S., Başar, T., & Hovakimyan, N. (2011) · doi:10.1109/cdc.2011.6160247 · Cited by 23
“Maintaining the connectivity of the underlying communication network in a team seems to be an essential requirement for the convergence and stability of various control laws that have been proposed for accomplishing tasks related to consensus and flocking [18], [16].”
BackgroundMulti‐agent adaptive consensus of networked systems on directed graphs
Radenković, M. S., & Tadi, M. (2015) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.2577 · Cited by 23
“Extensive list of references on the earlier subjects can be found in survey papers [1–4], as well as recent research monographs [5–7].”
BackgroundOn the estimation of the consensus rate of convergence in graphs with persistent interconnections
Chowdhury, N. R., Sukumar, S., Maghenem, M. A., et al. (2016) · International Journal of Control · doi:10.1080/00207179.2016.1272006 · Cited by 23
“We show now that, by applying the edge-agreement protocol (Mesbahi & Egerstedt, 2010), the consensus problem for networks of second-order systems may also be (mainly) recasted into the study of Equation (15).”
MethodInfluentialFast Consensus in Multi-Agent Systems With Star Topology Using High Gain Observers
Chowdhury, D., & Khalil, H. K. (2017) · IEEE Control Systems Letters · doi:10.1109/lcsys.2017.2712565 · Cited by 22
“The reader is referred to the survey papers [10] and [11], and to the book [12] for an exhaustive material of the consensus problems in multi-agent systems.”
BackgroundTime-Scale Separation in Networks: State-Dependent Graphs and Consensus Tracking
Awad, A., Chapman, A., Schoof, E., et al. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2800401 · Cited by 23
“An attraction of these dynamics is that all agents converge to the consensus subspace Xc = {y ∈ R | y1(t) = · · · = yn (t)} when G is a connected graph [4].”
BackgroundInfluentialSelf-citationVisual Coverage Control for Teams of Quadcopters via Control Barrier Functions
Funada, R., Santos, M. C. D. S., Yamauchi, J., et al. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8793477 · Cited by 23
“Analogously to other works in sensor networks which use triangulations [28], [29], we concern ourselves with triangular subgraphs [30] of the graph G(p).”
BackgroundSelf-citationChapman, A., & Mesbahi, M. (2011) · doi:10.1109/cdc.2011.6161471 · Cited by 23
Self-citationFinite-time distributed localization and multi-orbit circumnavigation with bearing-only measurements
Ma, Z., Li, Y., Qi, G., et al. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.04.012 · Cited by 22
(Non-)Bayesian learning without recall
Rahimian, M. A., Molavi, P., & Jadbabaie, A. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7040286 · Cited by 22
“The problem of social learning has close siblings in the statistical learning theory [3], and is also related to the problems of consensus and coordination that appear in the distributed control literature [4], [5].”
BackgroundBelleter, D. J. W., & Pettersen, K. Y. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7040095 · Cited by 22
“it has n globally reachable vertices- then the zero eigenvalue is simple and L is symmetric and positive semi-definite (see [28], [29]).”
BackgroundMethodA distributed local Kalman consensus filter for traffic estimation
Sun, Y., & Work, D. B. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7040406 · Cited by 22
“Research on collaborative information processing is driven by the broad applications of multi-agent systems [19]– [22].”
BackgroundMulti-robot manipulation controlled by a human with haptic feedback
Sieber, D., Musić, S., & Hirche, S. (2015) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7353708 · Cited by 22
“Since A is always regular [13], α = −1 and b = 1.”
BackgroundInfluentialSynchronization of multi-agent systems with heterogeneous controllers
Jain, A., & Ghose, D. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-017-3526-x · Cited by 23
“Furthermore, the control algorithms proposed in this paperr decentralized, and there is no centralized information available to the agents which lead them to synchronize at a desired velocity direction.”
BackgroundCoherence and convergence rate in networked dynamical systems
Pirani, M., Shahrivar, E. M., & Sundaram, S. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7401998 · Cited by 22
“Noting that L̄ is the Laplacian matrix for an Erdos-Renyi random graph on n − |S| nodes with constant p, for n − |S| = Ω(n) we have (1− o(1))(n− |S|)p ≤ λ2(L̄) ≤ (1 + o(1))(n − |S|)p and (1 − o(1))(n − |S|)p ≤ λn−|S|(L̄) ≤ (1+o(1))(n−|S|)p asymptotically almost surely [22].”
Multi-agent coordination with asynchronous cloud access
Nowzari, C., & Pappas, G. J. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526085 · Cited by 23
“Regarding multi-agent coordination, there is a considerable amount of available literature, see e.g., [14], [15], [16].”
BackgroundLlátser, I., Jornod, G., Festag, A., Mansolino, D., Navarro, I., & Martinoli, A. (2017) · IEEE Intelligent Vehicles Symposium · doi:10.1109/ivs.2017.7995979 · Cited by 21
“The distributed graph-based algorithm is based on Laplacian control [16].”
MethodMotion Feasibility Conditions for Multiagent Control Systems on Lie Groups
Colombo, L. J., & Dimarogonas, D. V. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2925264 · Cited by 22
“Decentralized control strategies for multiple vehicles have gained increased attention in the last decades in the control community [4], [14], [16].”
BackgroundIbuki, T., Wilson, S., Ames, A. D., & Egerstedt, M. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2997952 · Cited by 24
Self-citationLang, X., & de Ruiter, A. H. J. (2020) · Aerospace Science and Technology · doi:10.1016/j.ast.2020.106173 · Cited by 22
Shen, J., Kammara, E. K. H., & Du, L. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3175668 · Cited by 22
“Supported by portable computing capability of each vehicle and vehicle-to-vehicle (V2V) communication [34], distributed computation can handle high computation load efficiently, is more flexible to communication network topologies, and is more robust to communication delays or network malfunctions [19, 34].”
MethodEvent‐triggered control for discrete‐time multi‐agent average consensus
Mishra, R. K., & Ishii, H. (2021) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5815 · Cited by 26
“Using this relation in (26), we have ∇V ≤ −1 2 ( ε − 2ε(2)dmax ) xT(k)Lx(k) + σmax(k)N M ( 1 + ||L||1 − 2εdmax 2dmin ) + [ ||L||(1 − 2εdmax) + 2dmax 2 mini θidi ] ∑”
Active Synchronization for Double-Integrator Network Systems Without Velocity Information
Zhang, W., Zuo, Z., & Wang, Y. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3151310 · Cited by 24
“[8]) and tracking reference signal (cf.”
BackgroundInfluentialLeader-Follower Formation of Unicycle Mobile Robots Using Sliding Mode Control
Díaz, Y., Davila, J. A., & Mera, M. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3227578 · Cited by 22
“The adjacency matrix A associated to the graph G is the n×n symmetric matrix whose elements are defined as aij = 1 if (i, j) ∈ E , otherwise aij = 0, note that aii = 0, [18].”
BackgroundMulti-agent consensus under a communication–broadcast mixed environment
Azuma, S., Tanaka, Y., & Sugie, T. (2013) · International Journal of Control · doi:10.1080/00207179.2013.868608 · Cited by 22
“A number of re-sults have been obtained for these types of problems (see, e.g. Abdallah & Tanner, 2007; Martinez, Cort´es, & Bullo, 2007; Mesbahi & Egerstedt, 2010; Olfati-Saber, Fax, & Murray, 2007; Sundaram & Hadjicostis, 2008, and references therein).”
BackgroundControllability and Observability of Cartesian Product Networks
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_7 · Cited by 22
Distributed cooperative object attitude manipulation
Markdahl, J., Karayiannidis, Y., Hu, X., & Kragić, D. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6224665 · Cited by 23
“which is a standard result in rigid graph based formation control [8].”
BackgroundLaplacian dynamics on signed networks
Pan, L., Shao, H., & Mesbahi, M. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798380 · Cited by 22
“Consensus is an important prototype for disciplines ranging from distributed algorithms [1], [2], synchronization of oscillators [3], and multi-agent coordination [4].”
BackgroundSelf-citationRobot Swarms Theory Applicable to Seek and Rescue Operation
León, J. A. F., Cardona, G. A., Botello, A. R., et al. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-53480-0_104 · Cited by 22
“We can represent the swarm of bees with the help of graph theory with the application of the concepts worked by Mesbahi in [10].”
MethodRound-table negotiation for fast restoration of connectivity in partitioned wireless sensor networks
Shriwastav, S., & Ghose, D. (2018) · Ad Hoc Networks · doi:10.1016/j.adhoc.2018.04.008 · Cited by 22
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.