The DOI matches its Crossref record.
Graph Theoretic Methods in Multiagent Networks
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 701–800 of 2,960
Fedele, G., D’Alfonso, L., & Gazi, V. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3141012 · Cited by 17
Nash equilibrium seeking over directed graphs
Tang, Y., Yi, P., Zhang, Y., et al. (2022) · Autonomous Intelligent Systems · doi:10.1007/s43684-022-00026-2 · Cited by 17
“In multi-agent coordination literature, the information structure (or the information sharing topology) among agents is often described by graphs [7].”
BackgroundMethodA Decomposition Approach to Multiagent Systems With Bernoulli Packet Loss
Hespe, C., Saadabadi, H., Datar, A., et al. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3275917 · Cited by 17
“On the other hand, there are approaches that consider not identical loss but uniform loss probability , e.g., [2], [10], [11], [12].”
BackgroundInfluentialZhang, M., Saberi, A., Stoorvogel, A. A., et al. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171148 · Cited by 17
“The objective of synchronization is to guarantee an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [10], [15], [23]).”
BackgroundPeterson, J., Yucelen, T., Chowdhary, G. V., et al. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171974 · Cited by 17
“We first recall some of the basic notions from graph theory and refer to [3], [22] for further details.”
BackgroundDeformable-medium affordances for interacting with multi-robot systems
Diana, M., de la Croix, J.-P., & Egerstedt, M. (2013) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2013.6697116 · Cited by 17
“The main line of thought is to use so-called leader-based interactions, where the user interacts directly with a small subset of the agents, e.g., [5], [12].”
BackgroundSelf-citationSelective pattern formation control: Spatial spectrum consensus and Turing instability approach
Kashima, K., Ogawa, T., & Sakurai, T. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.019 · Cited by 17
“…research effort on diffusively coupled dynamical systems, due to their connection to consensus protocol ofmulti-agent systems (Fax & Murray, 2004; Mesbahi & Egerstedt, 2010), coupled oscillators (Shafi, Arcak, Jovanović, & Packard, 2013; Stan & Sepulchre, 2007; Steur, Tyukin, &Nijmeijer, 2009),…”
BackgroundMenon, P. P., Edwards, C., & Paulino, N. M. G. (2015) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.0773 · Cited by 17
“In [20] the application of graph theoretic methods to a number of different applications including satellite formation problems [14] is discussed.”
BackgroundMethodInfluentialDistributed convergence to Nash equilibria by adversarial networks with undirected topologies
Gharesifard, B., & Cortés, J. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315270 · Cited by 16
“These works build on consensus-based dynamics [5], [6], [7], [8] to find the solutions of the optimization problem in a variety of scenarios and are designed in discrete time.”
BackgroundSomarakis, C., & Baras, J. S. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330758 · Cited by 16
“This automatically ensures the applicability of an abundance of results from linear algebra, algebraic graph theory, probability theory [15], [1], [10], [4] towards proving asymptotic consensus.”
BackgroundCommunicability angles reveal critical edges for network consensus dynamics
Estrada, E., Vargas-Estrada, E., & Ando, H. (2015) · Physical Review E · doi:10.1103/physreve.92.052809 · Cited by 15
“For the sake of simulations it is sometimes useful to consider the discrete-time model of consensus, whose equation can be written as follows [2,3]:”
BackgroundMethodDibaji, S. M., & Ishii, H. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.10.302 · Cited by 17
Local Lyapunov Functions for Consensus in Switching Nonlinear Systems
Thunberg, J., Xiaoming Hu, A., & Gonçalves, J. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2652302 · Cited by 16
“For linear dynamics, many results have centered around graph theoretic concepts such as the graph Laplacian matrix and its importance for the convergence [4], [5], [20].”
BackgroundMayya, S., Pierpaoli, P., Nair, G., & Egerstedt, M. (2017) · Robotics: Science and Systems · doi:10.15607/rss.2017.xiii.044 · Cited by 18
Self-citationSynchronisation of heterogeneous Kuramoto oscillators with sampled information and a constant leader
Giraldo, J., Mojica‐Nava, E., & Quijano, N. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1454604 · Cited by 17
“…= ωi − N∑ j=1 ai j sin(θi − θ j), (1) for all i ∈ V , whereDi > 0 is a damping or viscous coefficient that introduces multiple time-constants, and aij are the elements of the adjacencymatrixAp, which describes the physical interconnection of all the oscillators (Mesbahi & Egerstedt, 2010).”
BackgroundChang, Y., Wu, C.-I., & Lin, H.-W. (2018) · International Journal of Control Automation and Systems · doi:10.1007/s12555-016-0587-4 · Cited by 19
Space-Based Relative Orbit Estimation Using Information Sharing and the Consensus Kalman Filter
Wang, J., Butcher, E. A., & Yucelen, T. (2018) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g003503 · Cited by 17
Generalized Coverage Control for Time-Varying Density Functions
Kennedy, J., Chapman, A., & Dower, P. M. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796308 · Cited by 17
Multi‐agent consensus for distributed power dispatch with load balancing
Hanada, K., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2019) · Asian Journal of Control · doi:10.1002/asjc.2257 · Cited by 16
“A graph Laplacian is useful because it gives some important characteristics of a network, such as the algebraic connectivity (the second smallest eigenvalue of the graph Laplacian) [6].”
BackgroundAn exponential type control design for autonomous vehicle platoon systems
Zhao, X., Ju, J., Dong, F., et al. (2020) · Asian Journal of Control · doi:10.1002/asjc.2279 · Cited by 17
Generic identifiability of subnetworks in a linear dynamic network: The full measurement case
Shi, S., Cheng, X., & den Hof, P. M. J. V. (2021) · Automatica · doi:10.1016/j.automatica.2021.110093 · Cited by 17
“Due to the increasing complexity of current technological systems, the study of large-scale interconnected dynamic systems receives considerable attention (Cheng & Scherpen, 2021; Ishizaki, Chakrabortty, & Imura, 2018; Mesbahi & Egerstedt, 2010).”
BackgroundDistributed adaptive stabilization
Sun, Z., Rantzer, A., Li, Z., et al. (2021) · Automatica · doi:10.1016/j.automatica.2021.109616 · Cited by 17
“Since the underlying graph is connected which implies null(H̄) = span(1N ⊗ In) [36], the convergence ‖H̄x‖ → 0 is equivalent to that xi(t) → xj(t), ∀(i, j) exponentially fast ∀t > t, i.”
Ebel, H., & Eberhard, P. (2021) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs50823.2021.9620541 · Cited by 17
Decentralized Design and Plug-and-Play Distributed Control for Linear Multichannel Systems
Kim, T., Lee, D., & Shim, H. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3293036 · Cited by 17
“We use standard terminology for graphs as in [8], and consider undirected and connected graphs in this article.”
MethodClustered model reduction of interconnected second-order systems
Ishizaki, T., & Imura, J. (2015) · Nonlinear Theory and Its Applications IEICE · doi:10.1587/nolta.6.26 · Cited by 17
“Examples of such interconnected systems include power networks, transportation networks, communication networks and so forth; see [1, 2] for an overview.”
BackgroundConsensus-based Distributed Kalman-Bucy Filter for Continuous-time Systems
Wu, J., Elser, A., Zeng, S., & Allgöwer, F. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.10.417 · Cited by 17
Distributed adaptive control of networked multiagent systems with heterogeneous actuator dynamics
Dogan, K. M., Gruenwald, B. C., Yucelen, T., et al. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963827 · Cited by 17
“Next, we recall some basic notions from graph theory, where we refer to [18], [19] for further details.”
Krishna, A., Schiffer, J., & Raisch, J. (2019) · European Journal of Control · doi:10.1016/j.ejcon.2019.08.003 · Cited by 17
Sliding mode coordination control for multiagent systems with underactuated agent dynamics
Ghasemi, M., Nersesov, S. G., Clayton, G. M., & Ashrafiuon, H. (2014) · International Journal of Control · doi:10.1080/00207179.2014.936043 · Cited by 16
“The use of graph-theoretic methods for analysis and synthesis of multiagent networks is presented in Mesbahi and Egerstedt (2010).”
BackgroundMethodPeter, B., Grivet Talocia, S., Quarteroni, A. M., Rozza, G., Wil, S., & Silveira, L. M. (2020) · De Gruyter eBooks · doi:10.1515/9783110499001 · Cited by 39
Scaling the size of a multiagent formation via distributed feedback
Coogan, S., Arcak, M., & Egerstedt, M. (2011) · doi:10.1109/cdc.2011.6160824 · Cited by 16
“36 in [11] to the case of a directed communication topology.”
BackgroundSelf-citationDistributed tracking of first order systems using second-order sliding modes
Davila, J. A. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.00816 · Cited by 16
A general criterion for synchronization of incrementally dissipative nonlinearly coupled agents
Proskurnikov, A. V., Zhang, F., Cao, M., & Scherpen, J. M. A. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330606 · Cited by 16
“During recent decade this phenomenon of self-synchronization has been extensively studied in the frameworks of complex networks [2]–[4] and multi-agent control [5]–[7]; the interest was mainly focused in achieving the synchrony between the nodes of the network, or agents , via local interactions.”
Network discovery: An estimation based approach
Chowdhary, G. V., Egerstedt, M., & Johnson, E. N. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5991476 · Cited by 16
“There have been significant advances in control of networked systems using information available only at the agent level, including reaching consensus in networked systems, formation control, and distributed estimation (see for example [15], [5]).”
BackgroundSelf-citationProximal Alternating Direction Method of Multipliers for distributed optimization on weighted graphs
Meng, D., Fazel, M., & Mesbahi, M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402406 · Cited by 15
“distributed tracking and localization, estimation problems in sensor networks, multi-agent coordination; see recent surveys [1], [2], [3] and papers [4], [5], [6] for more applications.”
BackgroundSelf-citationE-MAC: An evolutionary solution for collision avoidance in wireless ad hoc networks
Zhao, H., Wei, J., Sarkar, N. I., et al. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.02.010 · Cited by 16
“This process is modeled as a set of pulse-coupled oscillators (PCO) [19], and has been used to study neuron synchronization [20], distributed synchronization in multi-agent networks [21] and sensor networks[22, 23].”
MethodFrom algorithms to architectures in cyber-physical networks
Egerstedt, M. (2015) · Cyber-Physical Systems · doi:10.1080/23335777.2015.1056234 · Cited by 16
Self-citationThe impact of diversity on performance of holonic multi-agent systems
Esmaeili, A., Mozayani, N., Motlagh, M. R. J., & Matson, E. T. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2016.06.011 · Cited by 17
“The new area of networked systems has attracted wide interest in the literature, under the term of networked multi-agent systems, to deal with this problem (Mesbahi and Egerstedt, 2010).”
BackgroundAlbattat, A., Gruenwald, B. C., & Yucelen, T. (2016) · Sensors · doi:10.3390/s16081297 · Cited by 16
Gaeini, N., Amani, A. M., Jalili, M., et al. (2017) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2017.05.012 · Cited by 16
Consensus for multi-agent systems with time-varying input delays
Yuan, C., & Wu, F. (2017) · International Journal of Systems Science · doi:10.1080/00207721.2017.1363927 · Cited by 16
“Comprehensive overview and summary on distributed multi-agent coordination can be found in the surveys (Cao et al., 2013; Murray, 2007; Ren et al., 2007) and books (Bai, Arcak, & Wen, 2011; Mesbahi & Egerstedt, 2010; Ren & Beard, 2008), among others.”
BackgroundOn algebraic connectivity of directed scale-free networks
Imae, T., & Cai, K. (2018) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2018.07.038 · Cited by 18
Wang, T., Hu, M. Q., & Zhao, Y. (2019) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2019.1911594 · Cited by 16
“Proposition 2 [30]: The projection operator given in (5) follows |ΠM(x)−ΠM(y)| ≤ |x− y|, ∀ x,y ∈ R.”
Badings, T., & van Putten, D. S. (2020) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2020.107567 · Cited by 16
Fully Distributed State Estimation for Power System with Information Propagation Algorithm
Li, Q., Cheng, L., Gao, W., et al. (2020) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2019.000159 · Cited by 16
“Theinformation propagation algorithm is based on the consensus protocol technique [24].”
BackgroundMethodInfluentialBipartite Consensus of Opinion Dynamics Through Delivering Credible Information
Zou, Y., & Xia, K. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3038662 · Cited by 16
Coordination of multi‐agent systems with arbitrary convergence time
Nguyen, T., Trinh, M. H., Nguyen, C. V., et al. (2021) · IET Control Theory and Applications · doi:10.1049/cth2.12086 · Cited by 16
“Several applications of multi-agent systems include truck platooning in the automatic highway system, cooperative localization in sensor networks, distributed computation and optimization, formation control of unmanned vehicles, power generation and distribution, and modelling of social networks [1, 2].”
BackgroundDynamical Networks of Social Influence: Modern Trends and Perspectives
Anderson, B. D. O., Dabbene, F., Proskurnikov, A. V., Ravazzi, C., & Ye, M. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.2684 · Cited by 15
Fast Real-Time Reinforcement Learning for Partially-Observable Large-Scale Systems
Sadamoto, T., & Chakrabortty, A. (2020) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3058228 · Cited by 16
“We next show the applicability of A1 to semi-stable systems such as consensus networks [40] and power networks [35].”
BackgroundDifferential initial-value privacy and observability of linear dynamical systems
Wang, L., Manchester, I. R., Trumpf, J., & Shi, G. (2022) · Automatica · doi:10.1016/j.automatica.2022.110722 · Cited by 16
“The system (1) can also be understood from a network system perspective, e.g., [41].”
BackgroundAhmed, S., Xiao, F., & Chen, T. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2013.0859 · Cited by 16
Multi-agent trajectory tracking with self-triggered cloud access
Adaldo, A., Liuzza, D., Dimarogonas, D. V., & Johansson, K. H. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798591 · Cited by 19
“1, B has a left-pseudoinverse B † (see [15] for further details), therefore, from (14) and (15), it follows that y(t) = ((B † B) ⊤ ⊗ In)y (t).”
Verginis, C. K., Nikou, A., & Dimarogonas, D. V. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263699 · Cited by 16
Implementation of Leader-Follower Formation Control of a Team of Nonholonomic Mobile Robots
Widyotriatmo, A., Joelianto, E., Prasdianto, A., et al. (2017) · International Journal of Computers Communications & Control · doi:10.15837/ijccc.2017.6.2774 · Cited by 16
“In [5] and [6], graph theoretic methods and consensus, cooperation in networked multiagent systems are the focus.”
BackgroundGlobal Consensus of Time-Varying Multiagent Systems Without Persistent Excitation Assumptions
Barabanov, N., & Ortega, R. S. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2803114 · Cited by 16
“The interested reader is referred to [8] for an excellent overview of the field and to [1], [6] for recent reviews of the literature relevant to this paper.”
BackgroundAn event‐triggered approach to quantized resilient consensus
Wang, Y., & Ishii, H. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4834 · Cited by 16
An overview on the designs of distributed observers in LTI multi-agent systems
Pei, Y., Gu, H., Liu, K., & Lü, J. (2021) · Science China Technological Sciences · doi:10.1007/s11431-020-1790-3 · Cited by 15
Notomista, G., Pacchierotti, C., & Giordano, P. R. (2022) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra46639.2022.9811673 · Cited by 15
“This performance cost function E results in what is known as position consensus on a line graph [27], and can be employed to keep the members of the multi-robot system close to each other in order to facilitate information exchange.”
BackgroundFuel Efficient High-Density Platooning Using Future Conditions Prediction
Jornod, G., Pfadler, A., Carreira, S., et al. (2022) · IEEE Open Journal of Intelligent Transportation Systems · doi:10.1109/ojits.2022.3172908 · Cited by 15
Chen, Y., & Yi, P. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.02.014 · Cited by 15
Ma, X., Wang, Y., Li, S., et al. (2023) · Ocean Engineering · doi:10.1016/j.oceaneng.2023.114003 · Cited by 15
Emergent Hypotrochoidal and Epitrochoidal Formations in a Swarm of Agents
Fedele, G., D’Alfonso, L., & Bono, A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3287290 · Cited by 15
“The matrix A G is the adjacency matrix defined as Lemma 1: For a connected undirected graph G , the following properties are important for the analysis of aggregation characteristics of the swarm [30].”
Distributed barrier function-enabled human-in-the-loop control for multi-robot systems
Fernandez-Ayala, V. N., Tan, X., & Dimarogonas, D. V. (2023) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48891.2023.10160974 · Cited by 15
“The associated Laplacian matrix [19] representing the connections is denoted as L .”
BackgroundNode and Edge Differential Privacy for Graph Laplacian Spectra: Mechanisms and Scaling Laws
Hawkins, C., Chen, B., Yazdani, K., et al. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3329379 · Cited by 15
“Specifically,worst-casedisagreementinaconsensus protocoldecaysproportionallyto e − λ 2 t [38].”
BackgroundMethodInteracting with Networks of Mobile Agents
Egerstedt, M., de la Croix, J.-P., Kawashima, H., & Kingston, P. (2014) · Modeling and simulation in science, engineering & technology · doi:10.1007/978-3-319-08437-4_3 · Cited by 15
“One way of achieving this is to let each agent move towards the centroid of its neighboring agents, that is, to let which is known as the consensus equation [12, 17, 20, 25].”
BackgroundMethodSelf-citationExact formation control with very coarse information
Jafarian, M., & Persis, C. D. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580295 · Cited by 15
“We refer to this agent as the leader ([18], [22]).”
BackgroundMethodMaintaining connectivity among multiple agents in cyclic pursuit: A geometric approach
Morbidi, F., Giannitrapani, A., & Prattichizzo, D. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5717945 · Cited by 15
Robust synchronization of coprime factor perturbed networks
Jongsma, H.-J., Trentelman, H. L., & Camlibel, M. K. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.10.017 · Cited by 15
“In this paper, we consider networks whose interaction topologies are represented by directed or undirected graphs, see [14,15].”
BackgroundTemporal heterogeneity and the value of slowness in robotic systems
Arkin, R. C., & Egerstedt, M. (2015) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio.2015.7418902 · Cited by 15
“These control actions can be thought of as the interior control loops in the network, akin to the route-level AQM (Active Queue Management) controllers in the transportation layer of the internet [40,41], or the consensus seeking terms in a multi-robot formation control scenario [3].”
BackgroundSelf-citationAggregate fluctuations in time-delay linear consensus networks: A systemic risk perspective
Somarakis, C., Ghaedsharaf, Y., & Motee, N. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963304 · Cited by 15
“Under certain connectivity assumptions, all states asymptotically converge to a common equilibrium [1].”
BackgroundFinite-Time Resilient Formation Control with Bounded Inputs
Usevitch, J., Garg, K., & Panagou, D. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619697 · Cited by 15
“As outlined in chapter 6 of [18], we define the variable τ i as τ i = p i − ξ i If non-adversarial agents come to formation on their values of τ i , i.e. (cid:107) τ i − τ j (cid:107) → 0 ∀ i, j ∈ ( L (cid:83) N ) \A then they have achieved formation.”
BackgroundAverage Consensus for Multi‐Agent System with Measurement Noise and Binary‐Valued Communication
Wang, X., Wang, T., Xu, C., et al. (2018) · Asian Journal of Control · doi:10.1002/asjc.1801 · Cited by 15
“The Laplacian matrix of an undirected graph is a symmetric positive semi-definite matrix and its eigenvalues are denoted as 0 , and the rank of L is n − 1 [16].”
BackgroundEvent-triggered robust cooperative stabilization in nonlinearly interconnected multiagent systems
Rezaei, V., & Stefanovic, M. (2019) · European Journal of Control · doi:10.1016/j.ejcon.2019.01.004 · Cited by 15
Network Communities of Dynamical Influence
Clark, R., Punzo, G., & Macdonald, M. (2019) · Scientific Reports · doi:10.1038/s41598-019-53942-4 · Cited by 15
On Control of Multiagent Systems in the Presence of a Misbehaving Agent
Yildirim, E., Sarsılmaz, S. B., Koru, A. T., et al. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2948133 · Cited by 15
“, see [1]–[3] and references therein).”
MethodLi, W., Liu, L., & Feng, G. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.10.088 · Cited by 15
Riemannian Optimal Identification Method for Linear Systems With Symmetric Positive-Definite Matrix
Sato, K., Sato, H., & Damm, T. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2957350 · Cited by 15
“MANY important systems involved in electrical networks [1]–[3], multiagent networks [4], [5], and tempe-”
BackgroundScalable Consensus in Networks of Multiagent Systems Using High-Gain Observers
Chowdhury, D., & Khalil, H. K. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.2968496 · Cited by 15
“For example, in a circulant undirected graph [19, Ch. 2], where all the agents are arranged in a circle and each agent can communicate with its two adjacent neighbors, the eigenvalues of the Laplacian for this undirected network has a closed form given by Therefore as the number of agents ( N )…”
BackgroundRLC Circuits-Based Distributed Mirror Descent Method
Yu, Y., & Acikmese, B. A. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2972908 · Cited by 15
“If graph G is connected, the nullspace of E(G) is spanned by 1|V | [26].”
BackgroundMin-Consensus for Heterogeneous Higher-Order Integrators Under Switching Digraph
Singh, B., Sen, A., & Sahoo, S. R. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2973594 · Cited by 15
“A digraph G n is called strongly connected if all nodes are globally reachable [26].”
Background‘Hubs-repelling’ Laplacian and related diffusion on graphs/networks
Estrada, E. (2020) · Linear Algebra and its Applications · doi:10.1016/j.laa.2020.03.012 · Cited by 16
Interaction network effects on position- and velocity-based models of collective motion
Turgut, A. E., Boz, İ. C., Okay, İ. E., Ferrante, E., & Huepe, C. (2020) · Journal of The Royal Society Interface · doi:10.1098/rsif.2020.0165 · Cited by 16
“Specifically, in a distributed average consensus protocol on networks [2], a variable associated to each node is iteratively replaced by the average of the variables of the nodes directly connected to it, a process that is repeated until they all converge to a common value.”
BackgroundAlavi, S. A., Mehran, K., & Hao, Y. (2020) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2020.3034853 · Cited by 15
“[30]: The Laplacian matrix L of a connected graph G is positive semidefinite,i.e., z T Lz ≥ 0 , ∀ z ∈ R n .”
BackgroundPeriodic event-triggered targeted shape control of Lagrangian systems with discrete-time delays
Aranda‐Escolástico, E., Colombo, L. J., & Guinaldo, M. (2021) · ISA Transactions · doi:10.1016/j.isatra.2021.01.048 · Cited by 15
Ma, W.-L., Csomay-Shanklin, N., Kolathaya, S., Hamed, K. A., & Ames, A. D. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3065174 · Cited by 15
“Third, in the control community, the most relevant examples are the multi-agent networks [21], the consensus problem [22] and the cooperative control problem [23], [24].”
BackgroundDistributed point-to-point iterative learning control for multi-agent systems with quantization
Zhao, X., & Wang, Y. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.06.015 · Cited by 15
Cooperative Distributed Model Predictive Formation Control of Non-Holonomic Robotic Agents
Rosenfelder, M., Ebel, H., & Eberhard, P. (2021) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs50823.2021.9620683 · Cited by 15
On the controllability and observability of Cartesian product networks
Chapman, A., Nabi-Abdolyousefi, M., & Mesbahi, M. (2012) · doi:10.1109/cdc.2012.6426230 · Cited by 15
“Network controllability and observability arises in situations where a networked system is influenced or observed by an external entity, such scenarios include networked robotic systems, human-swarm interaction, and network security [5], [6], as well as in areas such as quantum networks [7].”
BackgroundResultInfluentialSelf-citationLiu, J., Liu, J., Wang, C., et al. (2022) · Energy · doi:10.1016/j.energy.2022.125980 · Cited by 15
Hybrid Multilinear Modeling and Applications
Pangalos, G., Eichler, A., & Lichtenberg, G. (2014) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-11457-6_5 · Cited by 19
Probabilistic swarm guidance for collaborative autonomous agents
Acikmese, B. A., & Bayard, D. S. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859358 · Cited by 15
“This leads to a consensus among networked agents [15], [22], [23], [24], [31].”
BackgroundGeneralized algebraic connectivity for asymmetric networks
Asadi, M. M., Khosravi, M., Aghdam, A. G., et al. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526537 · Cited by 15
“For simplicity of analysis, let the weighted digraph G be QSC, which means that the zero eigenvalue of L has multiplicity one [14].”
MethodDecentralized Robust Control of Coupled Multi-Agent Systems under Local Signal Temporal Logic Tasks
Lindemann, L., & Dimarogonas, D. V. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431695 · Cited by 15
“Consider a multi-agent system with M agents modeled by an undirected graph G := (V, E) [1].”
BackgroundMulti-robot path planning with maintenance of generalized connectivity
Solana, Y., Furci, M., Cortés, J., & Franchi, A. (2017) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs.2017.8250932 · Cited by 15
“In particular, tools such as the Laplacian matrix and its second smallest eigenvalue λ 2 are often used when dealing with multiple robots coordination [10].”
BackgroundMethodInfluentialSchmid, R., & Aghbolagh, H. D. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2846180 · Cited by 15
On Guaranteed Capture in Multi-Player Reach-Avoid Games via Coverage Control
Rivera-Ortiz, P. M., & Diaz-Mercado, Y. J. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2849582 · Cited by 15
“for j ∈ N in i where N in i is the in-neighborhood set [14] for the directed line graph depicted in Fig.”
BackgroundMethodInfluentialMaximizing Diversity of Opinion in Social Networks
Mackin, E., & Patterson, S. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814422 · Cited by 15
“The dynamics can be expressed more compactly as It has been shown that, under these dynamics, the follow-ers’ states converge to a convex combination of the leader states, which is given by the following expression [18] We call ˆ x f the opinion vector of the network G .”
BackgroundOptimization of multiagent systems with increasing state dimensions: Hybrid LQ approach
Galván‐Guerra, R., Azhmyakov, V., & Egerstedt, M. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5991329 · Cited by 15
Self-citationKwon, S., Sun, Z., Anderson, B. D. O., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12952 · Cited by 15
“Since H ′ is an incidence matrix, it is obvious that span{1n ⊗ [ 1 0 ]>} ⊆ Null(H ′ ⊗ I2) and span{1n ⊗ [ 0 1 ]>} ⊆ Null(H ′ ⊗ I2) [27].”
Primal-Dual ε-Subgradient Method for Distributed Optimization
Zhu, K., & Tang, Y. (2023) · Journal of Systems Science and Complexity · doi:10.1007/s11424-023-1321-y · Cited by 14
“Note that L is symmetric and positive semi-definite with its ordered eigenvalues as 0 = λ 1 λ 2 ≤ . . . λ N under Assumption 2 by Theorem 2.8 in [17].”
BackgroundInfluential
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.