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 801–900 of 2,960
Learning multi-agent coordination through connectivity-driven communication
Pesce, E., & Montana, G. (2022) · Machine Learning · doi:10.1007/s10994-022-06286-6 · Cited by 33
“Three of them are commonly used swarm robotic benchmarks: Navigation Control , Formation Control and Line Control [89–91].”
Adaptive Backstepping Multi-Agent Control of Multiple UAVs Conveying Load: A Graph Rigidity Approach
Ferik, S. E., & Aliyu, A. (2023) · IEEE Access · doi:10.1109/access.2023.3283579 · Cited by 17
Synchronization of diverse agents via phase analysis
Wang, D., Chen, W., & Qiu, L. (2023) · Automatica · doi:10.1016/j.automatica.2023.111325 · Cited by 14
Wang, H., Zhang, N., Liu, X., et al. (2024) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2024.3393006 · Cited by 14
Differentially private average consensus with improved accuracy-privacy trade-off
Wang, L., Liu, W., Guo, F., et al. (2024) · Automatica · doi:10.1016/j.automatica.2024.111769 · Cited by 14
Grandi, R., Falconi, R., & Melchiorri, C. (2013) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio.2013.6739681 · Cited by 14
System Theoretic Aspects of Influenced Consensus: Single Input Case
Chapman, A., & Mesbahi, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2179345 · Cited by 14
“These additional agents, ignoring consensus rules, will influence the network as compared to the unforced network, resulting in scenarios such as leader-follower [2], [5], and drift correction [6].”
BackgroundSelf-citationDistributed Power Allocation in Prosumer Networks
Ramachandran, T., Costello, Z., Kingston, P., Grijalva, S., & Egerstedt, M. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00051 · Cited by 14
“For more details on the convergence properties of ODEs involving graph Laplacian, see Mesbahi and Egerstedt [2010]. So, when q̇ = 0, we obtain p = Lq = N − αW−11 as expected.”
Self-citationDistributed Motion Estimation of Space Objects Using Dual Quaternions
Zu, Y., Lee, U., & Dai, R. (2014) · AIAA/AAS Astrodynamics Specialist Conference · doi:10.2514/6.2014-4296 · Cited by 14
Distributed optimization design based on passivity technique
Tang, Y., Hong, Y., & Yi, P. (2016) · International Conference on Control and Automation · doi:10.1109/icca.2016.7505365 · Cited by 14
“For this purpose, an undirected graph (see [27] for more details) G can be associated with these agents to describe the information flow among those nodes represented by M = {1, . . . , m}.”
BackgroundJongsma, H.-J., Mlinarić, P., Grundel, S., Benner, P., & Trentelman, H. L. (2018) · Mathematics of Control Signals and Systems · doi:10.1007/s00498-018-0212-6 · Cited by 13
“Then, since the property of having a directed spanning tree is equivalent with 0 being a simple eigenvalue of the Laplacian (see [21, Proposition 3.8]), the reduced order Laplacian ˆ L has again 0 as a simple eigenvalue.”
BackgroundMethodInfluentialTariq, M. U., Florence, J., & Wolf, M. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2744645 · Cited by 14
“This platform-aware feedback controller design step can leverage recent advances in CPS research (identified in Section II) that utilize the theoretical frameworks and techniques from the fields of hybrid systems [6], switched systems [7], time-delay systems [8], networked control systems [9], and multi-agent networke…”
BackgroundMethodTrajectory Optimization Using Sequential Convex Programming with Collision Avoidance
Ramalho, G. M., Carvalho, S. R., Finardi, E. C., & Moreno, U. F. (2018) · Journal of Control Automation and Electrical Systems · doi:10.1007/s40313-018-0377-8 · Cited by 14
“We suggest Mesbahi and Egerstedt (2010) for more details about consensus theory and its convergence conditions.”
BackgroundMulti-objective Policy Generation for Multi-robot Systems Using Riemannian Motion Policies
Li, A., Mukadam, M., Egerstedt, M., et al. (2022) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-95459-8_16 · Cited by 14
“forming a certain shape, covering an area of interest, or meeting at a common location [7, 16].”
BackgroundInfluentialSelf-citationLiu, Z., Nojavanzadeh, D., Saberi, A., et al. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3172567 · Cited by 14
Strong Structural Controllability of Networked Dynamics
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_8 · Cited by 14
Stability analysis of nonlinear networks via M-matrix theory: Beyond linear consensus
Chapman, A., & Mesbahi, M. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315625 · Cited by 14
“An example is the discretization of diffusion [4] and advection [7] dynamics which generate the in-degree and out-degree Laplacian matrix respectively, and both of which are M-matrices.”
BackgroundSelf-citationNecessary conditions for controllability of nonlinear networked control systems
Aguilar, C. O., & Gharesifard, B. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859170 · Cited by 14
“Examples include distributed energy resources, oscillator synchronization, and distributed robotic networks, see [1], [2], [3] and also cascades of information and opinions in social networks [4].”
Controllability of homogeneous single-leader networks
Twu, P., Egerstedt, M., & Martini, S. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5718103 · Cited by 14
“Before stating this result, we must first review some definitions from [10], [12], and [13].”
BackgroundSelf-citationCooperative active target tracking for heterogeneous robots with application to gait monitoring
Morbidi, F., Ray, C. T., & Mariottini, G. L. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094579 · Cited by 14
“Multi-agent systems and cooperative control have been the subject of intense research activity in recent years [3].”
Tang, Y. (2016) · International Journal of Systems Science · doi:10.1080/00207721.2015.1135360 · Cited by 15
“A weighted directed graph (or weighted digraph) G = (N , E,A) is defined as follows, where N = {1, . . ., n} is the set of nodes, E ⊂ N × N is the set of edges, and A ∈ Rn×n is a weighted adjacency matrix (Mesbahi & Egerstedt, 2010).”
BackgroundTransporting an elastic plate using a group of swarm mobile robots
Ardakani, E. S., Ebel, H., & Eberhard, P. (2017) · IEEE International Conference on Advanced Intelligent Mechatronics (AIM) · doi:10.1109/aim.2017.8014213 · Cited by 14
“To circumvent this problem, various approaches can be considered such as the leader-follower approaches [10], [11], artificial potential fields [12], behavioural and virtual structures [13], [14], graph theory [3], [15] and consensus based approaches [16].”
BackgroundDeVries, L., Sims, A. M., & Kutzer, M. D. M. (2018) · Robotica · doi:10.1017/s0263574718000231 · Cited by 15
“[16] and [15] incorporate a bias vector corresponding to the desired agent distance from the centroid of agent states.”
BackgroundStructural balance of multiplex signed networks: A distributed data-driven approach
Pan, L., Shao, H., Mesbahi, M., Li, D., & Xi, Y. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.05.101 · Cited by 14
Self-citationSchillinger, P., Bürger, M., & Dimarogonas, D. V. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8462967 · Cited by 23
“Furthermore, we employ in this paper the following two standard definitions from graph theory [17].”
MethodVoronoi-Based Deployment of Multi-Agent Systems
Hatleskog, J., Olaru, S., & Hovd, M. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619832 · Cited by 14
“For multi-agent systems, it is typically motivated by concerns related to scalability, fault tolerance, limited communication capabilities, range-limited sensing capabilities and scarceness of computational resources [Mesbahi and Egerstedt, 2010; Ren and Beard, 2008].”
BackgroundMethodInfluentialTop-Down Synthesis of Multiagent Formation Control: An Eigenstructure Assignment Based Approach
Motoyama, T., & Cai, K. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2890980 · Cited by 14
“C OOPERATIVE control of multiagent systems has been an active research area in the systems control community [1]–[5].”
BackgroundPeterson, J., Yucelen, T., Jagannathan, S., & Pasiliao, E. (2019) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2896534 · Cited by 14
“In addition, system theoretic methods can naturally provide a level of robustness against modeling errors, changes in information paths, and measurement noise [4], [5].”
BackgroundMethodNonlinear observability via Koopman Analysis: Characterizing the role of symmetry
Mesbahi, A., Bu, J., & Mesbahi, M. (2020) · Automatica · doi:10.1016/j.automatica.2020.109353 · Cited by 17
Self-citationPointing Consensus and Bearing-Based Solutions to the Fermat–Weber Location Problem
Trinh, M. H., Zelazo, D., & Ahn, H. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2927932 · Cited by 14
“Given n agents having different initial state values, by exchanging and updating the states based on the weighted sum of differences, all agents’ states eventually reach the same value [1], [2].”
BackgroundDistributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3216286 · Cited by 17
“A number of works in the literature have proposed distributed coordination algorithms for MAS, such as those considering asynchronous sampling and nonidentical packet loss [5], nonlinear agent dynamics with position feedback [6], and with transmission constraints and noise [7], [8].”
BackgroundInfluentialCharacterizing the structure of halo merger trees using a single parameter: the tree entropy
Obreschkow, D., Elahi, P. J., Lagos, C. D. P., Poulton, R. J. J., & Ludlow, A. D. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa445 · Cited by 13
Clone Swarms: Learning to Predict and Control Multi-Robot Systems by Imitation
Zhou, S., Phielipp, M. J., Sefair, J. A., Walker, S. I., & Amor, H. B. (2019) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8967824 · Cited by 20
“Among the formalisms most widely used for representing and studying MRS and swarms are graphtheoretic [8] approaches and methods based on cost functions and auctioning processes [2].”
MethodSecond Order Consensus for Leader-follower Multi-agent Systems with Prescribed Performance
Chen, F., & Dimarogonas, D. V. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.136 · Cited by 14
“An undirected graph (Mesbahi and Egerstedt, 2010) is de-fined as G = ( V , E ) with the vertices set V = { 1 , 2 , . . . , n } and the edges set .”
BackgroundDiversity of Structural Controllability of Complex Networks With Given Degree Sequence
Ghasemi, A., Pósfai, M., & D’Souza, R. M. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.2977672 · Cited by 14
Structural Controllability of Undirected Diffusive Networks With Vector-Weighted Edges
Zhang, Y., Xia, Y., Gao, H. C., et al. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2986250 · Cited by 14
“This is because the diffusive coupling mechanism frequently arises naturally in thermal systems, power systems, car-following traffic systems, as well as opinion propagations in social networks (see examples in [3, 4]).”
BackgroundInfluentialOptimal design of observable multi-agent networks: A structural system approach
Pequito, S., Rego, F., Kar, S., et al. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862577 · Cited by 14
“Its applications span a wide spectrum of activities that include field surveillance, environmental studies, and remote geophysical exploration; see [1], [2] and the references therein.”
BackgroundTime delay compensation based on Smith Predictor in multiagent formation control
González, A., Aranda, M., Nicolás, G. L., & Sagüés, C. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1667 · Cited by 14
“This paper is focused on the specific case of controlling the agents to a desired geometric configuration (Mesbahi and Egerstedt (2010); Oh et al. (2015)).”
BackgroundModel Reduction of Networked Multiagent Systems by Cycle Removal
Jongsma, H.-J., Trentelman, H. L., & Camlibel, M. K. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2731900 · Cited by 12
“2731900 of the Laplacian matrix, see [1] and [2].”
BackgroundZhou, T., Liu, Q., & Wang, W. (2023) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7159 · Cited by 13
Aryankia, K., & Šelmić, R. R. (2024) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2024.3356810 · Cited by 13
Resilient Average Consensus With Adversaries via Distributed Detection and Recovery
Yuan, L., & Ishii, H. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3426387 · Cited by 26
“D ISTRIBUTED consensus in multi-agent systems is a fundamental and well-studied topic across different research areas including systems control, computer science, and communication [1]–[4].”
BackgroundTan, X., Liu, C., Johansson, K. H., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3539332 · Cited by 13
“We call the communication graph G = ( I , E ) is consistent with the m th constraint if the induced subgraph [20] G m := ( I m , E m ) is connected, where ( i, j ) ∈ E m if and only if i, j ∈ I m and ( i, j ) ∈ E .”
InfluentialFormation control of non-holonomic agents with collision avoidance
Barogh, S. A., Rosero, E., & Werner, H. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170825 · Cited by 15
“PRELIMINARIES In this section some concepts from graph theory [20] are reviewed.”
BackgroundModel reduction of multi-input dynamical networks based on clusterwise controllability
Ishizaki, T., Kashima, K., Imura, J., et al. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314893 · Cited by 13
“Examples of such dynamical networks include World-WideWeb, gene regulatory networks, spread of infection; see [1], [2], [3], [4] for an overview.”
BackgroundHomogeneous Auxin Steady States and Spontaneous Oscillations in Flux-Based Auxin Transport Models
Farcot, E., & Yuan, Y. (2013) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/120891538 · Cited by 16
“Since an increasing number of techniques are currently being developed to study complex dynamical systems using graph theoretic tools [16], a promising direction for future work would be to investigate more thoroughly the potential benefits of graph theoretic techniques to study active transport of auxin, both for con…”
BackgroundAverage consensus on arbitrary strongly connected digraphs with dynamic topologies
Cai, K., & Ishii, H. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314712 · Cited by 15
“This result extends [1], [2] in that it does not require the " balanced " property [5] on the network topology which can be restrictive as every agent needs to maintain exactly equal amounts for incoming and outgoing information.”
BackgroundAdaptive Neuro-Fuzzy Formation Control for Leader-Follower Mobile Robots
Lin, H.-W., Chan, W.-S., Chang, Y., & Yang, C.-Y. (2013) · International Journal of Fuzzy Systems · Cited by 13
Road-following formation control of autonomous ground vehicles
Ono, M., Droge, G. N., Grip, H. F., Toupet, O., Scrapper, C., & Rahmani, A. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402954 · Cited by 15
“Also note that ds dt = Dxs and dr ds = Dxr where D = [ 0 1 ] .”
BackgroundTowards a systematic solution for differential games with limited communication
Mylvaganam, T., & Astolfi, A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525507 · Cited by 13
“This graph theoretical approach is similar to what is commonly done when dealing with multi-agent systems with limited communications [25].”
BackgroundResultPolarization in coopetitive networks of heterogeneous nonlinear agents
Proskurnikov, A. V., & Cao, M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799334 · Cited by 13
“in recent monographs [3]–[5] and references therein.”
Rezaei, V., & Stefanovic, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963359 · Cited by 13
Constructing a controllable graph under edge constraints
Hsu, S. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.07.015 · Cited by 13
“The systems are in various forms of networks that connect smaller subsystems, known as agents, to accomplish pre-specified tasks cooperatively [1,2].”
BackgroundDecentralised attitude synchronisation of multiple rigid bodies on lie group SO (3)
Ghasemi, K., Ghaisari, J., & Pouryayevali, M. R. (2017) · IET Control Theory and Applications · doi:10.1049/iet-cta.2017.0910 · Cited by 13
A doubly-augmented operator splitting approach for distributed GNE seeking over networks
Pavel, L. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619821 · Cited by 13
A dynamic game model of collective choice in multi-agent systems
Salhab, R., Malhamé, R. P., & Ny, J. L. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402913 · Cited by 12
Shahrampour, S., Rahimian, M. A., & Jadbabaie, A. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171178 · Cited by 13
“For instance, in distributed sensor and robotic networks, agents use local diffusion to augment their imperfect observations with information from their neighbors and achieve consensus and coordination [13], [14].”
BackgroundCoupled Control Systems: Periodic Orbit Generation With Application to Quadrupedal Locomotion
Ma, W.-L., Csomay-Shanklin, N., & Ames, A. D. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3006963 · Cited by 13
Multi-Robot Target Search using Probabilistic Consensus on Discrete Markov Chains
Shirsat, A., Elamvazhuthi, K., & Berman, S. (2020) · IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR) · doi:10.1109/ssrr50563.2020.9292589 · Cited by 13
Consensus Problems of Linear Multi-agent Systems involving Conformable Derivative
Yang, J. G., Fĕckan, M., & Wang, J. (2020) · Applied Mathematics and Computation · doi:10.1016/j.amc.2020.125809 · Cited by 13
Consensus in multi-agent systems subject to input saturation and time-varying delays
Silva, T. C., Souza, F. O., & Pimenta, L. C. A. (2020) · International Journal of Systems Science · doi:10.1080/00207721.2020.1860267 · Cited by 13
Consensus Stability of a Large-Scale Robotic Network Under Input and Transmission Delays
Fan, H., Ramírez, A., & Sipahi, R. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3124912 · Cited by 13
Distributed Quadratic Programming-Based Nonlinear Controllers for Periodic Gaits on Legged Robots
Kamidi, V. R., Kim, J., Fawcett, R. T., Ames, A. D., & Hamed, K. A. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3167795 · Cited by 14
Controllability and Accessibility on Graphs for Bilinear Systems Over Lie Groups
Wang, X., Li, B., Li, J.-S., et al. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3176431 · Cited by 13
“In the past decade, a new thriving line of research in control systems has involved the control of multiagent or networked systems, where subsystems are interconnected according to a graph representing the system interaction structure [20], [21], [24], [25].”
BackgroundNorm-free adaptive event-triggering rule for distributed control of multiagent systems
Kurtoglu, D., Yucelen, T., Ristevski, S., & Muse, J. A. (2022) · International Journal of Systems Science · doi:10.1080/00207721.2022.2145860 · Cited by 14
“From Mesbahi and Egerstedt (2010) and Godsil and Royle.”
BackgroundDistributed Data-Driven Control of Network Systems
Celi, F., Baggio, G., & Pasqualetti, F. (2023) · IEEE Open Journal of Control Systems · doi:10.1109/ojcsys.2023.3259228 · Cited by 13
“Networks and multi-agent systems have been studied extensively in the control community in the context of formation control [1], [2], consensus algorithms [3], and coordination of multi-agent systems [4], to cite a few.”
BackgroundTree-connectivity: Evaluating the graphical structure of SLAM
Khosoussi, K., Huang, S., & Dissanayake, G. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487264 · Cited by 13
“, [10]).”
Event- and self-triggered consensus for double-integrator networks with relative state measurements
Dai, M., & Xiao, F. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1500038 · Cited by 15
“Then we denote the incidence matrix by D (Horn & Johnson, 2012; Mesbahi & Egerstedt, 2010).”
MethodAccelerated Consensus with Linear Rate of Convergence
Bu, J., Fazel, M., & Mesbahi, M. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431817 · Cited by 13
“[12] Chapter 3 for details),”
Self-citationOn Performance of Time-Delay Linear Consensus Networks with Directed Interconnection Topologies
Dezfulian, S., Ghaedsharaf, Y., & Motee, N. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430769 · Cited by 13
“Eigenvalues of Laplacian matrix of any directed graph have non-negative real parts [17].”
BackgroundResilient Consensus Through Asynchronous Event-based Communication
Wang, Y., & Ishii, H. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815065 · Cited by 13
“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 [14].”
BackgroundCooperative Estimation of Road Condition Based on Dynamic Consensus and Vehicular Communication
Jalalmaab, M., Pirani, M., Fi̇dan, B., et al. (2018) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2018.2886679 · Cited by 13
“…necessary and sufficient conditions for convergence of the distributed estimates from all the nodes to the networks’ average estimate of θ ∗ for any initial set of θ i are [19], [27]: where 1 is the vector whose elements are all equal to 1, and ρ denotes the spectral radius of the matrix W cons .”
BackgroundLiu, Y., Wu, J., Manchester, I. R., & Shi, G. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619065 · Cited by 11
“The development of distributed control, optimization, and computation algorithms has become one of the central streams in the study of complex network operations, due to the rapidly growing volume and dimension of data and information flow from a variety of applications such as social networking, smart grid, and intel…”
BackgroundDistributed Stopping Criterion for Ratio Consensus
Prakash, M., Talukdar, S., Attree, S., et al. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8635839 · Cited by 13
“Here, the size of the systems presents severe restrictions in terms of computational resources, local communications and sensing capabilities [1].”
BackgroundOn Fast–Slow Consensus Networks with a Dynamic Weight
Jardón-Kojakhmetov, H., & Kuehn, C. (2020) · Journal of Nonlinear Science · doi:10.1007/s00332-020-09634-9 · Cited by 14
“This type of communication has been largely studied due to its relevance in all kinds of sciences [46, 64].”
BackgroundDistributed decision-making algorithms with multiple manipulative actors
Koorehdavoudi, K., Roy, S., Xue, M., et al. (2019) · Automatica · doi:10.1016/j.automatica.2019.05.063 · Cited by 13
Pandey, P. K., Adhikari, B., & Chakraborty, S. (2019) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2019.2936468 · Cited by 13
“Several information diffusion protocols have been introduced in the literature for various applications including multi-agent agreement and coordination, in which, a set of dynamic agents are connected via a network, known as multi-agent system (MAS) [5], [6].”
BackgroundResultInfluentialDistributed Multi-robot Circumnavigation with Dynamic Spacing and Time Delay
Lu, H., Yao, W., & Chen, L. (2019) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-019-01111-0 · Cited by 13
“Graph theory [8, 20] : A graph containing n nodes can be denoted by Node i of (cid”
BackgroundRandomized methods to characterize large-scale vortical flow networks
Bai, Z., Erichson, N. B., Meena, M. G., Taira, K., & Brunton, S. L. (2019) · PLoS ONE · doi:10.1371/journal.pone.0225265 · Cited by 12
“e graph. Network analysis provides a complementary perspective to classical techniques in fluid dynamics, especially for flow control. There have been many powerful advances in network control theory [22, 23] surrounding multi-agent systems [23, 24] in the past two decades. Multi-agent control is designed to be local,…”
BackgroundZhang, M., Saberi, A., & Stoorvogel, A. A. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3042752 · Cited by 13
“Regarding the fundamental information on the synchronization of a multi-agent system, please refer to [1], [2], [3], [4] and references therein.”
BackgroundResilient self/event-triggered consensus based on ternary control
Matsume, H., Wang, Y., & Ishii, H. (2021) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2021.101091 · Cited by 16
Adaptive dynamic surface control for fault-tolerant multi-robot systems
Chang, Y., Chan, W.-S., Yang, C.-Y., et al. (2013) · International Conference on System Science and Engineering · doi:10.1109/icsse.2013.6614696 · Cited by 13
“In communication graph, an edge of G is an ordered pair of distinct nodes (νj , νi) ∈ Ξ, where (νj , νi) denote the communication from jth agent to ith agent [19].”
BackgroundConvergence rate estimates for consensus over random graphs
Hale, M., & Egerstedt, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963087 · Cited by 13
“More details on this theorem can be found in [11], where its proof originally appeared, and in [16].”
BackgroundMethodInfluentialSelf-citationRobust cooperative output regulation of heterogeneous Lur'e networks
Zhang, F., Trentelman, H. L., & Scherpen, J. M. A. (2016) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3725 · Cited by 13
“The relevant algebraic graph theory and particularly the concepts of adjacency matrix and Laplacian matrix can be found in [3].”
BackgroundChang, T.-K., & Mehta, A. M. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2844734 · Cited by 13
“Complete treatment of graph theory on multiagent systems can be found in [16].”
BackgroundEfficient Algorithms for Optimal Perimeter Guarding
Feng, S. W., Han, S. D., Gao, K., & Yu, J. (2019) · Robotics: Science and Systems · doi:10.15607/rss.2019.xv.002 · Cited by 12
“polygons are created with len(∂Ri) randomly distributed in [1, 10].”
MethodA Graph-Based Formation Algorithm for Odor Plume Tracing
Soares, J. M., Aguiar, A. P., Pascoal, A., & Martinoli, A. (2016) · Springer tracts in advanced robotics · doi:10.1007/978-4-431-55879-8_18 · Cited by 13
“It is based on the principle of Laplacian feedback, which has been used extensively in other contexts [22, 6].”
MethodControl of Uncertain Multiagent Systems With Spatiotemporal Constraints
Arabi, E., & Yucelen, T. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3049876 · Cited by 12
Directed Distance-Based Formation Control of Nonlinear Heterogeneous Agents in 3-D Space
Babazadeh, R., & Šelmić, R. R. (2022) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2022.3219039 · Cited by 12
“The neighboring set of the agent i, denoted by Ni, is a set of agents whose relative positions can be sensed by the agent i [38].”
BackgroundSá, D. F. S. D., & Neto, J. V. D. F. (2023) · IEEE Access · doi:10.1109/access.2023.3235595 · Cited by 12
“Therefore, these protocols obey set of rules, called Reynold’s rules [2].”
BackgroundMethodH₂ Resilient Consensus Control of Multiagent Systems Under Deception Attack
Ahmed, Z., Ali, N., & Zhang, W. (2023) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2023.3240473 · Cited by 12
“All root-nodes in G , make a strongly connected sub-graph [21].”
BackgroundGasparyan, M. D., & Rao, S. (2023) · Bioengineering · doi:10.3390/bioengineering10091056 · Cited by 14
“For a detailed explanation of the proof of Theorem 1 we refer to [40].”
BackgroundDistributed Control Barrier Functions for Global Connectivity Maintenance
Carli, N. D., Salaris, P., & Giordano, P. R. (2024) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra57147.2024.10610611 · Cited by 12
“The Laplacian of a graph has eigenvalues 0 = λ 1 ≤ λ 2 ≤ ... ≤ λ N with eigenvectors { 1 N / √ N, v 2 , ..., v N } and the second (a.k.a. eigenvalue and Fiedler) λ 2 > 0 if only if the graph is connected [16], [25].”
BackgroundMethodInfluentialA decentralized controller-observer scheme for multi-robot weighted centroid tracking
Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094400 · Cited by 12
“A wide overview on such problems can be found in recent books [13], [9], while”
On multi-agent self-tuning consensus
Radenković, M. S., & Bose, T. (2015) · Automatica · doi:10.1016/j.automatica.2015.02.025 · Cited by 12
Consensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude
Wang, M., & Uchida, K. (2013) · SICE Journal of Control Measurement and System Integration · doi:10.9746/jcmsi.6.7 · Cited by 11
“In the research area on dynamic graphs (see, e.g., [23]), the consensus problem under the constraint | x i − x j | ≤ b ij , which is the condition of the ‘rel-ative’ states to represent the sensor range limit, is solved successfully, but does not cover our problem under the constraint (5) as a…”
BackgroundConsensus of quantum networks with continuous-time markovian dynamics
Shi, G., Dong, D., Petersen, I. R., & Johansson, K. H. (2014) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2014.7052732 · Cited by 13
“, [16]-[24]), they cannot be straightforwardly extended to the consensus of quantum networks due to their unique quantum characteristics.”
BackgroundTakaba, K. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402988 · Cited by 12
“INTRODUCTION Recently, distributed cooperative control of multiagent systems (MAS) has been attracting a great interest in the area of control engineering [1], [2].”
BackgroundAgent-based consensus on speed in the network-coupled DC motors
Masroor, S., & Peng, C. (2016) · Neural Computing and Applications · doi:10.1007/s00521-016-2773-y · Cited by 12
“Lemma 3 [27], A graph is connected if k2 G ð Þ[ 0where k2 is called algebraic connectivity of the graph.”
BackgroundModel reduction of second-order network systems using graph clustering
Cheng, X., Scherpen, J. M. A., & Kawano, Y. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799423 · Cited by 12
“INTRODUCTION Network models capture behaviors and dynamics of interconnected physical systems, see [1]–[3] for an overview.”
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.