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 1,301–1,400 of 2,960
Discrete-time Deployment of Agents on a Line Segment: Delays and Switches Do Not Matter
Aleksandrov, A. Y., Semenov, A., & Fradkov, А. L. (2020) · Automation and Remote Control · doi:10.1134/s0005117920040062 · Cited by 7
Caliciotti, A., & Celsi, L. R. (2020) · International Journal of Control Automation and Systems · doi:10.1007/s12555-019-0129-y · Cited by 7
Deviated Pursuit based Cooperative Simultaneous Interception against Moving Targets
Sinha, A., Mukherjee, D., & Kumar, S. R. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147677 · Cited by 8
“When all λ(L) are arranged in ascending order, the second eigenvalue decides the rate of convergence to the consensus value [32].”
BackgroundCesarone, F., & Pepe, P. (2020) · European Journal of Control · doi:10.1016/j.ejcon.2020.09.009 · Cited by 7
Digraphs with distinguishable dynamics under the multi-agent agreement protocol
Rahimian, M., Ajorlou, A., & Aghdam, A. (2014) · D-Scholarship@Pitt (University of Pittsburgh) · Cited by 7
Optimal Selection of Informed Agents for Influence Opposition
Ghezelbash, E., Yazdanpanah, M. J., Asadpour, M., & Yaghmaei, A. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2020.3043295 · Cited by 6
Processes for a Colony Solving the Best-of-N Problem Using a Bipartite Graph Representation
Jain, P., & Goodrich, M. A. (2022) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-92790-5_29 · Cited by 8
“Both theoretical and empirical results can be derived for graph-based models, complementing the results provided by differential equation models [40, 31].”
ResultEvent/Self-Triggered Multi-Agent System Rendezvous with Graph Maintenance
Zegers, F. M., Guralnik, D. P., & Dixon, W. E. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683276 · Cited by 7
Safety Control of a Class of Fully Actuated Systems Subject to Uncertain Actuation Dynamics
Wu, S., & Liu, T. (2022) · Journal of Systems Science and Complexity · doi:10.1007/s11424-022-2093-5 · Cited by 7
“Developing new safety analysis and control algorithms has attracted tremendous attention from the control community and the robotics community in recent years [1–6] .”
BackgroundA dynamic network approach to identification of physical systems
Kivits, E. M. M., & den Hof, P. M. J. V. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9030041 · Cited by 7
“Other examples of dynamic networks are biological and chemical processes, neural networks, consensus networks, synchronisation, social interactions, the Internet, the stock market and multi-agent systems [1], [2], [3].”
BackgroundDecentralized observer with a consensus filter for distributed discrete-time linear systems
Acikmese, B. A., & Mandić, M. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990815 · Cited by 7
“We refer to [34] for a graph theoretic view of multi-agent networks.”
MethodSato, K. (2019) · Automatica · doi:10.1016/j.automatica.2019.02.005 · Cited by 7
“1) where x(t) 2Rn and L 2R n denote the state and graph Laplacian, respectively; e.g., system (1) includes biochemical systems [1, 2, 3, 4], synchronization systems [5, 6, 7], and multi-agent systems [8, 9, 10]. The graph Laplacian L is determined by the connection relationship of edges of a given graph (i.e., the net…”
BackgroundRobust Consensus for Multi-Agent Systems Communicating over Stochastic Uncertain NetworksPreprint
Li, Z., & Chen, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.09877 · Cited by 7
“l of (vi,vj), dij = 1 if vi is the head of (vi,vj), and dij = 0 otherwise. The Laplacian matrix L = [Lij] ∈ R N× associated with a graph G is defined as Lii = PN j=1 aij and Lij = −aij, i 6= j. Lemma1([27]) For an undirected graph, L = DWDT , where W is an |E| × |E| diagonal matrix, with positive aij on the diagonal. L…”
BackgroundInfluentialYi, X., Zhang, S., Yang, T., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12110 · Cited by 7
“If the graph G is connected, then its Laplacian matrix L is positive semi-definite and null( L ) = { 1 n } , see [67].”
BackgroundDistributed Cooperative Control for DC Microgrids
Benahmed, S. E. (2021) · theses.fr (ABES) · doi:10.70675/b46ce292za1b5z4609zb258z7bc607fa1987 · Cited by 8
Surendhar, S., Roy, S. B., & Bhasin, S. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3335957 · Cited by 6
“Assumption 1 [32]: Let G denote the undirected communication graph formed by the group of agents are fully connected, i.e., the Laplacian matrix satisfies 1 T L ( G ) = 0, where 1 = ( 1 , . . . , 1 ) ∈ R N is the corresponding eigenvector for the zero eigenvalue.”
BackgroundOn topological conditions for enabling transient control in leader–follower networks
Chen, F., & Dimarogonas, D. V. (2024) · Automatica · doi:10.1016/j.automatica.2024.111693 · Cited by 6
Takahashi, Y., Shim, S., & Sakai, S.-I. (2025) · AIAA SciTech Forum · doi:10.2514/6.2025-2068 · Cited by 6
Shi, G., Fu, S., & Petersen, I. R. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170717 · Cited by 6
“As an analogue of classical distributed consensus control [2], [3], [7], [1], recently consensus and synchronization seeking in quantum networks has also drawn attention [8], [9], [11], [14], [21], [22], partially due to the fact that composite quantum systems naturally inherit a network structure [4], [6], [5].”
BackgroundAn Active-Passive Networked Multiagent Systems Approach to Environment Surveillance
Peterson, J., & Yucelen, T. (2015) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2015-2004 · Cited by 6
Compositional construction of abstractions via relaxed small-gain conditions Part II: discrete case
Noroozi, N., Swikir, A., Wirth, F. R., & Zamani, M. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550268 · Cited by 7
“As shown in [6], this conservatism can be relaxed by splitting the corresponding graph of the network Σ into strongly connected subgraphs [17] and then applying Theorem 14 to each strongly connected subgraph.”
BackgroundPursuer Coordination in Multi-Player Reach-Avoid Games through Control Barrier Functions
Davydov, A., Rivera-Ortiz, P. M., & Diaz-Mercado, Y. J. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483310 · Cited by 6
Consensus problems in multiagent systems: A vector based contraction approach
Singh, B., Xiong, X., Kamal, S., Ghosh, D., & Ghosh, S. (2021) · IET Control Theory and Applications · doi:10.1049/cth2.12185 · Cited by 6
Şekercioğlu, P., Sarras, I., Lorı́a, A., Panteley, E. V., & Marzat, J. (2024) · International Journal of Control · doi:10.1080/00207179.2024.2354845 · Cited by 8
“Moreover, we recast the problem stated above into the space of the synchronisation errors using the edge-based framework (Mesbahi & Egerstedt, 2010).”
Bipartite Formation over Undirected Signed Networks with Collision Avoidance
Şekercioğlu, P., Sarras, I., Lorı́a, A., et al. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383701 · Cited by 6
“…i and x j , the error becomes with Thus, the bipartite-consensus objective for (1) is equivalent to making In that light, we remark that the synchronization errors correspond to edge states [13], which are particularly well-suited to multi-agent systems under state constraints, such as (5) and (6).”
BackgroundMethodInfluentialPrivacy-preserving distributed state estimation in smart grid
Dai, X., Yang, H., Gu, H., et al. (2024) · Electric Power Systems Research · doi:10.1016/j.epsr.2024.110203 · Cited by 6
Scalable, Federated Gaussian Process Training for Decentralized Multi-Agent Systems
Kontoudis, G. P., & Stilwell, D. J. (2024) · IEEE Access · doi:10.1109/access.2024.3408143 · Cited by 13
“Assumption 1 ([35]): A graph G is strongly connected if for every pair of distinct agents ( v i , v j ) there exists a path.”
BackgroundZhang, S., Wu, W., Li, Z., Chen, J., & Georgiou, T. T. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3413854 · Cited by 8
“For a more detailed exposition, see [32], [33].”
A Networked Multiagent System for Mobile Wireless Infrastructure on Demand
Calvo-Fullana, M., Gerasimenko, M., Mox, D., et al. (2024) · IEEE Transactions on Robotics · doi:10.1109/tro.2024.3463493 · Cited by 6
“To do so, we obtain the Laplacian of the graph, given by In Appendix B, we illustrate how strengthening the connectivity of the graph is equivalent to maximizing the second eigenvalue of the Laplacian [35], also known as Fiedler value .”
MethodCellier-Devaux, A., Astolfi, D., & Andrieu, V. (2024) · Automatica · doi:10.1016/j.automatica.2024.111950 · Cited by 7
“To overcome such a difficulty, we revisit the graph theory and the properties of the incidence matrix connecting the Laplacian and the edge Laplacian in [20, Chapter 2].”
MethodLiu, S., Saoud, A., & Dimarogonas, D. V. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3549288 · Cited by 9
“Note that the interaction topology plays an important role in the analysis and synthesis of networked multiagent systems [5].”
Structural monostability of activation-inhibition Boolean networks
Azuma, S., Yoshida, T., & Sugie, T. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039615 · Cited by 6
“An example is given by x1(t+ 1) = x4(t), x2(t+ 1) = x̄1(t), x3(t+ 1) = x2(t), x4(t+ 1) = x2(t) ∨ x̄3(t), (2)”
BackgroundInfluentialExperiments of obstacles and collision avoidance with a distributed multi-robot system
Arrichiello, F., Chiaverini, S., & Mehta, V. K. (2012) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2012.6246771 · Cited by 6
“The book [9] provides an introduction to analysis and design of dynamic multi agent networks focusing on graph theoretic methods.”
MethodDyundyukov, V. S., & Tarassov, V. B. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130619-3-ru-3018.00635 · Cited by 6
“Graph-theoretic methods for multi-agent systems are considered in [Mesbahi and Egerstedt, 2010].”
BackgroundMethodDistributed Kalman filters with adaptive strategy for linear time‐varying interconnected systems
Heydari, M., & Demetriou, M. A. (2015) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.2654 · Cited by 6
“Additionally, the graph G is also represented by its Laplacian matrix L D D (cid:2) A , where D and A are the degree and adjacency matrices, respectively, [20, 21].”
BackgroundSomarakis, C., & Baras, J. S. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7403255 · Cited by 6
“The history of consensus systems is very long as they are considered to be the underlying mathematical model for co-operative biological, social, robotic networks [6], [12], [14], [15].”
BackgroundCustomized algorithms for growing connected resistive networks
Moghaddam, S. H., & Jovanović, M. R. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.10.293 · Cited by 6
Trajectory planning for vascular navigation from 3D angiography images and vessel centerline data
Azizi, A., Tremblay, C., & Martel, S. M. (2017) · International Conference on Manipulation, Automation and Robotics at Small Scales (MARSS) · doi:10.1109/marss.2017.8001931 · Cited by 6
“there must be no loop within the network [15].”
BackgroundFurther Results on Finite-Time Distributed Control of Multiagent Systems With Time Transformation
Arabi, E., Yucelen, T., & Singler, J. R. (2018) · doi:10.1115/dscc2018-8959 · Cited by 6
Maximum-Based Consensus and Its Resiliency
Nakamura, M., Ishii, H., & Dibaji, S. M. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.049 · Cited by 6
Scalar field estimation with mobile sensor networks
Razak, R. A., Sukumar, S., & Chung, H. (2021) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5469 · Cited by 6
“Now, corresponding to each a, we construct a directed graph with a rooted outbranching (see [29]), denoted Gi which is a subgraph of the undirected graph G with mobile sensor i as the root node.”
BackgroundWang, L., Sun, Z., & Cao, Y. (2019) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2019.06.046 · Cited by 7
A travelling wave approach to a multi-agent system with a path-graph topology
Martinec, D., Herman, I., & Šebek, M. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.12.001 · Cited by 6
“A popular tool for the convergence analysis of multi-agent systems comes from the algebraic graph theory, for instance, the spectral properties of the Laplacian matrix, see [20], [25] and [27] for a thorough overview.”
Intermittent Connectivity for Exploration in Communication-Constrained Multi-Agent Systems
Klaesson, F., Nilsson, P., Ames, A. D., et al. (2020) · ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS) · doi:10.1109/iccps48487.2020.00031 · Cited by 6
“Significant effort has been devoted to study connectivity in continuous models [1], [2], [3].”
BackgroundRezaei, V., & Stefanovic, M. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.1094 · Cited by 6
“A directed graph or digraph G is a collection of nodes V and directed edges E : V × V which can be characterized by its adjacency matrix A or Laplacian matrix L whose definitions can be found in the standard texts (Mesbahi and Egerstedt, 2010).”
BackgroundMethodPerformance Analysis and Optimal Design of Time-Delay Directed Consensus Networks
Dezfulian, S., Ghaedsharaf, Y., & Motee, N. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3094790 · Cited by 6
“A directed path in graph G is a sequence of distinct nodes of the graph which are connected to each other by a sequence of edges [20].”
H∞ network optimization for edge consensus
Farhat, O., Jaoude, D. A., & de Badyn, M. H. (2021) · European Journal of Control · doi:10.1016/j.ejcon.2021.06.032 · Cited by 6
“A common simplifying approach to address such theoretical questions is to assume that the agents in the network are single integrator units [35].”
BackgroundRES Based Islanded DC Microgrid with Enhanced Electrical Network Islanding Detection
Shahid, M. U., Alquthami, T., Siddique, A., et al. (2021) · Energies · doi:10.3390/en14248432 · Cited by 6
Avoiding Flip Ambiguities During Sequentially-Grown Formations
Sahebsara, F., & de Queiroz, M. S. (2021) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2021.11.246 · Cited by 6
Zhang, S., Lv, Y., & Li, Z. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3169880 · Cited by 7
“Lemma 6 ([27]): For an undirected graph G, the Laplacian matrix L = DWD , where W = diag{w1, w2, .”
BackgroundMinimal Controllability Problem on Linear Structural Descriptor Systems With Forbidden Nodes
Terasaki, S., & Sato, K. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3268288 · Cited by 6
“Controllability analysis for large-scale network systems, such as multi-agent systems [1], [2], brain networks [3], [4], and power networks [5], [6] has received a great deal of interest in recent years, because it can be used to find important nodes [7].”
BackgroundGiannini, F., Fortino, G., Franzè, G., et al. (2022) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit55151.2022.9803896 · Cited by 6
“The coordination and control of multi-vehicle systems have attracted the attention of several researchers in the last decades a testified by relevant review contributions, see e.g., [2], [3].”
BackgroundOn Asymptotic Stability of Leader–Follower Multiagent Systems Under Transient Constraints
Restrepo, E., & Dimarogonas, D. V. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3182846 · Cited by 6
“Without loss of generality, suppose that the first N F N agents are followers while the last N L N are leaders with All the agents are governed by a consensus-based protocol—cf. [16], but only the leader agents, i.e., i ∈ V L can be directly controlled via an additional control input.”
BackgroundÁvila-Martínez, E. J. (2022) · Advanced Robotics · doi:10.1080/01691864.2022.2112075 · Cited by 6
“We model the dynamical network through a state-dependent graph [28].”
MethodSplitting and merging control of multiple platoons with Signal Temporal Logic
Charitidou, M., & Dimarogonas, D. V. (2022) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta49430.2022.9966040 · Cited by 6
“A component of G [28] is a subset of G, associated with a minimal partitioning of the vertex set, such that each partition is connected.”
BackgroundSarioglu, E., Kurttisi, A., & Dogan, K. M. (2023) · AIAA SciTech Forum · doi:10.2514/6.2023-0508 · Cited by 6
Synchronization in Electrical Circuits With Memristors and Grounded Capacitors
Huijzer, A.-M., van der Schaft, A. J., & Besselink, B. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3282102 · Cited by 6
“Circuits of this class have dynamics that can be related to the literature on consensus networks (including dynamics on the edges) for which synchronisation is studied regularly [18], [19], [20].”
BackgroundRamachandran, K., & Juang, J. (2023) · International Journal of Control Automation and Systems · doi:10.1007/s12555-022-0682-7 · Cited by 6
“For further details about graph theory one can refer [47].”
BackgroundDistributed Control for Multi-Robot Interactive Swarming Using Voronoi Partioning
Eudes, A., Bertrand, S., Marzat, J., et al. (2023) · Drones · doi:10.3390/drones7100598 · Cited by 6
Rezaei, M. A., Bagheri, P., & Hashemzadeh, F. (2023) · Optimal Control Applications and Methods · doi:10.1002/oca.3076 · Cited by 6
Controllability Backbone in Networks
Ahmad, O. U., Shabbir, M., & Abbas, W. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383398 · Cited by 6
“For instance, network controllability, connectivity, robustness to failures, information dissemination, and influence evolution in networks rely on the underlying network topology [1].”
BackgroundThe Bounded Gaussian Mechanism for Differential Privacy
Chen, B., & Hale, M. (2024) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.850 · Cited by 13
Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
Matsume, H., Wang, Y., Ishii, H., et al. (2024) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2024.101473 · Cited by 6
Consensus control protocols for nonlinear dynamical systems via hybrid stabilization of sets
Haddad, W. M., Nersesov, S. G., & Ghasemi, M. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669188 · Cited by 6
“Recent technological advances in communications and computation have spurred a broad interest in control of networks and control over networks [3].”
BackgroundSecurity and Infiltration of Networks: A Structural Controllability and Observability Perspective
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_9 · Cited by 6
A decentralized fault detection and isolation strategy for networked robots
Arrichiello, F., Marino, A., & Pierri, F. (2013) · International Conference on Advanced Robotics (ICAR) · doi:10.1109/icar.2013.6766562 · Cited by 6
“Such control algorithms often make use of graph theoretic methods that allow extracting analytical properties of the system on the base of the properties of the communication network they form [12].”
BackgroundFrom Global, Finite-Time, Linear Computations to Local, Edge-Based Interaction Rules
Costello, Z., & Egerstedt, M. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2380643 · Cited by 5
“The initial state is x(t0) = [1, 2, 3, 4]n and the final state is x(tf ) = [2, 1, 4, 3]n, i.”
BackgroundSelf-citationHierarchical distributed stabilization of power networks
Ishizaki, T., Sadamoto, T., & Imura, J. (2014) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2014-02275-x · Cited by 6
“By direct calculation, the Jacobian matrix of F is obtained as A := ∂F ∂x ∣∣∣∣ x=0 = diag(E1, . . . , EJ) + diag(k1, . . . , kJ)Πdiag(l1, . . . , lJ) ∈ Rn×n (10) where ki := { 1 Mi [0 1 0] T , i ∈ G 1 Mi [0 1]T, i ∈ L, li := { [1 0 0], i ∈ G [1 0], i ∈ L, and Π = ΠT is a weighted graph Laplacian [7] whose (i, j)-eleme…”
Broadcast control of group of Markov chains
Azuma, S., Baba, I., & Sugie, T. (2012) · doi:10.1109/cdc.2012.6427084 · Cited by 6
“, [1]–[4]), the broadcast control would be a key technique dealing with large-scale systems.”
BackgroundAdaptive consensus filters of spatially distributed systems with limited connectivity
Demetriou, M. A. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6759921 · Cited by 6
“Following [15], one can argue that the weighted graph Laplacian L with γi 6= γj will also have one zero eigenvalue and the others positive.”
BackgroundXu, Y., Remeikas, C., & Pham, K. D. (2013) · International Journal of Control · doi:10.1080/00207179.2013.845911 · Cited by 8
“…attention in many applications (Dong & Farrell, 2008; Dunbar & Murray, 2004; Ferrari, Pagello, Ota, & Arai, 1998; Girard, de Sousa, & Hedrick, 2001; Mesbahi & Egerstedt, 2010; Qu, 2009; Qu, Wang, & Hull, 2008; Ren & Beard, 2008), such as monitoring of forest fires, border security, air traffic,…”
BackgroundLTI continuous time consensus dynamics with multiple and distributed delays
Somarakis, C., & Baras, J. S. (2013) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2013.6608919 · Cited by 6
“The integral of motion for this system is qT x where q is the left eigenvector of the (indegree) Laplacian L (see [6]).”
BackgroundInfluentialConsensus of multi-agent nonlinear dynamic systems under slow switching topology
Wang, J., Chen, K., & Zhang, Y. (2014) · doi:10.1109/ccdc.2014.6852338 · Cited by 6
Synchronization and collision avoidance in non-linear flocking networks of autonomous agents
Somarakis, C., Paraskevas, E., Baras, J. S., et al. (2016) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2016.7536030 · Cited by 6
“The most prominent family of cooperative algorithms is this of the consensus networks (see for example [7], [9], [10], [11], [13], [17], [22] and references therein).”
BackgroundGnecco, G., Bemporad, A., Gori, M., & Sanguineti, M. (2017) · Neural Computation · doi:10.1162/neco_a_00976 · Cited by 5
“, in [35], and in the series of papers [14, 15, 19], where Least Squares Support Vector Machines (LS-SVMs) and one-hidden-layer perceptron neural networks, respectively, were applied to find suboptimal solutions to optimal control problems, and in [25], where spectral graph theory methods were applied to the control o…”
MethodLearning without Recall from actions of neighbors
Rahimian, M. A., & Jadbabaie, A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525055 · Cited by 6
“The problem of social learning has close siblings in distributed estimation [9], [10], and statistical learning theory [11]; while relations can be also traced to the consensus and coordination problems that are studied in the distributed control theory [12], [13].”
BackgroundVerification and prediction of structural balance: A data-driven perspective
Pan, L., Shao, H., & Mesbahi, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525352 · Cited by 6
“In a consensus network with only positively weighted edges, agreement is achieved if the network is connected [14].”
BackgroundSelf-citationCooperative control of multiple satellites via consensus
Zhang, H., & Gurfil, P. (2016) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2016.7536011 · Cited by 6
“Basic Graph Theory A satellite network of N satellites with two-way intersatellite communication is represented as an undirected graph G = (V ,E ), where V = {1,2, · · · ,N} is a vertex set and E ⊆ V ×V is an edge set [14].”
BackgroundMajority Rule in Nonlinear Opinion Dynamics
Gabbay, M., & Das, A. (2013) · Understanding complex systems · doi:10.1007/978-3-319-02925-2_15 · Cited by 6
Dragicevic, A. Z., Boulanger, V., Bruciamacchie, M., Chauchard, S., Dupouey, J., & Stenger, A. (2017) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2017.02.026 · Cited by 6
Algebraic connectivity of network-of-networks having a graph product structure
Lee, H.-J., Nguyen, L. T. H., & Fujisaki, Y. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.03.003 · Cited by 6
An agent-based framework for bio-inspired, value-sensitive decision-making
Gray, R., Franci, A., Srivastava, V., & Leonard, N. E. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1392 · Cited by 7
“From Mesbahi and Egerstedt (2010), a partition of vertices into cells C1, ..., Cr is said to be equitable if each node in Ci has the same number of neighbors in Cj for all i, j.”
BackgroundThe functional regions in structural controllability of human functional brain networks
Yao, P., Li, C., & Li, X. (2017) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2017.8122844 · Cited by 7
“Therefore, by the minimum inputs theorem [28], the minimum number of driver nodes and their locations are identified as the unmatched nodes in a maximum matching in the network.”
BackgroundMulti‐vehicle formation in a controllable force field with non‐identical controller gains
Jain, A., Ghose, D., & Menon, P. P. (2018) · IET Control Theory and Applications · doi:10.1049/iet-cta.2017.0651 · Cited by 6
A game theoretic approach to distributed control of homogeneous multi-agent systems
Mylvaganam, T. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264597 · Cited by 6
“From a control theoretic perspective, designing control laws for multiagent systems may be challenging - in particular when the communication between agents is limited [6], [7].”
BackgroundDissipativity reinforcement in interconnected systems
Inoue, M., & Urata, K. (2018) · Automatica · doi:10.1016/j.automatica.2018.05.006 · Cited by 7
Hybrid framework for consensus in fleets of non-holonomic robots
Borzone, T., Morărescu, I., Marc Jungers, A., Boc, M., & Janneteau, C. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430918 · Cited by 6
“Since then, this domain is flourishing, because many current engineering problems require multiple systems with local sensing and actions, which have to collaborate in order to accomplish a global goal [1].”
BackgroundDistributed Localization of a Moving Target: Structural Observability-based Convergence Analysis
Ennasr, O. N., & Tan, X. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431876 · Cited by 6
“We first note the following property regarding the powers of the matrix W from [20].”
BackgroundDeghat, M., Sun, Z., Nešić, D., et al. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.035 · Cited by 6
“As explained in Mou et al. (2016), for a target formation pGs,dq and each p̄ satisfying p̄ “ r ́1 Gs pd ̊q, where rGspp̄q is defined in (4), there exists an invariant set A containing p̄ such that the rigidity matrix (5) is full row rank for all p P A.”
BackgroundMethodInfluentialRelative tempo of distributed averaging on networks
Shao, H., Pan, L., Mesbahi, M., et al. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.004 · Cited by 6
Self-citationExperimental Verification of a Coordinated Path-Following Strategy for Underactuated Marine Vehicles
Belleter, D. J. W., Braga, J., & Pettersen, K. Y. (2019) · Frontiers in Robotics and AI · doi:10.3389/frobt.2019.00035 · Cited by 6
“To describe the communication between the LAUVs we utilize graph theory (see for instance Mesbahi and Egerstedt, 2010).”
MethodReduced Order Modeling of Linear Consensus Networks using Weight Assignments
Cheng, X., Yu, L., & Scherpen, J. M. A. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8795611 · Cited by 6
“, distributed coordination, control of power grids and chemical reaction networks, consensus networks are often considered [1]–[3].”
BackgroundProportional Power-Sharing Control of Distributed Generators in Microgrids
Aalipour, F., & Das, T. (2021) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2021.3068386 · Cited by 6
“From the Weyl’s theorem on eigenvalue inequalities for sum of two Hermitian matrices [30], the properties of Laplacian matrices in a connected network [29], and Lemma 1, we have”
BackgroundA Distributed Cooperative Control Strategy of Offshore Wind Turbine Groups with Input Time Delay
Wang, B., Tang, Z., Liu, W., et al. (2020) · Sustainability · doi:10.3390/su12073032 · Cited by 6
“In this paper, some basic concepts of graph theory are introduced to provide the theoretical basis for the following controller design [35].”
BackgroundUsing Reinforcement Learning to Herd a Robotic Swarm to a Target Distribution
Kakish, Z., Elamvazhuthi, K., & Berman, S. (2022) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-92790-5_31 · Cited by 12
“There has been a considerable amount of work on leader-follower multi-agent control schemes in which the leader has an attractive effect on the followers [2,3].”
BackgroundBorovykh, A., Kantas, N., Parpas, P., et al. (2021) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2021.132844 · Cited by 6
“is zero and L1 dN = 0. We will return to this point in Section 4. We assume throughout that the network graph corresponding to the Laplacian is connected, which in turn implies that Lhas eigenvalues ([28]): 0 = 0 < 3 ::: dN: We thus denote by the smallest non-zero eigenvalue of the Laplacian. 3.2 Convergence of ISM…”
BackgroundInfluentialTeke, O., & Vaidyanathan, P. P. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3014442 · Cited by 6
“…algorithms play an important role in processing data over networks, and they have been studied extensively for many different problem formulations, ranging from distributed sensor localization [12]–[14] and the controlling network of agents [15], [16] to opinion dynamics [17] and PageRank FIGURE 1.”
BackgroundDistributed control of linear multiagent systems with global and local objectives
Sarsılmaz, S. B., & Yucelen, T. (2021) · Systems & Control Letters · doi:10.1016/j.sysconle.2021.104928 · Cited by 6
Gkesoulis, A. K., Psillakis, H. E., & Wang, Q. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3094785 · Cited by 6
Silva, T. C., Leite, V. J. S., Souza, F. O., & Pimenta, L. C. A. (2022) · International Journal of Control · doi:10.1080/00207179.2022.2053207 · Cited by 6
“A finite, directed, simple graph is built upon a finite set called vertex set denoted by V = {v1, . . . , vn} (Mesbahi & Egerstedt, 2010).”
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.