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 601–700 of 2,960
Partial attitude synchronization for networks of underactuated spacecraft
Brewer, J. M., & Tsiotras, P. (2018) · Automatica · doi:10.1016/j.automatica.2018.07.025 · Cited by 22
On Survival of All Agents in A Network With Cooperative and Competitive Interactions
Zhai, S., & Zheng, W. X. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2892521 · Cited by 22
Interval consensus over random networks
Fu, W., Qin, J., Wu, J., Zheng, W. X., & Kang, Y. (2019) · Automatica · doi:10.1016/j.automatica.2019.108603 · Cited by 23
A Research Project of Society 5.0 in Kitakyushu, Japan
Nagahara, M. (2019) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2019.8920449 · Cited by 22
“For such a system, the control theory of multi-agent systems is available [4].”
BackgroundYi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.383 · Cited by 30
“In this section, we present some definitions from algebraic graph theory [45], the restricted secant inequality [46], and monotonicity properties of vector functions [47].”
BackgroundAn interior point method for growing connected resistive networks
Moghaddam, S. H., & Jovanović, M. R. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170900 · Cited by 21
“Index Terms— Convex optimization, interior-point method, `1 minimization, resistive networks, semidefinite programming.”
BackgroundInfluentialRobust consensus of multi-agent systems with stochastic uncertain channels
Li, Z., & Chen, J. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525492 · Cited by 21
“Lemma 2 ([27]): For an unweighted and undirected graph, L = DD .”
BackgroundWeighted Network Design With Cardinality Constraints via Alternating Direction Method of Multipliers
Sun, C., Dai, R., & Mesbahi, M. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2789726 · Cited by 21
“It is known that for a connected network G, the (undirected) consensus protocol converges to consensus with a rate of convergence that is dictated by the algebraic connectivity of the graph, namely, λ2(G) [13].”
BackgroundSelf-citationDistributed Stopping Criterion for Consensus in the Presence of Delays
Prakash, M., Talukdar, S., Attree, S., Yadav, V. K., & Salapaka, M. V. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2917151 · Cited by 22
“A coordination strategy that has received considerable attention utilizes the consensus mechanism, where agents compute a common value of interest determined by initial values held by agents in a distributed manner [1], [2].”
BackgroundConsensus of Multiagent Systems Via Asynchronous Cloud Communication
Bowman, S. L., Nowzari, C., & Pappas, G. J. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2935626 · Cited by 21
“Literature review: In the context of the multi-agent coordination problem in general, the literature is extensive [2], [3].”
BackgroundFormation Reconfiguration for Fixed-Wing UAVs
Chen, H., Wang, X., Shen, L., et al. (2021) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-021-01384-4 · Cited by 21
Finite‐time leader–follower consensus control of multiagent systems with mismatched disturbances
Gu, L., Zhao, Z., Sun, J., et al. (2021) · Asian Journal of Control · doi:10.1002/asjc.2589 · Cited by 21
“A group of networked agents can complete a difficult task quickly and flexibly by using local relative information [4].”
BackgroundMulti-Agent Control: A Graph-Theoretic Perspective
Chen, F., & Ren, W. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-1218-6 · Cited by 21
“There are also monographs and books, including cooperative control, motion coordination algorithms([211]), graph theoretic methods([212]), network systems([213]), graph rigidity based formation control , consensus regions approach([216]), optimal and adaptive design([217]), passivity based design([218]), iterative lea…”
BackgroundPeer selection in opinion dynamics on signed social networks with stubborn individuals
Pan, L., Shao, H., & Li, D. (2022) · Neurocomputing · doi:10.1016/j.neucom.2021.12.105 · Cited by 21
Luo, Q., Wang, H., Li, N., et al. (2024) · Ocean Engineering · doi:10.1016/j.oceaneng.2024.116773 · Cited by 21
Wang, Q., Wang, Y., Wang, Y., et al. (2024) · Energy · doi:10.1016/j.energy.2024.130904 · Cited by 21
Distributed virtual leader moving formation control using behavior-based MPC
Droge, G. N. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171079 · Cited by 21
“[1]) over the initial conditions provided better results .”
BackgroundResultGasparri, A., Oriolo, G., Priolo, A., & Ulivi, G. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6385822 · Cited by 21
Structure-preserving model reduction of physical network systems by clustering
Monshizadeh, N., & van der Schaft, A. J. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7040081 · Cited by 21
Distributed methods for synchronization of orthogonal matrices over graphs
Thunberg, J., Bernard, F., & Gonçalves, J. M. (2017) · Automatica · doi:10.1016/j.automatica.2017.02.025 · Cited by 21
“In our methods, instead of using the graph Laplacian matrix [24], matrices similar to the graph connection Laplacian matrix [30] are used.”
MethodPrivacy Masking for Distributed Optimization and Its Application to Demand Response in Power Grids
Wada, K., & Sakurama, K. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2017.2668981 · Cited by 20
“The range of parameter is 0 < < 1/maxi∈V |Ni | for the stability of the system (4) for consensus [23].”
BackgroundInfinitesimally shape-similar motions using relative angle measurements
Buckley, I., & Egerstedt, M. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202277 · Cited by 21
Self-citationKantaros, Y., & Zavlanos, M. M. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8460570 · Cited by 21
An Optimization-Based Cooperative Path-Following Framework for Multiple Robotic Vehicles
Alessandretti, A., & Aguiar, A. P. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2953459 · Cited by 21
“e of the neighboring agents. The high relevance of such multi-agent system coordination problem is well motivated by the existence of an extensive literature on the topic, and we refer to, e.g., [11]–[14] for an introduction to it. The Model Predictive Control (MPC) solves the stabilization problem by selecting among…”
BackgroundIterative Learning Control of a Multiagent System under Random Perturbations
Владимирович, П. П., Koposov, A. S., & Emelianova, J. (2020) · Automation and Remote Control · doi:10.1134/s0005117920030078 · Cited by 21
Recurrent averaging inequalities in multi-agent control and social dynamics modeling
Proskurnikov, A. V., Calafiore, G. C., & Cao, M. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.04.014 · Cited by 21
“Introduction In last two decades problems of distributed control and coorination in multi-agent systems (MAS) ( Lewis, Zhang, Hengster- ovris, & Das, 2014; Mesbahi & Egerstedt, 2010; Ren & Beard, 008; Ren & Cao, 2011; Shamma, 2007 ) have attracted an enor- ous attention from the research community.”
BackgroundMethodInfluentialZhang, K., & Demetriou, M. A. (2015) · Aerospace Science and Technology · doi:10.1016/j.ast.2015.06.002 · Cited by 21
Disturbance decoupling problem for multi-agent systems: A graph topological approach
Monshizadeh, N., Zhang, S., & Camlibel, M. K. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.11.011 · Cited by 21
Cooperative Vehicle Environmental Monitoring
Leonard, N. E. (2016) · Springer eBooks · doi:10.1007/978-3-319-16649-0_19 · Cited by 27
Herdable Systems Over Signed, Directed Graphs
Ruf, S. F., Egerstedt, M., & Shamma, J. S. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431101 · Cited by 21
“The first approach moves from a specific graph structure to a system dynamic, most often consensus dynamics [4].”
BackgroundSelf-citationDifferentially Private Iterative Synchronous ConsensusPreprint
Huang, Z., Mitra, S., & Dullerud, G. E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.4262 · Cited by 21
“ry and sucient conditions for achieving consensus with synchronous mechanisms, including cases where the matrix P is time-varying, have been studied in [21, 17] (see the book for a complete overview [14]). Sucient conditions for achieving consensus with message delays and losses has been developed in [22, 3] and more…”
BackgroundEfficient distributed sensing using adaptive censoring-based inference
Mu, B., Chowdhary, G. V., & How, J. P. (2014) · Automatica · doi:10.1016/j.automatica.2014.04.013 · Cited by 23
“Vertice pair (i, j) ∈ E if and only if the agents i can communicate with, or otherwise sense, the state of agent j [13].”
BackgroundBayesian Learning Without Recall
Rahimian, M. A., & Jadbabaie, A. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2631943 · Cited by 23
“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].”
BackgroundDistributed network flows solving linear algebraic equations
Shi, G., & Anderson, B. D. O. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525353 · Cited by 20
“In fact, we have wi > 0 for all i ∈ V if G§ is strongly connected [6].”
BackgroundSubgame Perfect Equilibrium Analysis for Jamming Attacks on Resilient Graphs
Nugraha, Y., Hayakawa, T., Cetinkaya, A., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814607 · Cited by 20
Wa̧sik, A., Pereira, J. N., Ventura, R., et al. (2016) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2016.7759276 · Cited by 20
“Graph theory offers tools that allow individuals to maintain a desired formation shape in a distributed manner, resulting in a decentralized control of the network of robots, which is more robust than the equivalent centralized architecture because there is no single point of failure [1].”
BackgroundMethodInfluentialCoordination of multi-agent systems via asynchronous cloud communication
Bowman, S. L., Nowzari, C., & Pappas, G. J. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798592 · Cited by 23
“Literature review: In the context of the multi-agent coordination problem in general, the literature is extensive [3], [4], [5].”
BackgroundDistributed coordination for a class of non‐linear multi‐agent systems with regulation constraints
Tang, Y., & Yi, P. (2017) · IET Control Theory and Applications · doi:10.1049/iet-cta.2017.0893 · Cited by 20
“It is well known [29] that under Assumption 2, the associated Laplacian L of this graph is symmetric with rank N − 1 , and its null space is spanned by 1 N .”
BackgroundEbel, H., Ardakani, E. S., & Eberhard, P. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2017.07.007 · Cited by 21
Multi-lane Convoy Control for Autonomous Vehicles based on Distributed Graph and Potential Field
Li, G., Chu, D., Cao, Y., et al. (2019) · IEEE Intelligent Transportation Systems Conference (ITSC) · doi:10.1109/itsc.2019.8917409 · Cited by 20
“Using graph-based formation control, a stable solution to the formation problem in one dimension is given by [14]:”
MethodLi, P., Zhao, Y., Hu, J., Zhang, Y., & Ghosh, B. K. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.05.006 · Cited by 20
Opinion dynamics using Altafini's model with a time-varying directed graph
Proskurnikov, A. V., & Cao, M. (2014) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/isic.2014.6967611 · Cited by 20
“We refer the reader to [14], [21], [22] for excellent surveys of recent research on distributed consensus protocols and their applications, as well as historical milestones.”
BackgroundProblem of uniform deployment on a line segment for second-order agents
Proskurnikov, A. V., & Parsegov, S. E. (2016) · Automation and Remote Control · doi:10.1134/s0005117916070110 · Cited by 20
Wu, X., & Jovanović, M. R. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.02.007 · Cited by 20
Leader-Controlled Protocols to Accelerate Convergence in Consensus Networks
Parlangeli, G., & Valcher, M. E. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2832979 · Cited by 20
“, [31], [32]).”
Growing optimally rigid formations
Zelazo, D., & Allgöwer, F. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315460 · Cited by 19
“Therefore, one has that a graph is generically rigid if it has an infinitesimally rigid realization [4].”
BackgroundDistributed continuous-time online optimization using saddle-point methods
Lee, S., Ribeiro, A., & Zavlanos, M. M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798923 · Cited by 19
“(5) Note that this assumption ensures that λ2, also known as the Fiedler eigenvalue of L, is always strictly positive [14].”
BackgroundSimple synchronization protocols for heterogeneous networks: beyond passivity
Proskurnikov, A. V., & Mazo, M. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1459 · Cited by 19
“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).”
InfluentialLinear Model Regression on Time-series Data: Non-asymptotic Error Bounds and Applications
Alaeddini, A., Alemzadeh, S., Mesbahi, A., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619074 · Cited by 19
“Symmetric system matrices appear in a wide range of applications where interactions leading to the dynamics is bidirectional; such systems are of interest in biological networks [16], social interactions [17], robotic swarms [18], [19], and networks security [20].”
BackgroundSelf-citationNotomista, G., Cai, X., Yamauchi, J., & Egerstedt, M. (2019) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs.2019.8901085 · Cited by 18
“As a formation controller, we utilize the following weighted consensus protocol [11]:”
BackgroundMethodSelf-citationAllocation of Excitation Signals for Generic Identifiability of Dynamic Networks
Cheng, X., Shi, S., & 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.9029218 · Cited by 19
“We provide necessary terminologies and concepts from graph theory and refer to [1], [16] for more details.”
BackgroundMethodEvent-Triggered Distributed Estimation with Decaying Communication Rate
He, X., Xing, Y., Wu, J., et al. (2022) · SIAM Journal on Control and Optimization · doi:10.1137/21m1405083 · Cited by 19
Observability Robustness Under Sensor Failures: A Computational Perspective
Zhang, Y., Xia, Y., & Liu, K. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3295698 · Cited by 19
“The dual scenarioisthat,inaleader–followersystem,afollowerlosesallitsdirect connectionswiththeleaders[9].”
BackgroundInfluentialVision-based formation control of aerial vehicles
Tron, R., Thomas, J. R., Polin, J. J., et al. (2015) · Cited by 19
Graph-Theoretic Methods for Measurement-Based Input Localization in Large Networked Dynamic Systems
Nudell, T. R., & Chakrabortty, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2398911 · Cited by 19
“The eigenvalues and corresponding eigenvectors of L(G) are [30]”
BackgroundSparsity-promoting optimal control of spatially-invariant systems
Zoltowski, D. M., Dhingra, N. K., Fu, L., et al. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859491 · Cited by 19
“Since both these features are commonly encountered in multi-agent systems [17], consensus and synchronization networks, the developed approach may find use in a host of emerging applications.”
BackgroundL1group consensus of multi-agent systems with stochastic inputs under directed interaction topology
Shang, Y. (2012) · International Journal of Control · doi:10.1080/00207179.2012.715753 · Cited by 19
“Consensus problems have been widely investigated mainly by means of algebraic graph theories (Mesbahi and Egerstedt 2010) and Lyapunov function approaches (Olfati-Saber and Murray 2004).”
BackgroundMethodDifferential inequalities in multi-agent coordination and opinion dynamics modeling
Proskurnikov, A. V., & Cao, M. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.065 · Cited by 19
“The algorithms (1), along with their higher-order extensions [20, 42, 43], employ the Laplacian matrix [28,42] L ( t ) of the time-varying interaction graph of the multi-agent system.”
MethodA hybrid barrier certificate approach to satisfy linear temporal logic specifications
Bisoffi, A., & Dimarogonas, D. V. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430795 · Cited by 17
“With these A and B , the state ξ and input u can be interpreted as a group of follower and leader agents, respectively (see [23, § 10.6]).”
BackgroundInfluentialA Sequential Composition Framework for Coordinating Multirobot Behaviors
Pierpaoli, P., Li, A., Srinivasan, M., et al. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3036628 · Cited by 19
“pectively represented by the robots and the sharing of information between them. For instance, considering the coordinated behaviors mentioned above, the rendezvous problem requires a connected graph [15], cyclic pursuit a directed cycle [11], formation control a rigid graph [15], and most coverage controllers require…”
BackgroundSelf-citationDistributed $\ell _1$-State-and-Fault Estimation for Multiagent Systems
Hashimoto, K., Chong, M. S., & Dimarogonas, D. V. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2939660 · Cited by 20
“T HE PROBLEM of controlling multiagent systems arises in many practical applications, such as vehicle platooning, formation control of autonomous vehicles and satellites, cooperative control of robots, and power networks, to name a few [1].”
BackgroundTran, D. M., Yucelen, T., & Sarsılmaz, S. B. (2021) · Control Engineering Practice · doi:10.1016/j.conengprac.2020.104717 · Cited by 19
Protecting privacy of topology in consensus networks
Katewa, V., Chakrabortty, A., & Gupta, V. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171103 · Cited by 22
“In either case, the coupling induces a weighted graph/network with the agents as nodes and links representing the coupling between agents [3].”
BackgroundDetectability of multiple link failures in multi-agent systems under the agreement protocol
Rahimian, M. A., Ajorlou, A., & Aghdam, A. G. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426051 · Cited by 19
“The issue of robustness of control against link failures is then considered by introducing critical, redundant and ordinary links, depending on the minimum number of necessary inputs for controllability in face of link loss, and the participation of the link in the maximally matched sets.”
BackgroundResultKempton, L., Herrmann, G., & di Bernardo, M. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3808 · Cited by 19
“The graph Laplacian may also be defined another way, by constructing a weight vector w and oriented incidence matrix P [33], which will be a useful notation:”
BackgroundAn Overview of Cooperative and Consensus Control of Multiagent Systems
Davoodi, M., Gallehdari, Z., Saboori, I., Rezaee, H., Semsar-Kazerooni, E., Meskin, N., Abdollahi, F., & Khorasani, K. (2016) · Wiley eBooks · doi:10.1002/047134608x.w8317 · Cited by 20
Dynamics and control in power grids and complex oscillator networks
Dörfler, F. (2013) · Cited by 29
Model reduction of networked passive systems through clustering
Besselink, B., Sandberg, H., & Johansson, K. H. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862415 · Cited by 18
“The following result can be found in [17], [14].”
A Network Optimization Approach to Cooperative Control Synthesis
Sharf, M., & Zelazo, D. (2017) · IEEE Control Systems Letters · doi:10.1109/lcsys.2017.2706948 · Cited by 18
“Similarly, the choice γ (ζ ) = ζ with (ζ ) = (1)2‖ζ‖(2), will lead to the well-known linear consensus protocol [4], [6].”
BackgroundInfluentialTarassov, V. B. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-01818-4_3 · Cited by 18
Strict Lyapunov functions for consensus under directed connected graphs
Panteley, E. V., Loría, A., & Sukumar, S. (2020) · European Control Conference (ECC) · doi:10.23919/ecc51009.2020.9143719 · Cited by 21
Single Module Identifiability in Linear Dynamic Networks With Partial Excitation and Measurement
Shi, S., Cheng, X., & den Hof, P. M. J. V. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3137787 · Cited by 18
“describe a wide class of complex systems in various applications, including multirobot coordination [1], power grids [2], gene networks [3], and brain networks [4].”
BackgroundSignal Temporal Logic Task Decomposition via Convex Optimization
Charitidou, M., & Dimarogonas, D. V. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3090980 · Cited by 18
“Over the last decades, multi-agent systems have been considered in a variety of applications such as connectivity and formation control [1] or coverage [2].”
BackgroundNonfragile robust H∞ containment control for multi-agent systems with a time-varying delay
Zhou, T., Liu, C., & Wang, W. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.106732 · Cited by 18
Distributed coordination in multi-agent systems: a graph Laplacian perspective
Han, Z., Lin, Z., Fu, M., & Chen, Z. (2015) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1500118 · Cited by 21
Jamming in mobile networks: A game-theoretic approach
Bhattacharya, S., Gupta, A., & Başar, T. (2013) · Numerical Algebra Control and Optimization · doi:10.3934/naco.2013.3.1 · Cited by 18
Virtual Spring-Damper Mesh-Based Formation Control for Spacecraft Swarms in Potential Fields
Chen, Q., Veres, S. M., Wang, Y., et al. (2015) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g000569 · Cited by 18
Manipulability of leader–follower networks with the rigid-link approximation
Kawashima, H., & Egerstedt, M. (2014) · Automatica · doi:10.1016/j.automatica.2013.11.041 · Cited by 18
“Key words: Multi-agent systems, rigidity theory, networked mobile robots.”
BackgroundMethodSelf-citationConsensus dynamics on random rectangular graphs
Estrada, E., & Sheerin, M. (2015) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2015.10.021 · Cited by 21
“In the consensus protocols, as they are known in technological applications, the problem consists of making the scalar states of a set of agents converge to the same value under local communication constraints [20,21].”
BackgroundMethodInfluentialNetwork entropy: A system-theoretic perspective
de Badyn, M. H., Chapman, A., & Mesbahi, M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403083 · Cited by 20
“Various notions of robustness measures have been introduced in an effort to describe the performance of networks, such as the convergence time τ = 1/λ2, and the utility of these measures often depends on the network topology [7], [5].”
BackgroundResultSelf-citationCoverage and field estimation on bounded domains by diffusive swarms
Elamvazhuthi, K., Adams, C., & Berman, S. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798696 · Cited by 16
“Observability of consensus protocols on communication networks has been well-studied [29] and applied to problems of sensing spatially-distributed parameters [26], [38], [42].”
BackgroundNavarro, I., Zimmermann, F., Vasic, M., & Martinoli, A. (2016) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2016.7795659 · Cited by 20
“The 978-1-5090-1889-5/16/$31.00 ©2016 IEEE 879 distributed controller which allows the convoy formation is based on Laplacian control.”
BackgroundInfluentialDifferentially private objective functions in distributed cloud-based optimization
Wang, Y., Hale, M., Egerstedt, M., & Dullerud, G. E. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798824 · Cited by 20
“Distributed optimization problems appear in various applications [1].”
BackgroundSelf-citationLiu, Y., Wu, J., Manchester, I. R., & Shi, G. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619783 · Cited by 19
“au) advanced algorithms [2] can be designed which utilize the distributed nature of consensus algorithm to achieve useful control and computation objectives, e.”
BackgroundConsensus Control for Leader-follower Multi-agent Systems under Prescribed Performance Guarantees
Chen, F., & Dimarogonas, D. V. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029509 · Cited by 18
“The graph Laplacian of G is L = ∆− A.”
BackgroundInfluentialDistributed Adaptive Control of Uncertain Multiagent Systems with Coupled Dynamics
Dogan, K. M., Yucelen, T., Ristevki, S., & Muse, J. A. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147280 · Cited by 18
“Note that the structure of this term is inspired by the results in, for example, [Section 3, 15].”
BackgroundMethodResultInfluentialCooperative tracking control of single-integrator multi-agent systems with multiple leaders
Martinović, L., Zečević, Ž., & Krstajić, B. (2021) · European Journal of Control · doi:10.1016/j.ejcon.2021.11.003 · Cited by 18
Fuzzy Formation Control and Collision Avoidance for Multiagent Systems
Chang, Y., Chen, C., Chan, W.-S., Lin, H.-W., & Chang, C.-W. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/908180 · Cited by 19
Balanced deployment of multiple robots using a modified kuramoto model
Xu, Z., Egerstedt, M., Droge, G. N., et al. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580800 · Cited by 18
“Incidence matrix D ∈ R of a cycle graph is given by [9]:”
BackgroundSelf-citationThe projection method for reaching consensus and the regularized power limit of a stochastic matrix
Пашаевич, А. Р., & Chebotarev, P. (2011) · Automation and Remote Control · doi:10.1134/s0005117911120034 · Cited by 18
UAV flocking with wind gusts: Adaptive topology and model reduction
Chapman, A., & Mesbahi, M. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990799 · Cited by 18
“The significance of network symmetry and its role in controllability have recently been investigated [2], [9], and provides a natural extension of system based to network structure based model reduction.”
BackgroundSelf-citationDynamic input consensus using integrators
Taylor, C. N., Beard, R. W., & Humpherys, J. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990997 · Cited by 18
Amani, A. M., Gaeini, N., Jalili, M., et al. (2017) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2017.2655020 · Cited by 18
Evolution of clusters in large-scale dynamical networks
Proskurnikov, A. V., & Granichin, O. N. (2018) · Cybernetics and Physics · doi:10.35470/2226-4116-2018-7-3-102-129 · Cited by 18
“…complex structures and their dynamics, manifested by Network Science [Barabasi, 2002, Newman et al., 2006, Easley and Kleinberg, 2010], Multi-Agent Systems (MAS) theory [Shoham and Leyton-Brown, 2008, Mesbahi and Egerstedt, 2010] and the theory of complex systems (or “complexity”) [Bar-Yam, 1997].”
BackgroundDifferentially Private Formation Control
Hawkins, C., & Hale, M. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303817 · Cited by 25
“, we allow formations to be translationally invariant [24].”
InfluentialNetwork identification via node knock-out
Nabi-Abdolyousefi, M., & Mesbahi, M. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5718112 · Cited by 18
“1 The implicit contribution of our analysis is its ramifications for exact network identification from boundary nodes of networks that have an embedded consensus-type algorithms for their operation, including formation flying, distributed estimation, and mobile robotics [7], [8].”
BackgroundMethodInfluentialSelf-citationElahi, A., Alfi, A., & Chadli, M. (2024) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2024.05.009 · Cited by 17
Shape control of spacecraft formation using a virtual spring-damper mesh
Chen, Q., Meng, Y., & Xing, J. (2016) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2016.09.009 · Cited by 17
Distributed encirclement control with arbitrary spacing for multiple anonymous mobile robots
Yao, W., Zeng, Z., Wang, X., Lu, H., & Zheng, Z. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028755 · Cited by 16
“Matrix A is a row stochastic matrix [12] and furthermore, it could be considered as the adjacency matrix [13] corresponding to a weighted directed ring denoted by G(A).”
BackgroundDual Quaternion Cluster-Space Formation Control
Giribet, J. I., Colombo, L. J., Moreno, P., et al. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3095037 · Cited by 17
“A commonly used technique in the robot formation control literature is the leader-follower configuration [3].”
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.