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 901–1,000 of 2,960
Introducing network Gramians to undirected network systems for structure-preserving model reduction
Cheng, X., & Scherpen, J. M. A. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799154 · Cited by 12
“Suppose that the set E has m elements and each edge is assigned with an arbitrary orientation, then the incidence matrix of G is defined by a n×m matrix B = [bij ] such that bij = 1 if the edge j is heading to vertex i, −1 if it is leaving vertex i and 0 otherwise, see [1].”
Consensus over weighted digraphs: A robustness perspective
Mukherjee, D., & Zelazo, D. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798784 · Cited by 12
“Lemma 5 ( [6]): For a weighted digraph G having a rooted in-branching and positive weights on all edges, the eigenvalues of the graph Laplacian L̄g belong to the union of the open right half plane with the origin.”
BackgroundLiu, J., Fullmer, D., Nedić, A., Başar, T., & Morse, A. S. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963032 · Cited by 11
Dai, M., Xiao, F., & Wei, B. (2019) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2019.01.049 · Cited by 12
Ghosh, R., Jansch-Porto, J. P., Hsieh, C., Gosse, A., Jiang, M., Taylor, H., Du, P., Mitra, S., & Dullerud, G. E. (2020) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra40945.2020.9196513 · Cited by 17
“This makes Koord implementations of consensus-like protocols read almost like their textbook counterparts [10].”
BackgroundBearing-only formation control under persistence of excitation
Tang, Z., Cunha, R., Hamel, T., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304210 · Cited by 12
“[13], [1].”
Ong, C. J., Djamari, D. W., & Hou, B. (2020) · Automatica · doi:10.1016/j.automatica.2020.109239 · Cited by 13
Gkesoulis, A. K., & Psillakis, H. E. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2020.12.032 · Cited by 12
Flocking motion in swarms with limited sensing radius and heterogeneous input constraints
Ávila-Martínez, E. J., & Barajas-Ramírez, J. G. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.01.022 · Cited by 13
Minimal Controllability Problems on Linear Structural Descriptor Systems
Terasaki, S., & Sato, K. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3079359 · Cited by 12
“ctural controllability, large-scale system, descriptor system, DM decomposition I. INTRODUCTION Controllability, which was introduced by [1], for network dynamical systems such as multi-agent systems [2], brain networks [3], and power networks [4] has received considerable research attention. In the simplest case, sys…”
BackgroundNasir, M. A., Hayat, M. F., Jamal, A., et al. (2021) · Journal of Vibration and Control · doi:10.1177/10775463211022476 · Cited by 12
“For example, Li et al. (2018), Mesbahi and Egerstedt (2010) worked excellently to use algebraic graph theory in the frequency domain to provide a solution of the consensus problems in multi-agent systems (MASs).”
BackgroundControl of multiagent networks with misbehaving nodes
Yildirim, E., & Yucelen, T. (2021) · International Journal of Systems Science · doi:10.1080/00207721.2021.1910875 · Cited by 12
“Since ¯ G (cid:9) is connected, L 1 ( ¯ G (cid:9) ) is positive-definite (Mesbahi & Egerstedt, 2010, Lemma 10.36).”
BackgroundMethodInfluentialIbuki, T., Hirano, T., Funada, R., & Sampei, M. (2022) · Advanced Robotics · doi:10.1080/01691864.2022.2119886 · Cited by 14
Autonomous formation selection for ground moving multi-robot systems
Yu, S., & Barca, J. C. (2015) · IEEE International Conference on Advanced Intelligent Mechatronics (AIM) · doi:10.1109/aim.2015.7222508 · Cited by 12
“Relevant works include the: i) graph theory based techniques presented in [8], [9], which offer a theoretical framework for how formations can be scaled up and down, ii) method described in [10] which enable swarms of simulated robots to identify appropriate formation scales on the basis of the…”
Resilient consensus of second-order agent networks: Asynchronous update rules over robust graphs
Dibaji, S. M., & Ishii, H. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170937 · Cited by 12
“In this section, we recall some concepts on graphs [10].”
BackgroundDistributed, simple and stable network localization
Soares, C., Xavier, J., & Gomes, J. P. (2014) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2014.7032222 · Cited by 12
“This Lipschitz constant can be computed in a distributed way by, e.g. , a diffusion algorithm (c.f. [19, Ch. 9]).”
MethodRobust Delay-dependent H∞ Consensus Control for Multi-agent Systems with Input Delays
Li, Z., & Ji, H. (2014) · Acta Automatica Sinica · doi:10.1016/s1874-1029(14)60401-8 · Cited by 12
Collision-free second-order vehicle formation control under time-varying network topology
Kim, Y., & Mahmood, A. (2015) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2015.07.005 · Cited by 12
Towards Structural Controllability of Temporal Complex Networks
Li, X., Yao, P., & Pan, Y. (2015) · Understanding complex systems · doi:10.1007/978-3-662-47824-0_13 · Cited by 13
Mitigating the effects of sensor uncertainties in networked multiagent systems
Arabi, E., Yucelen, T., & Haddad, W. M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526539 · Cited by 12
“Although we consider this specific problem in this paper, the proposed approach dealing with sensor uncertainties can be used in many other problems that exist in the networked multiagent systems literature [3], [4].”
BackgroundInfluentialOn a relation between graph signal processing and multi-agent consensus
Izumi, S., Azuma, S., & Sugie, T. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798391 · Cited by 11
“The reason is that multiagent systems have a wide range of engineering applications such as swarm robotics and energy networks [1].”
BackgroundKrishna, A., Hans, C. A., Schiffer, J., et al. (2017) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2017.7984168 · Cited by 12
Variational collision avoidance problems on Riemannian manifolds
Assif, M., Banavar, R. N., Bloch, A. M., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619596 · Cited by 12
“Finding trajectories that take a set of agents from one configuration to another while avoiding collisions and minimizing some quantity like energy or time has been an important problem with applications in a variety of domains [15].”
BackgroundAverage Consensus of Multi-Agent Systems Under Directed Topologies and Binary-Valued Communications
Wang, T., Zhang, H., & Zhao, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2872755 · Cited by 12
SPACETIME DISCOUNTED VALUE OF NETWORK CONNECTIVITY
Dragicevic, A. Z. (2018) · Advances in Complex Systems · doi:10.1142/s0219525918500182 · Cited by 12
Distributed Optimization Over Networks
Nedić, A. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_1 · Cited by 13
Shahid, M. U., Khan, M. M., Xu, J., et al. (2018) · Electronics · doi:10.3390/electronics7120418 · Cited by 12
Minimal Laplacian controllability problems of threshold graphs
Hsu, S. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.5875 · Cited by 12
Cheng, X., Scherpen, J. M. A., & Zhang, F. (2019) · European Journal of Control · doi:10.1016/j.ejcon.2019.06.001 · Cited by 12
“In the system and control community, the research on network systems, or multi-agent systems, has received compelling attention [7,29,33] .”
BackgroundDegree heterogeneity of graphs and networks. I. Interpretation and the “heterogeneity paradox”
Estrada, E. (2019) · Journal of Interdisciplinary Mathematics · doi:10.1080/09720502.2019.1643553 · Cited by 12
“Dynamics interpretation of r(G) Consensus dynamics on graphs deals with the use of diffusive processes taking place on the nodes and edges of the graph (see for instance [33]).”
BackgroundFunada, R., Cai, X., Notomista, G., et al. (2020) · IEEE Control Systems · doi:10.1109/mcs.2020.2990515 · Cited by 12
“. d ij = Then, u i can be defined by the weighted consensus protocol [5]: where In this situation, the time derivative of the storage function S x is ( ) .”
BackgroundInfluentialSelf-citationOn New Laplacian Matrix with a User-Assigned Nullspace in Distributed Control of Multiagent Systems
Tran, D. M., & Yucelen, T. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9148002 · Cited by 12
On Sampled-Data Consensus: Divide and Concur
Barkai, G., Mirkin, L., & Zelazo, D. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3074589 · Cited by 13
“R EACHING an agreement between autonomous dynamical systems in the presence of communication constraints is a fundamental problem in many applications, both in control and in other areas [1]–[3].”
BackgroundIn-layer Thermal Control of a Multi-layer Selective Laser Melting Process
Liao‐McPherson, D., Balta, E. C., Wüest, R., et al. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838031 · Cited by 12
Event-Triggered Consensus on Matrix-weighted Networks
Pan, L., Wang, C., Shao, H., et al. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9728516 · Cited by 12
“Reaching a consensus via local interactions turns out to be a necessary prerequisite for distributed control of multi-agent networks [1].”
BackgroundSial, M. B., Zhang, Y., Wang, S., et al. (2022) · Drones · doi:10.3390/drones6090227 · Cited by 12
Spatial PID consensus controllers for distributed filters of distributed parameter systems
Demetriou, M. A. (2013) · Systems & Control Letters · doi:10.1016/j.sysconle.2013.10.006 · Cited by 12
Performance of leader-follower networks in directed trees and lattices
Lin, F., Fardad, M., & Jovanović, M. R. (2012) · doi:10.1109/cdc.2012.6425879 · Cited by 12
“INTRODUCTION Systems over graphs arise in many emerging applications ranging from control of vehicular formations, to distributed estimation in sensor networks, to synchronization of networks of oscillators [1]–[11].”
BackgroundMultiple time-scales in network-of-networks
Chapman, A., & Mesbahi, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526542 · Cited by 12
“cian matrix whose eigenvalues 0 = λ1(G) ≤ · · · ≤ λn(G); see [9] for details.”
Self-citationMulti-objective Compositions for Collision-Free Connectivity Maintenance in Teams of Mobile Robots
Wang, L., Ames, A. D., & Egerstedt, M. (2016) · CaltechAUTHORS (California Institute of Technology) · doi:10.48550/arxiv.1608.06887 · Cited by 12
“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-citationReduced-Order Distributed Fault Diagnosis for Large-Scale Nonlinear Stochastic Systems
Noursadeghi, E., & Raptis, I. A. (2017) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4037839 · Cited by 12
GEESE: grammatical evolution algorithm for evolution of swarm behaviors
Neupane, A., Goodrich, M. A., & Mercer, E. G. (2018) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3205455.3205619 · Cited by 12
Decentralized Consensus Control of Rigid Bodies Using Exponential Coordinates
Maadani, M., Butcher, E. A., Nazari, M., & Yucelen, T. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-1161 · Cited by 13
Choi, J., Song, Y., Lim, S., et al. (2020) · IEEE Access · doi:10.1109/access.2020.2987348 · Cited by 12
“Most notations are based on [19].”
BackgroundA Note on the Consensus Protocol with Some Applications to Agent Orbit Pattern Generation
Tsiotras, P., & Castro, L. I. R. (2012) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-32723-0_25 · Cited by 12
“where L def = DD ∈RN×N is the graph Laplacian [11].”
BackgroundMethodInfluentialData-driven Sparse Sensor PlacementPreprint
Manohar, K. (2019) · arXiv (Cornell University) · doi:10.14288/1.0376779 · Cited by 16
Fixed-time Distributed Optimization under Time-Varying Communication TopologyPreprint
Garg, K., Baranwal, M., Hero, A. O., & Panagou, D. (2019) · arXiv (Cornell University) · Cited by 11
Consensus in Multi‐Agent Systems
Proskurnikov, A. V., & Cao, M. (2016) · Wiley eBooks · doi:10.1002/047134608x.w8332 · Cited by 18
Nojavanzadeh, D., Liu, Z., Saberi, A., et al. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147554 · Cited by 11
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory by local interaction among agents (see [1], [10], [19], [24] and references therein).”
BackgroundZhang, P., Shan, Q., Li, T., & Chen, C. L. P. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6361 · Cited by 13
“47 And a digraph is said to be weakly connected if it is connected when the undirected form of this digraph is connected.”
BackgroundMutualistic Interactions in Heterogeneous Multi-Agent Systems
Nguyen, A. A., Jabbari, F., & Egerstedt, M. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384078 · Cited by 11
“Multi-agent systems have been utilized in a variety of applications, such as exploration [1], environmental monitoring [2], sensor coverage [3], and precision agriculture [4], which requires a team of agents to organize themselves efficiently and effectively to accomplish a shared objective [5].”
BackgroundSelf-citationSynchronization of Moving Chaotic Robots
Tomaselli, C., Guastella, D. C., Muscato, G., et al. (2024) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2024.3406060 · Cited by 11
“The model is particularly suited for agents equipped with limited sensing/communication capabilities, where r represents the maximum distance at which the communication system between robots can operate [26].”
BackgroundThe First Five Years of a Phase Theory for Complex Systems and Networks
Wang, D., Chen, W., & Qiu, L. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124542 · Cited by 11
Joint Estimation and Planar Affine Formation Control With Displacement Measurements
Yang, Q., Zhang, X., Fang, H., et al. (2024) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2024.3449008 · Cited by 11
“Akin to the definition of the graph Laplacian and the edge Laplacian [28], the matrices L s and L es are, respectively, defined as It can be easily checked that L es is positive definite.”
Privacy-preserving average consensus via matrix-weighted inter-agent coupling
Pan, L., Shao, H., Lu, Y., et al. (2025) · Automatica · doi:10.1016/j.automatica.2024.112094 · Cited by 11
Self-citationUAV Swarms: Models and Effective Interfaces
Chapman, A., & Mesbahi, M. (2014) · Springer eBooks · doi:10.1007/978-90-481-9707-1_34 · Cited by 11
Self-citationAverage consensus on strongly connected weighted digraphs: A generalized error bound
Montijano, E., Gasparri, A., Priolo, A., & Sagüés, C. (2015) · Automatica · doi:10.1016/j.automatica.2015.04.025 · Cited by 11
“While this problem is well known to be solved for undirected graphs (see Mesbahi and Egerstedt (2010) and references therein), solutions are largely unknown for the remaining cases when graphs are not balanced.”
BackgroundSynchronization of finite-state pulse-coupled oscillators
Lyu, H. (2015) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2015.03.007 · Cited by 11
“Nowadays the technique of decentralized control finds its use in cooperative control of networked dynamical systems, from robotic vehicle networks to electric power networks to synthetic biological networks ([30], [2], [3], [6], [20], [22]).”
BackgroundStructured model reduction of interconnected linear systems based on singular perturbation
Ishizaki, T., Sandberg, H., Johansson, K. H., et al. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580702 · Cited by 11
“The examples include power networks and transportation networks, as well as control systems in which some controllers are distributed over a plant; see [1], [2] for an overview.”
BackgroundMultiplex information networks for spatially evolving multiagent formations
Tran, D. M., Yucelen, T., & Pasiliao, E. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525198 · Cited by 12
“From a practical standpoint, connectivity maintenance and collision avoidance can be considered for (13) and (17) using tools and methods from differential potential fields (see, for example, [2], [9], [10], [13], [14] and references therein).”
BackgroundMethodInfluentialRezaei, V., & Stefanovic, M. (2016) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2016.7536062 · Cited by 11
Global converegence properties of a consensus protocol on the n-sphere
Markdahl, J., & Gonçalves, J. M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798792 · Cited by 12
“, to reach a consensus or to propagate information by means of local interactions [1].”
BackgroundLeader selection via LASSO for formation control of time-delayed multi-agent systems
Sakurama, K. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.12.108 · Cited by 11
Balanced Truncation Approach to Linear Network System Model Order Reduction
Cheng, X., & Scherpen, J. M. A. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.408 · Cited by 11
“Besides, let w i be the the weight associated to the edge i , then · · · and E is called the incidence matrix of G , see Mesbahi and Egerstedt (2010) for the above definitions.”
BackgroundRezaei, V., & Stefanovic, M. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.155 · Cited by 11
Network Identification: A Passivity and Network Optimization Approach
Sharf, M., & Zelazo, D. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619059 · Cited by 12
“They have been employed across numerous domains, including flocking, formation control, robotics rendezvous, social networks, and distributed estimation [1], [2].”
BackgroundStoorvogel, A. A., Saberi, A., Zhang, M., et al. (2018) · European Journal of Control · doi:10.1016/j.ejcon.2018.08.001 · Cited by 11
Bregman Parallel Direction Method of Multipliers for Distributed Optimization via Mirror Averaging
Yu, Y., Acikmese, B. A., & Mesbahi, M. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2833116 · Cited by 10
“Consider the following intermediate update, The behavior of (11) is characterized by the Markov chain defined by matrix P [16, Proposition 3.21].”
BackgroundInfluentialSelf-citationStoorvogel, A. A., Saberi, A., Liu, Z., et al. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4726 · Cited by 11
Resilient coordinated movement of connected autonomous vehicles
Safi, M., Dibaji, S. M., & Pirani, M. (2022) · European Journal of Control · doi:10.1016/j.ejcon.2021.12.008 · Cited by 11
“ques, in this paper, we investigate methods to bypass the attacker in CACC in a distributed manner. In multi-agent systems, various consensus problems have been studied extensively in the past decade [15], [16] where locally connected agents interact to achieve the global goal of reaching a common state. In this liter…”
MethodSynchronization preserving model reduction of multi-agent network systems by eigenvalue assignments
Yu, L., Cheng, X., Scherpen, J. M. A., et al. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029857 · Cited by 11
Output-Feedback Self-Synchronization of Directed Lur’e Networks via Global Connectivity
Zhang, F., Wen, G., Zemouche, A., et al. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3042191 · Cited by 11
“It is well known that an undirected graph Ḡ is connected if and only if its Laplacian matrix L̄ has a unique 0 eigenvalue [38].”
BackgroundInfluentialDistance-Based Formation Control Over Directed Triangulated Laman Graphs in 2-D Space
Babazadeh, R., & Šelmić, R. R. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9303934 · Cited by 11
“Neighboring set of the agent i in a digraph, denoted by N i , is defined as a set of agents whose positions can be sensed by the agent i [13].”
BackgroundSwarm shedding in networks of self-propelled agents
Hindes, J., Edwards, V., Szwaykowska, K., Stantchev, G. M., & Schwartz, I. B. (2021) · Scientific Reports · doi:10.1038/s41598-021-92748-1 · Cited by 13
Consensus Controller for Heterogeneous Multi-Agent Systems Using Output Prediction
Niu, K., Wardi, Y., Abdallah, C. T., et al. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3217160 · Cited by 11
“Early investigations pertain to the case where the agents’ dynamics are linear, including single integrators [1], double integrators [2], [3], and homogeneous systems comprised of higher-order integrators [4].”
BackgroundInfluentialCoordination of Uncertain Multiagent Systems with Non-Identical Actuation Capacities
Kurttisi, A., Aly, I. A., & Dogan, K. M. (2022) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc51059.2022.9992910 · Cited by 11
“Specifically, it is given by L ( G ) ≜ D ( G ) − A ( G ) , where the spectrum of this Laplacian matrix for an undirected and connected graph G can be ordered as , with 1 n as the eigenvector corresponding to the zero eigenvalue λ 1 L ( G ) and L ( G ) 1 n = 0 n holds [3], [17].”
BackgroundDistributed Neighbor Selection in Multiagent Networks
Shao, H., Pan, L., Mesbahi, M., Xi, Y., & Li, D. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3246425 · Cited by 17
“collective behavior at the network level is of great interest [1], [2], [3].”
BackgroundSelf-citationA novel fractional-order flocking algorithm for large-scale UAV swarms
Chen, H., He, M., Liu, J., et al. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-023-01107-2 · Cited by 11
“The Laplacian matrix of undirected connected graphs has one zero eigenvalue with eigenvector 1, and all of its nonzero eigenvalues are real and positive [36] .”
BackgroundAsymptotic Consensus of Unknown Nonlinear Multi-Agent Systems with Prescribed Transient Response
Verginis, C. K. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156250 · Cited by 11
“Distributed control of networked multi-agent systems is an emerging and significant topic that has received a large amount of attention during the last decades due to the variety of its applications [1]–[3].”
BackgroundMatrix-Scaled Consensus on Weighted Networks With State Constraints
Shang, Y. (2023) · IEEE Systems Journal · doi:10.1109/jsyst.2023.3288602 · Cited by 11
“It is well known that L is symmetric and positive semidefinite with its kernel given by ker( L ) = image(1 n ) , where 1 n ∈ R n is the vector of all ones and image( · ) means the image (i.e., the span of columns) of a matrix [23].”
BackgroundA control lyapunov function approach to human-swarm interactions
de la Croix, J.-P., & Egerstedt, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7172016 · Cited by 11
“where Lf is a version of the graph Laplacian L as defined in [17] (and commonly used in multi-robot control) with all entries in the n-th row of L equal to zero.”
BackgroundSelf-citationOptimal control for linear and nonlinear semistabilization
L׳Afflitto, A., Haddad, W. M., & Hui, Q. (2014) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2014.11.015 · Cited by 11
Optimal resource management algorithm for unmanned aerial vehicle missions in hostile territories
Yoo, D.-W., Lee, C.-H., Tahk, M.-J., et al. (2013) · Proceedings of the Institution of Mechanical Engineers Part G Journal of Aerospace Engineering · doi:10.1177/0954410013512926 · Cited by 11
Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
Chowdhury, N. R., Sukumar, S., & Balachandran, N. (2016) · European Journal of Control · doi:10.1016/j.ejcon.2015.12.005 · Cited by 10
“An elaborate discussion of the same is available in [11].”
BackgroundMethodRamachandran, R. K., & Berman, S. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963550 · Cited by 11
“8 of [20], the graph is connected if and only if λ2(G )> 0.”
BackgroundDistributed Nash equilibrium seeking of a class of aggregative games
Liang, S., Yi, P., & Hong, Y. (2017) · International Conference on Control and Automation · doi:10.1109/icca.2017.8003035 · Cited by 11
“The following concepts of graph theory can be found in [25].”
BackgroundWeighted Bearing-Compass Dynamics: Edge and Leader Selection
Schoof, E., Chapman, A., & Mesbahi, M. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2754944 · Cited by 11
“This is accomplished by selecting links from a distance graph [9].”
BackgroundSelf-citationCartesian product-based hierarchical scheme for multi-agent systems
Iqbal, M., Leth, J., & Ngo, T. D. (2017) · Automatica · doi:10.1016/j.automatica.2017.11.009 · Cited by 11
Distributed Randomized Algorithms for PageRank Based on a Novel Interpretation
Suzuki, A., & Ishii, H. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430939 · Cited by 13
“In [9], [12], it was pointed out that the problem shares similarities with the multi-agent consensus problem [17], and randomized distributed algorithms were developed.”
BackgroundSynchronization of Kuramoto Oscillators in a Bidirectional Frequency-Dependent Tree Network
Jafarian, M., Yi, X., Pirani, M., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619694 · Cited by 11
“If the undirected graph is a tree, all eigenvalues of Lg (which are n−1 eigenvalues) are equal to the nonzero eigenvalues of L [15].”
BackgroundInfluentialDifferential Privacy for Network Identification
Katewa, V., Chakrabortty, A., & Gupta, V. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2922169 · Cited by 20
“A standard result in consensus literature is that synchronization is achieved if the underlying network graph is connected [1].”
BackgroundSparsity Structure and Optimality of Multi-Robot Coverage Control
Davydov, A., & Diaz-Mercado, Y. J. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2921513 · Cited by 11
“…[17], we have By substituting this relation into our expression for ∂ c i /∂ p i , one may verify that From here, define a weighted block-Laplacian matrix [18], given by L = − A where A is the weighted block-adjacency matrix with [ A ] ij = m i ∂ c i /∂ p j when i (cid:9)= j and zero when i = j .”
Vlahakis, E. E., Dritsas, L. D., & Halikias, G. D. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9028865 · Cited by 11
“The following two results are standard [6], [23].”
BackgroundHaddad, W. M., & Chahine, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008301 · Cited by 11
“…cooperative control of unmanned air vehicles, microsatellite clusters, mobile robotics, battle space management, and congestion control in communication networks, it is not surprising that control of networks and control over networks has attracted considerable attention in the literature [1]–[12].”
BackgroundHuman Multi-Robot Physical Interaction: a Distributed Framework
Lippi, M., & Marino, A. (2021) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-020-01277-y · Cited by 11
“Moreover, by construction, zero is always a right eigenvalue of the Laplacian matrix with the corresponding right eigenvector (N × 1) vector of all ones [25].”
BackgroundSchwab, A., & Lunze, J. (2021) · European Journal of Control · doi:10.1016/j.ejcon.2021.04.006 · Cited by 12
Dogan, K. M., & Yucelen, T. (2021) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta48906.2021.9658592 · Cited by 11
Uncertain Multiagent System in the Presence of Coupled Dynamics: An Asymptotic Approach
Aly, I. A., & Dogan, K. M. (2022) · AIAA SciTech Forum · doi:10.2514/6.2022-0359 · Cited by 11
Spacecraft synchronization in the presence of attitude constrained zones
Lee, U., & Mesbahi, M. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315561 · Cited by 12
Self-citationAn Adaptive Sliding Mode Observer for A Complex Network of Dynamical Systems
Menon, P. P., & Edwards, C. (2011) · IFAC Proceedings Volumes · doi:10.3182/20110828-6-it-1002.03402 · Cited by 11
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.