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 2,101–2,200 of 2,960
Structural Equilibrium Control of Network Systems
Azuma, S. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304083 · Cited by 2
Discrete-Time Networked Dynamic Systems
Mahmoud, M. S. (2020) · WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL · doi:10.37394/23203.2020.15.22 · Cited by 2
Decentralized control for deployment of multi-agent dynamical systems
Topolewicz, K., Girejko, E., & Olaru, S. (2021) · International Conference on Process Control · doi:10.1109/pc52310.2021.9447491 · Cited by 2
“This problem is known as the deployment problem [2] or coverage problem [11].”
BackgroundConvergence Rate Control of Multiagent Systems
Tran, D. M., & Yucelen, T. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483017 · Cited by 3
Rezaei, V., & Stefanovic, M. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9482988 · Cited by 2
Robust Formation Maintenance Methods under General Topology Pursuit of Multi-Agents Systems
Ansart, A., Juang, J., & Ramachandran, K. (2021) · Electronics · doi:10.3390/electronics10161970 · Cited by 2
Joint Vertex-Time Filtering on Graphs With Random Node-Asynchronous Updates
Teke, O., & Vaidyanathan, P. P. (2021) · IEEE Access · doi:10.1109/access.2021.3109288 · Cited by 2
“Distributed processing of data over networks has been studied extensively, and they find applications in different problem formulations ranging from distributed sensor localization [35]–[38] and controlling network of agents [39], [40] to opinion dynamics [41] and PageRank computations [42], [43].”
BackgroundWitke, K. A., Koru, A. T., & Yucelen, T. (2022) · AIAA SciTech Forum · doi:10.2514/6.2022-1219 · Cited by 2
Lin, F., Fardad, M., & Jovanović, M. R. (2003) · Sensor Review · doi:10.1108/sr.2003.08723dad.009 · Cited by 2
Hybrid Coordination of Flow Networks
Persis, C. D., & Frasca, P. (2013) · Wiley eBooks · doi:10.1002/9781118639856.ch5 · Cited by 2
A GENERAL FRAMEWORK FOR CONSENSUS NETWORKS
Somarakis, C. (2015) · University Libraries (University of Maryland) · doi:10.13016/m2wk77 · Cited by 2
Network Flows that Solve Linear EquationsPreprint
Shi, G., Anderson, B. D. O., & Helmke, U. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.05176 · Cited by 2
“In fact, we have wi > 0 for all i ∈ V if G§ is strongly connected [6].”
BackgroundFrom Global Linear Computations to Local Interaction RulesPreprint
Costello, Z., & Egerstedt, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.5959 · Cited by 2
“for Sponsored Research. The authors would 0.00 0.05 0.10 0.15 0.20 -1 0 1 2 3 4 Time @sD x State Trajectory Fig. 8. The evolution of the node states for the swap problem. The initial state is x(t0) = [1,2,3,4]T and the final state is x(t f) = [2,1,4,3]T, i.e., the first and second states swapped values and the third and…”
BackgroundInfluentialSelf-citationNoursadeghi, E., & Raptis, I. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.01130 · Cited by 3
“More information about graph theoretic concepts can be found in [57].”
BackgroundDecentralized Autonomous Navigation Strategies for Multi-Robot Search and RescuePreprint
Baranzadeh, A. (2016) · arXiv (Cornell University) · doi:10.26190/unsworks/3009 · Cited by 5
Simple and fast cooperative localization for sensor networksPreprint
Soares, C., Xavier, J., & Gomes, J. P. (2014) · arXiv (Cornell University) · Cited by 2
Phase transition in firefly cellular automata on finite treesPreprint
Lyu, H. (2016) · arXiv (Cornell University) · Cited by 2
Simple synchronization protocols for heterogeneous networks: beyond passivity (extended version)Preprint
Proskurnikov, A. V., & Mazo, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.02937 · Cited by 2
“Synchrony among subsystems (agents, cells) of a complex system is a basic principle, which explains many natural phenomena (Strogatz, 2003) and has found numerous applications in engineering (Mesbahi and Egerstedt, 2010; Olfati-Saber et al., 2007; Wu, 2007; Ren and Beard, 2008).”
InfluentialSomarakis, C., Paraskevas, E., Baras, J. S., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.02411 · Cited by 2
“The research on connectivity conditions for (1) is a saturated subject (see [11], [12], [18], [20], [21], [32] and references therein).”
BackgroundAbstraction refinement and plan revision for control synthesis under high level specifications
Meyer, P.-J., & Dimarogonas, D. V. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1292 · Cited by 3
“…consider the single integrator model Σn : ẋ = u (in the same state space Rn), typically used for motion of fully-actuated kinematic robotic agents (Mesbahi and Egerstedt, 2010) and such that (1) can be seen as a disturbed version (by disturbance w and state interactions) of the nominal system…”
BackgroundMethodColombo, L. J., & Dimarogonas, D. V. (2018) · arXiv (Cornell University) · Cited by 2
Bregman Parallel Direction Method of Multipliers for Distributed Optimization via Mirror AveragingPreprint
Yu, Y., Acikmese, B. A., & Mesbahi, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06835 · Cited by 2
“Consider the following intermediate update, The behavior of (11) is characterized by the Markov chain defined by matrix P [16, Proposition 3.21].”
BackgroundInfluentialSelf-citationKawamura, S., Cai, K., & Kishida, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.00920 · Cited by 2
Distributed Circumnavigation Control with Dynamic Spacings for a Heterogeneous Multi-robot SystemPreprint
Yao, W., Luo, S., Lu, H., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.05395 · Cited by 2
“time period where i is constant, Aand bare constant matrix and vector respectively. Note that matrix Ais a row stochastic matrix [2] and furthermore, it could be considered as the adjacency matrix [5] corresponding to a weighted directed ring denoted by G(A). It can be readily veried that G(A) is strongly connected. N…”
BackgroundPrivacy-Preserving Gossip Algorithms.Preprint
Liu, Y., Wu, J., Manchester, I. R., et al. (2018) · arXiv (Cornell University) · Cited by 2
Efficient Algorithms for Optimal Perimeter GuardingPreprint
Feng, S. W., Han, S. D., Gao, K., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.04434 · Cited by 2
“polygons are created with len(∂Ri) randomly distributed in [1, 10].”
MethodPersistence based analysis of consensus protocols for dynamic graph networksPreprint
Chowdhury, N. R., & Sukumar, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.1168 · Cited by 2
“A detailed discussion of the same is available in [9], [17].”
A network dynamics approach to chemical reaction networksPreprint
van der Schaft, A. J., Rao, S., & Jayawardhana, B. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02247 · Cited by 2
Dynamic Average Consensus under Limited Control Authority and Privacy RequirementsPreprint
Kia, S. S., Cortés, J., & Martı́nez, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.6463 · Cited by 2
Distributed continuous-time convex optimization on weight-balanced digraphsPreprint
Gharesifard, B., & Cortés, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.0304 · Cited by 2
“ource localization, and robust estimation, and has been intensively studied in recent years, see e.g. [1], [2], [3], [4], [5], [6]. Most of these works build on consensusbased dynamics [7], [8], [9], [10] to design discrete-time algorithms that find the solution of the optimization problem. A recent exception are the w…”
BackgroundOn the reachability and observability of path and cycle graphsPreprint
Parlangeli, G., & Notarstefano, G. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.3556 · Cited by 2
“In [8] and [9], see also [2], necessary conditions for”
BackgroundMass-spring-damper Networks for Distributed Optimization in Non-Euclidean SpacesPreprint
Yu, Y., Acikmese, B. A., & Mesbahi, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.01999 · Cited by 2
“When the graph is connected, the nullspace of E(G) is spanned by 1 [Mesbahi and Egerstedt, 2010, Theorem 2.8], and the nullspace of E(G) is spanned by the signed path vector of cycles in G [Zelazo and Mesbahi, 2011, Thm. 2.3].”
BackgroundInfluentialSelf-citationNetwork Identification for Diffusively-Coupled Systems with Minimal Time ComplexityPreprint
Sharf, M., & Zelazo, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.04923 · Cited by 2
“They have been applied in a wide range of domains, including formationcontrol anddistributedcomputing[1].”
BackgroundInnovations required for retail beamed power transmission over short range
Chowdhary, G. V., & Komerath, N. M. (2010) · Cited by 2
Inferring and Learning Multi-Robot Policies by Observing an ExpertPreprint
Pierpaoli, P., Ravichandar, H. C., Waytowich, N. R., Li, A., Asher, D. E., & Egerstedt, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.07887 · Cited by 3
“earning how to create sequences from a pre-defined list of controllers, rather than learning entirely new controllers, is motivated by the rich literature on coordinated control for multi-agent system [14]. In addition, although beyond the scope of the current work, the use of coordinated controllers makes our framewor…”
BackgroundSelf-citationDisagreement and Polarization in Two-Party Social NetworksPreprint
Yi, Y., & Patterson, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.11338 · Cited by 2
“(3) Since S 6= ∅, −LF,F is Hurwitz, and therefore, the system converges to an unique steady state Mesbahi and Egerstedt (2010)”
BackgroundInfluentialFast Online Reinforcement Learning Control using State-Space Dimensionality ReductionPreprint
Sadamoto, T., Chakrabortty, A., & Imura, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.06514 · Cited by 2
“This is often the case when the network exhibits a consensus property over a connected graph [39].”
BackgroundOn the structural stability of random systemsPreprint
Belabbas, M.-A., & Kirkoryan, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.04139 · Cited by 2
“Indeed, a structural analysis, because it relies on a coarse description of the system, enables one to focus on the basic characteristics that make a property hold and to relegate the finer details to a subsequent study [11, 15].”
BackgroundLearning Multi-Agent Coordination through Graph-driven CommunicationPreprint
Pesce, E., & Montana, G. (2020) · arXiv (Cornell University) · Cited by 2
Swarm Herding: A Leader-Follower Framework For Multi-Robot NavigationPreprint
Xu, X., & Diaz-Mercado, Y. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.07416 · Cited by 5
“Let us consider the topology of interaction for the MSD network to be given by an undirected and connected graph [17].”
BackgroundDistributed control of multi-consensusPreprint
Gambuzza, L. V., & Frasca, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.09383 · Cited by 2
“1: Equations (2) are widely used in multi-agent problems such as flocking, swarming, and distributed estimation involving a scalar variable for each node [8].”
BackgroundBianchin, G., Dall’Anese, E., Poveda, J. I., & Buchwald, A. G. (2021) · medRxiv · doi:10.1101/2021.04.20.21255350 · Cited by 2
Dynamic Event-Triggered Consensus of Multi-agent Systems on Matrix-weighted NetworksPreprint
Pan, L., Shao, H., Li, D., & Liu, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.06198 · Cited by 3
“Introduction Reaching a consensus is a paramount routine in distributed coordination of multi-agent systems Mesbahi and Egerstedt [14], Olfati-Saber et al.”
BackgroundBianchin, G., Dall’Anese, E., Poveda, J. I., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.06025 · Cited by 2
Network-based analysis of fluid flows: Progress and outlookPreprint
Taira, K., & Nair, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.07923 · Cited by 2
“Ö.D. Gürcan Physica D 426 (2021) 132983 This modeling effort also revealed that the first POD pair serves as the leader node and the remaining nodes act as followers (Mesbahi and Egerstedt, 2010).”
BackgroundInfluentialFormation Control of Nonlinear Multi-Agent Systems Using Three-Layer Neural NetworksPreprint
Aryankia, K., & Šelmić, R. R. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.04381 · Cited by 2
Controlling Collective Behavior in Complex Systems
di Bernardo, M. (2021) · Encyclopedia of Systems and Control · doi:10.1007/978-3-030-44184-5_100130 · Cited by 2
Top-Down & Bottom-Up Approaches to Robot Design
Covell, D. (2022) · doi:10.33915/etd.11409 · Cited by 2
“value through consensus protocols [44].”
BackgroundMethods for formation flying control based on communication graph techniquePreprint
Dadashev, R. R., & Shestakov, S. A. (2022) · Keldysh Institute Preprints · doi:10.20948/prepr-2022-90 · Cited by 2
Zhou, T., Liu, Q., & Wang, W. (2023) · doi:10.22541/au.168024622.26420338/v1 · Cited by 2
Islam, M. S., & Faruque, I. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.10.10.616169 · Cited by 2
“If the Laplacian matrix has a single eigenvalue equal to zero and all other eigenvalues have positive real parts, the graph is strongly connected and has at least one spanning tree (Mesbahi and Egerstedt, 2010; Bullo, 2024).”
BackgroundMacroscopic Noisy Bounded Confidence Models With Distributed Radical Opinions
Kolarijani, M. A. S., Proskurnikov, A. V., & Esfahani, P. M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2994284 · Cited by 16
“2994284 have inspired the development of synchronization and consensus theory [4], [5].”
Optimal Control of Network-Coupled Subsystems: Spectral Decomposition and Low-Dimensional Solutions
Gao, S., & Mahajan, A. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3124259 · Cited by 8
“We refer readers to [7]–[9], [48] for an overview.”
BackgroundOptimal reduced‐order LQG synthesis: Nonseparable control and estimation design
Leiter, N., & Geller, D. K. (2019) · Optimal Control Applications and Methods · doi:10.1002/oca.2527 · Cited by 1
“P(t) = AP + PAT − PCTQ−1 2 CP + BQ1B T , (19)”
Distributed Optimization for Mobile Robots under Mobile Edge Computing Environment
Luo, H., & Yin, Q. (2021) · Complexity · doi:10.1155/2021/8342610 · Cited by 1
“According to the graph theory [20], the edge set is defined as E ⊂N × N.”
BackgroundOn the Role of Matrix-Weights Elements in Consensus Algorithms for Multi-Agent Systems
Ogbebor, J. O., & Meng, X. (2021) · Network · doi:10.3390/network1030014 · Cited by 1
Graphical Characterizations for Structural Controllability of Drifted Bilinear Systems
Wang, X., Li, B., Li, J.-S., et al. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683734 · Cited by 1
Ristevski, S., Yucelen, T., & Muse, J. A. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867363 · Cited by 3
“We now state the necessary graph-theoretical defini-tions adopted in this paper, where we refer to [3] and [23] for any additional details.”
BackgroundDistance-Based Formation Maneuvering of Mobile Robots with Static Obstacles
Sahebsara, F., & de Queiroz, M. S. (2022) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta49430.2022.9966079 · Cited by 1
“Formation control is an important subproblem in this area where the objective is for mobile robots to form a desired geometric shape in space [1], [2], [3].”
BackgroundFixed-Time Optimization of Perturbed Multi-Agent Systems under the Resource Constraints
Wang, B., Wang, F., Chen, Y., et al. (2023) · Applied Sciences · doi:10.3390/app13074527 · Cited by 1
Control of misbehaving multiagent networks using driver and observer nodes
Yildirim, E., Saltos, A., & Yucelen, T. (2023) · International Journal of Systems Science · doi:10.1080/00207721.2023.2249160 · Cited by 1
“We now concisely overview network partitioning based on the content from Mesbahi and Egerstedt (2010) and Yildirim and Yucelen (2021).”
MethodInfluentialTransactive Multi-Agent Systems over Flow Networks
Chen, Y., Salehi, Z., Petersen, I. R., et al. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10384277 · Cited by 1
“Future technologies are being structured as networked multi-agent systems that take advantage of the Internet of Things to support critical infrastructure systems [1].”
BackgroundFormation Control with Finite-Time Convergence and Collision Avoidance
Fairfax, L. D. (2024) · AIAA SciTech Forum · doi:10.2514/6.2024-0528 · Cited by 1
Distributed Enclosing Control of Second-order Multi-Agent Systems with An Unknown Dynamic Target
Chen, W., Dou, L., & Li, D. (2023) · doi:10.1109/icoias61634.2023.00051 · Cited by 1
“Since the graph G is a cycle graph which is strongly connected, the matrix H is positive definite [20].”
BackgroundNavigational bottlenecks in nonconservative diffusion dynamics on networks
Soares, G. G., & Estrada, E. (2024) · AIMS Mathematics · doi:10.3934/math.20241182 · Cited by 2
“Di ff usion has been widely studied in the context of complex networks [17–19] as well as in engineering under the term “consensus dynamics” [20–22].”
BackgroundConnectivity Preservation Control For Multiple UAVs with Communication Failure
Yuan, B., Xue, X., Ren, Y., et al. (2024) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/isas61044.2024.10552574 · Cited by 1
“A graph G is connected if a path exists between any two vertices in V [24].”
BackgroundMethodAllocation of Formation Control Tasks Using Delaunay Triangulation and Tetrahedralization
Babazadeh, R., Šelmić, R. R., & Fi̇dan, B. (2024) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med61351.2024.10566175 · Cited by 1
“For the agent i in a directed graph, the neighboring set N i is defined as the set of agents whose positions are sensed by agent i and with respect to which agent i has distance to maintain [13].”
BackgroundEvent- Triggered Distributed Control of Multiagent Systems: A Performance Recovery Consideration
Kurtoglu, D., Yucelen, T., Tran, D. M., Casbeer, D. W., & García, E. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644397 · Cited by 1
“We next present the graph-theoretical notation used throughout this paper, which is primarily adopted from [3].”
MethodMetapopulation models with anti-symmetric Lotka–Volterra systems
Anish, A. S., Baets, B. D., & Rao, S. (2024) · Journal of Biological Dynamics · doi:10.1080/17513758.2024.2397404 · Cited by 1
“Let jk ) denote the weighted adjacency matrix [17] of the digraph G i representing the inter-patch migration.”
Higher-Order Non-Autonomous Optimal Area Coverage Control
Li, Q., & Spinello, D. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3483668 · Cited by 1
“A decentralized controller, by only requiring information sharing with a limited number of neighbours, enhances fault tolerance and adaptability to communication and computational constraints [9], [10].”
BackgroundZhang, Y., Liu, Z., Wang, F., & Chen, Z. (2024) · Transactions of the Institute of Measurement and Control · doi:10.1177/01423312241287248 · Cited by 3
“Mesbahi and Egerstedt (2010) under Assumption 1, L is positively semidefinite, and H = L + B is positively definite.”
Cyclic pursuit formation control for arbitrary desired shapes
Fujioka, A., Ogura, M., & Wakamiya, N. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.107467 · Cited by 1
Forced Symmetric Formation Control
Zelazo, D., Tanigawa, S., & Schulze, B. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3525814 · Cited by 1
“However, the set X 0 itself may be difficult to characterize, and Theorem 3 does not guarantee, for example, convergence to the correct symmetric Authorized licensed use limited to the terms of the applicable license agreement with IEEE.”
InfluentialNojavanzadeh, D., Liu, Z., Saberi, A., et al. (2025) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.3953 · Cited by 1
Cluster Consensus Problem on Time-varying Higher-Order Interaction Networks
Wei, H., Pan, L., Shao, H., et al. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10885948 · Cited by 1
“The collective behaviors that emerged from local interactions amongst neighboring agents play a key role in the design of multi-agent systems [1], [2], [3].”
Network Learning with Directional Sign Patterns
Dong, A., Chen, C., & Georgiou, T. T. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886518 · Cited by 1
“Complex interactions between multiple subsystems can often be encoded in a networked structure that models respective relations [22].”
Wang, N., Restrepo, E., & Dimarogonas, D. V. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886499 · Cited by 1
“Let E ( t ) : R ≥ 0 → R N × M denote the (unknown) incidence matrix function of G ( t ) from [1] and recall that M denotes the number of edges.”
Bearing-distance flocking with zone-based interactions in constrained dynamic environments
Jond, H. B. (2025) · Journal of Computational Science · doi:10.1016/j.jocs.2025.102574 · Cited by 1
“…in terms of x and ˙ x as By substituting (38) into the edge interaction dynamics (37), the resulting closed-loop system is then of the form where ( D ⊤ ⊗ I d ) D s and ( D ⊤ ⊗ I d ) D a are the edge Laplacian-alike matrices of the directed graph G and positive definite when G is spanning tree [23].”
Dynamic Feedback Strategies for Duopolies Over Partially Observed Consumer Networks
Ahmed, S., & Sayin, M. O. (2025) · Dynamic Games and Applications · doi:10.1007/s13235-025-00656-0 · Cited by 1
A Passivity Analysis Tool for Linear Clustered Multi-Agent Systems
Şuşcă, M., Mihaly, V. M., Lendek, Z., et al. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2025.3578037 · Cited by 1
Distributionally Robust Model Order Reduction for Linear Systems
Liu, L., Kawano, Y., Dou, Y., et al. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2025.3581495 · Cited by 1
“L ARGE, complex engineering systems exhibit in various forms, in e.g., robotic, energy and manufacturing systems[1], [2].”
Liu, Z., Wu, S., Liu, T., & Jiang, Z. (2025) · Automatica · doi:10.1016/j.automatica.2025.112404 · Cited by 2
Chen, Y., & Liu, T. (2025) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc65474.2025.11090594 · Cited by 1
“Over the past decade, driven by the rapid advancements in both the theory and applications of networked multi-agent systems, cooperative control problems have gained substantial interest [2], [3], [13].”
Graph-Based Dynamics and Network Control of a Single Articulated Robotic System
Lane, J., & Hyun, N.-S. P. (2025) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc63710.2025.11107566 · Cited by 1
“Definition 1 (Definition 3.7 in [14]) .”
InfluentialConsensus Problem of Asymmetric Higher-Order Interaction Multi-agent Networks
Wei, H., Pan, L., Shao, H., et al. (2025) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc63710.2025.11107776 · Cited by 1
“Reaching a global consensus through local interactions among neighboring agents is a fundamental building block for achieving collective tasks of multi-agent systems [1], [2].”
Versatile Distributed Maneuvering With Generalized Formations Using Guiding Vector Fields
Lu, Y., Luo, S., Zhu, P., Yao, W., de Marina, H. G., Zhang, X., & Xu, X. (2025) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra55743.2025.11127716 · Cited by 1
“Moreover, based on the GVFs, we design a controller algorithm for a nonholonomic robot model.”
InfluentialOn consensus equilibria in a multilayered multiagent system
Leonidov, A. V., Vasilyev, S., & Vasilyeva, E. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.117242 · Cited by 1
Cooperative Path Planning for Mobile Robot Formation
Pham, Q.-H., & Филимонов, Н. Б. (2025) · International Conference on Control in Technical Systems (CTS) · doi:10.1109/cts67336.2025.11196509 · Cited by 1
“The Laplacian matrix L defines the continuous-time consensus dynamics: Theorem [14].”
Bhatia, P., Roy, S. B., Sujit, P. B., et al. (2025) · International Journal of Systems Science · doi:10.1080/00207721.2025.2583240 · Cited by 1
“Agents in such networks must work together to achieve system-level goals, while having limited computing resources, local communications and sensory capabilities (Mesbahi & Egerstedt, 2010).”
VoI-aware Scheduling Schemes for Multi-Agent Formation Control
Chiariotti, F., & Fabris, M. (2025) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2025.12.071 · Cited by 1
“…this work we consider multi-agent systems that can be topologically represented by an undirected graph G = ( V , E , W ), consisting of the set of nodes V , the set of edges E and the set of weights W (see also Mesbahi and Egerstedt (2010) for a detailed discussion on multi-agent network modeling).”
Distributed Multi-Agent Coordination over Cellular Sheaves
Hanks, T., Riess, H., Cohen, S., Gross, T., Hale, M., & Fairbanks, J. (2025) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc57313.2025.11312066 · Cited by 14
“In this literature, distributed optimization [12] is commonly integrated with cooperative control strategies in order to simultaneously pursue individual goals as well as shared common objectives [13].”
Multiagent Approach to Building Digital Twins of Cities
Leung, Y. (2026) · Advances in spatial science · doi:10.1007/978-3-032-07966-4_7 · Cited by 1
A predefined-time framework for average consensus and distributed optimization
Villeros, P. D., Sánchez‐Torres, J. D., Defoort, M., & Loukianov, A. G. (2026) · Nonlinear Dynamics · doi:10.1007/s11071-025-12008-z · Cited by 1
“The reader is referred to [17, 18] for further details.”
Multi-agent System Control Algorithms for Coordinated Route Movement
Pham, Q. P. (2026) · Известия высших учебных заведений. Приборостроение · doi:10.17586/0021-3454-2025-68-12-1046-1055 · Cited by 1
Self-Learning Control for Multi-Agent Consensus
Zhang, C. (2026) · AppliedMath · doi:10.3390/appliedmath6030037 · Cited by 1
A virtual vehicle approach to distributed control for formation keeping of underactuated vehicles
Roth, Y., Alessandretti, A., Aguiar, A. P., & Jones, C. N. (2015) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1
Droop control of microgrids based on distributed optimization
Yi, P., Liu, F., & Hong, Y. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7261063 · Cited by 1
Coordination of heterogeneous nonlinear multi-agent systems with prescribed behaviors
Yutao, T. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260821 · Cited by 1
Demetriou, M. A. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669186 · Cited by 1
“The set of neighbors of node i is given by Ni = {j ∈ V | (i, j) ∈ E}, [7].”
BackgroundYaxiao, Z., Yangzhou, C., & Aleksandrov, A. Y. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260733 · Cited by 1
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.