Graph Theoretic Methods in Multiagent Networks
The DOI matches its Crossref record.
Abstract
This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Items 2,001–2,100 of 2,960
Measurement of Software Structural Properties Based on the Theory of Complex Networks
Zhao, X. L., Chen, X. L. Y., Hu, C. Z., et al. (2014) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.602-605.2163 · Cited by 2
The Projection Method for Reaching Consensus in Discrete-time Multiagent Systems
Chebotarev, P., & Пашаевич, А. Р. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130619-3-ru-3018.00422 · Cited by 2
Torre, G. D. L., Yucelen, T., & Johnson, E. N. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6759982 · Cited by 2
“Considering (10), we note that x(t)→ [(1n1n/n)⊗ IN ]x0 as t→∞ since the undirected graph G is assumed to be connected [11].”
BackgroundReadiness in formation control of multi-robot system
Xu, Z., Kawashima, H., & Schilling, K. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580296 · Cited by 2
“Let D(G) ∈ {−1, 0, 1} be an incidence matrix [11] of graph G.”
BackgroundDistributed average consensus based on structural weight‐balanceability
Haghighi, R., & Cheah, C. C. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.0251 · Cited by 2
“It has been shown [43], that the weight-balanced and strong connectivity are necessary and sufficient conditions”
BackgroundOptimal and Robust Scheduling for Networked Control Systems [Bookshelf]
Vamvoudakis, K. G. (2015) · IEEE Control Systems · doi:10.1109/mcs.2014.2385294 · Cited by 2
Analysis and design of output consensus algorithms for agents with linear dynamics
Contzen, M. P. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330610 · Cited by 2
“For weighted graphs, Laplacian matrices with similar characteristics can also be defined [11].”
BackgroundA continuous-time dynamical system that can sort agents through distributed protocols
Altafini, C. (2014) · IEEE Conference on Control Applications (CCA) · doi:10.1109/cca.2014.6981621 · Cited by 2
“, n (this property is often simply called “balanced” in the literature on distributed consensus problems [17]).”
BackgroundSynchronization can Control Regularization in Neural Systems via Correlated Noise Processes
Bouvrie, J., & Slotine, J.-J. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Distributed fault-tolerant strategy for networked robots with both cooperative and reactive controls
Arrichiello, F., Marino, A., & Pierri, F. (2014) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2014.6932739 · Cited by 2
“, the set V of the indexes labeling the N vertices (nodes), the set of edges (arcs) E = V × V connecting the nodes, and its L(N × N ) Laplacian matrix [13].”
BackgroundClustering, coverage and aggregation methods for large networks
Xu, Y. (2014) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 2
Zhang, M., Saberi, A., Stoorvogel, A. A., et al. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402663 · Cited by 2
“The objective of synchronization is to guarantee an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [2], [12], [21], [30]).”
BackgroundCooperative Automatic Parking System Based on Consensus Control with Mutual Exclusion Mechanism
Noto, N., Okuda, H., Tazaki, Y., et al. (2013) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.49.986 · Cited by 2
Robotic Mass Games over r-Disk Proximity Networks
Izumi, S., Azuma, S., & Sugie, T. (2013) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.49.720 · Cited by 2
Stabilization by controller networks
Izumi, S., Azuma, S., & Sugie, T. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.05.014 · Cited by 2
“In these terms, λi+1(L(G)) (i∈V\{n}) closely relates to G, as stated in [9].”
BackgroundNetwork design for fast convergence to the nash equilibrium in a class of repeated games
Kordonis, I., & Papavassilopoulos, G. P. (2016) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2016.7535941 · Cited by 2
“The first two terms correspond to the consensus dynamics and the last to the fact that xi is actually changing.”
BackgroundCommunication network challenges for collaborative vehicles
Chen, H., Hovareshti, P., & Baras, J. S. (2011) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2011.6190262 · Cited by 2
Multi-Robot Search and Rescue: An Open-Ended Educational Bridge Between Theory and Practice
Twu, P., & Egerstedt, M. (2013) · SMARTech Repository (Georgia Institute of Technology) · Cited by 2
Self-citationCooperative Output Regulation of Multiagent Linear Parameter‐Varying Systems
Mesbahi, A., & Velni, J. M. (2017) · Mathematical Problems in Engineering · doi:10.1155/2017/8489308 · Cited by 2
Jain, A., & Ghose, D. (2017) · Indian Control Conference · doi:10.1109/indiancc.2017.7846495 · Cited by 2
On Minimizing the Maximal Characteristic Frequency of a Linear Chain
Zarai, Y., & Margaliot, M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2688323 · Cited by 2
Distributed Extremum Seeking And Cooperative Control For Mobile Cooperative Communication Systems
Al‐Abri, S. (2013) · Journal of International Crisis and Risk Communication Research · Cited by 2
Coordinate-Free Control of Multirobot Formations
Aranda, M., Nicolás, G. L., & Sagüés, C. (2017) · Advances in industrial control · doi:10.1007/978-3-319-57828-6_6 · Cited by 2
Control of Mobile Robot Formations Using Aerial Cameras
Aranda, M., Nicolás, G. L., & Sagüés, C. (2017) · Advances in industrial control · doi:10.1007/978-3-319-57828-6_5 · Cited by 2
“Typically, the formation to be stabilized is defined in terms of absolute positions for the robots to reach [1, 2], or as relative position vectors or distances between the agents [3].”
BackgroundA Consensus Protocol over Noisy Two‐Layered Networks with Cooperative and Antagonistic Interactions
Nguyen, L. T. H., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2017) · Asian Journal of Control · doi:10.1002/asjc.1554 · Cited by 2
“Consensus [1–4] is to converge all of the agent states to a common value.”
BackgroundWu, K. K., Yam, Y., Meng, H. M. L., et al. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7962977 · Cited by 2
“protocol over a weighted digraph and the discrete-time evolution of a MC [4].”
BackgroundSelf-citationRobust semi-cooperative multi-agent coordination in the presence of stochastic disturbances
Garg, K., Han, D., & Panagou, D. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264163 · Cited by 2
“Coordination in multi-agent systems has attracted much attention over the last decade with a plethora of theoretical and practical problems that this paper can not cite in their entirety; for recent overviews the reader is referred to [1]–[4].”
BackgroundTime averaged consensus in a direct coupled coherent quantum observer network
Petersen, I. R. (2017) · Control Theory and Technology · doi:10.1007/s11768-017-7019-8 · Cited by 2
Cao, R., & Mei, J. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028749 · Cited by 3
“Suppose that there exist n agents, and the network topology is represented by G = (V, E ,A) [20], where V = Proceedings of the 36th Chinese Control Conference July 26-28, 2017, Dalian, China”
BackgroundSynchronization of linear agents with input/output constraints
Takaba, K. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.176 · Cited by 2
Consensus decentralized control of multi-agent networked systems using vector Lyapunov functions
Lyubchyk, L. M., Dorofieiev, Y., & Nikulchenko, A. A. (2017) · IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS) · doi:10.1109/idaacs.2017.8095050 · Cited by 2
“At that the matrix of the extended system dynamics is described by the Kronecker product of the corresponding matrices [6].”
BackgroundSocial Influence Diffusion and Coordinated Decision Making on Networks
Stirling, W. C., & Tummolini, L. (2017) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3110025.3116194 · Cited by 2
A k-hop graph-based observer for large-scale networked systems
Gasparri, A., & Marino, A. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264361 · Cited by 2
“Hence, rank(L) ≤ n− 1 where the equality holds when the graph is connected [14].”
BackgroundA Robust Coordination Protocol for Safe Multi-Agent Motion Planning
Garg, K., & Panagou, D. (2018) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2018-0605 · Cited by 2
“…planning, which mainly focuses on generating collision-free trajectories for multiple agents (e.g., unmanned aerial vehicles) so that they reach preassigned goal locations under limited sensing, communication, and interaction capabilities; for recent overviews the reader is referred to [1–5].”
BackgroundMulti-agent coordination via a shared wireless spectrum
Nowzari, C. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264671 · Cited by 2
“, [2], [3], [4].”
Multilayer and multiplex DPI control for a set of boost converters
Toro, V., & Mojica‐Nava, E. (2017) · IEEE Colombian Conference on Automatic Control (CCAC) · doi:10.1109/ccac.2017.8276397 · Cited by 2
“If a function assign a real value to each vertex the graph is called a weighted graph G = (V,E,w) where w : E −→ R [8].”
BackgroundAnalysis of consensus protocols under time delays in directed graphs
Yela, D. A., Obando, G., & Pantoja, A. D. (2017) · IEEE Colombian Conference on Automatic Control (CCAC) · doi:10.1109/ccac.2017.8276409 · Cited by 2
“En general, para digrafos, se tiene el siguiente resultado (tomado de [9]) que es importante en el análisis de los protocolos de consenso:”
BackgroundInfluentialCollective Formation Control of Multiple Constant-Speed UAVs with Limited Interactions
Anderson, B. D. O., Sun, Z., Seyboth, G. S., & Yu, C. B. (2018) · Lecture notes in control and information sciences - proceedings · doi:10.1007/978-3-319-67068-3_2 · Cited by 2
“The main idea in the controller design is inspired by the consensus-based linear formation control [13, 15].”
BackgroundDistributed Complementary Control Research of Wind Turbines in Two Offshore Wind Farms
Wang, B., Tian, M., Lin, T., & Hu, Y. (2018) · Sustainability · doi:10.3390/su10020553 · Cited by 3
Formation Feasibility and Motion Generation of Networked Heterogeneous Systems
Sun, Z. (2018) · Springer theses · doi:10.1007/978-3-319-74265-6_9 · Cited by 2
A Connectivity Preserving Framework for Distributed Motion Coordination in Proximity Networks
Jaleel, H., & Abbas, W. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431056 · Cited by 2
Rotating consensus of the multi-agent system under a directed graph
Li, Q., & Mei, J. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8483506 · Cited by 2
“1 [22] Suppose that a multi-agent system with n agents and the digraph D is modeled as below”
BackgroundElectrostatic Methods for Perfect Matching and Safe Path Planning
Hyun, N.-S. P., & Peres, Y. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619447 · Cited by 2
“See [16] for the formal definition of algebraic properties of a graph.”
BackgroundNetwork‐based distributed direct load control guaranteeing fair welfare maximisation
Sakurama, K., & Ahn, H. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.6102 · Cited by 2
“(ii) All proofs of lemmas and theorems that are omitted in the conference paper due to space Table 1 Notation C = {1, 2, . . . , n} Set of the customers xi(t) ∈ R Electricity supplied or consumed by customer i ui(t) ∈ R Control input to customer i y(t) ∈ R Power imbalance (sum of all xi(t) for i ∈ C) x∗i ∈ R Desired a…”
BackgroundInfluentialApproximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function
Han, D., Huang, L., & Panagou, D. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431021 · Cited by 1
“In addition, with the rapid recent developments in communication and sensing technologies, ubiquity of multi-agent systems has spurred great research interest in areas such as multi-robot path planning, surveillance (for more applications, refer to surveys [1], [2] and books [3], [4]).”
BackgroundTime-constrained multi-agent task scheduling based on prescribed performance control
Yu, P., & Dimarogonas, D. V. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8618995 · Cited by 2
“This level of centralized knowledge can be attained offline and is typical in many multi-agent approaches for less complex problems than the one in hand [20].”
BackgroundDistributed Parameter Estimation Under Event-triggered Communications
He, X., Liu, Q., Wu, J., et al. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865873 · Cited by 2
Yi, X., Zhang, S., Yang, T., et al. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865399 · Cited by 2
“2 PRELIMINARIES In this section, we present some definitions in algebraic graph theory [20] and the considered multi-agent system.”
BackgroundDistributed coestimation in heterogeneous sensor networks
Tran, D. M., Yucelen, T., Jagannathan, S., & Casbeer, D. W. (2019) · International Journal of Control · doi:10.1080/00207179.2019.1690693 · Cited by 2
Distributed Fault Detection and Isolation for Cooperative Mobile Manipulators
Gillini, G., Lippi, M., Arrichiello, F., et al. (2019) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2019.8913953 · Cited by 2
“From the mathematical point of view, the graph topology can be represented by the (N×N ) Laplacian matrix [17] defined as”
BackgroundEvent-triggered Coordination of Multi-agent Systems in Agricultural Environments
Pabon, J. D., & Mojica‐Nava, E. (2019) · IEEE Colombian Conference on Automatic Control (CCAC) · doi:10.1109/ccac.2019.8920970 · Cited by 2
PageRank Computation via Web Aggregation in Distributed Randomized Algorithms
Suzuki, A., & Ishii, H. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029680 · Cited by 2
“Such an assumption is often introduced in the analysis of asynchronous distributed algorithms (e.g., [16]).”
BackgroundDistributed Control of Rigid Body Reduced Attitude: Synchronization and Balancing
Maadani, M., & Butcher, E. A. (2019) · Indian Control Conference · doi:10.1109/icc47138.2019.9123229 · Cited by 2
“Reaching an agreement regarding this quantity is referred to as ”consensus” or ”synchronization” [1].”
BackgroundSubspace Projectors for State-Constrained Multi-Robot Consensus
Morbidi, F. (2020) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra40945.2020.9196758 · Cited by 2
Resilient Control Strategy for Detection and Mitigation of Disruptions in Microgrids
Yassaie, N., Hallajiyan, M., & Sharifi, I. (2020) · Iranian Conference on Electrical Engineering · doi:10.1109/icee50131.2020.9260818 · Cited by 2
“In this section, first some basic concepts on graphs are provided [13] and then the topological properties of networks are characterized in terms of graph robustness [12].”
BackgroundControllability and decentralized stabilization of the Kolmogorov forward equation for Markov chains
Elamvazhuthi, K., Biswal, S., & Berman, S. (2020) · Automatica · doi:10.1016/j.automatica.2020.109351 · Cited by 4
“…at any point x The nature of this obstruction to controllability is similar to the one in leader-based control of linear consensus protocols [19], in which inputs act at the vertices of the graph rather than the edges, and symmetries in the graph with respect to input locations have a…”
BackgroundMethodConsensus of Second-order Matrix-weighted Multi-agent Networks
Wang, C., Pan, L., Li, D., et al. (2020) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv50220.2020.9305509 · Cited by 2
“Consensus problem on scalar-weighted networks has been studied extensively for the last two decades [1][2][3].”
BackgroundFractional Domatic, Idomatic, and Total Domatic Numbers of a Graph
Goddard, W., & Henning, M. A. (2020) · Developments in mathematics · doi:10.1007/978-3-030-58892-2_4 · Cited by 2
“As remarked in [1], the generalization toK1,6-free graphs is of interest in multiagent robotics, because the class of K1,6-free graphs includes the class of unit disk graphs, where for every vertex there is a disk representing its transmission or interaction range centered at the vertex (see [24]).”
BackgroundAlavi, S. A., Rahimian, A., Mehran, K., et al. (2021) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12284 · Cited by 2
Sequencing of multi-robot behaviors using reinforcement learning
Pierpaoli, P., Doan, T. T., Romberg, J., et al. (2021) · Control Theory and Technology · doi:10.1007/s11768-021-00069-5 · Cited by 2
“We conclude this section with some additional comments about the formation control problem described in the previous example, where one can choose a single behavior B ∈ L together with a pair of parameters ( 𝜃 , 𝜙 ) for solving the problem, e.g., [28].”
BackgroundInfluentialSelf-citationDistributed Control with Time Transformation: User-Defined Finite Time Convergence and Beyond
Kurtoglu, D., Yucelen, T., & Tran, D. M. (2022) · AIAA SciTech Forum · doi:10.2514/6.2022-1716 · Cited by 2
Secured Filters Based on Saturated Innovations
He, X., Ren, X., Sandberg, H., & Johansson, K. H. (2022) · Lecture notes in control and information sciences · doi:10.1007/978-3-030-83236-0_1 · Cited by 2
Event-based rigid formation system with cooperative finite-time control
Tan, W., & Huang, N. (2021) · IMA Journal of Mathematical Control and Information · doi:10.1093/imamci/dnab041 · Cited by 2
Secure consensus with partial public protocols
Rong, L., & Xu, S. (2022) · Automatica · doi:10.1016/j.automatica.2022.110527 · Cited by 2
Discrete-Time Control of Multiagent Systems with a Misbehaving Node
Yildirim, E., & Yucelen, T. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867183 · Cited by 2
“To this end, the studies in control of multiagent networks as dynamical systems provide a system-theoretical framework for this problem (see, for example, [3], [5], [6] and references therein).”
BackgroundMulti-Agent Stochastic Control using Path Integral Policy Improvement
Várnai, P., & Dimarogonas, D. V. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867386 · Cited by 2
“The field has attracted much research, ranging from analytical [1] to deep reinforcement methods [2].”
BackgroundHuman dense avoidance based on a coverage control through robots
Morita, S., Okura, Y., & Kojima, C. (2022) · Electronics and Communications in Japan · doi:10.1002/ecj.12383 · Cited by 3
Distributed Dynamic Pricing for Car-sharing Systems with Stochastic Demand Shift
Sakurama, K., & Aoki, T. (2022) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc55140.2022.9921740 · Cited by 2
“In particular, by simplifying the models in this paper, the essence of the dynamics of the target system is revealed such that the dynamics are equivalent to a consensus control system with external disturbance, which has been well-studied in the field of control engineering [15].”
MethodYamauchi, J., Saitô, M., Omainska, M., et al. (2022) · SICE Journal of Control Measurement and System Integration · doi:10.1080/18824889.2022.2155454 · Cited by 2
Optimization-based Distributed Flocking Control for Drone Networks under Input Disturbances
Keisuke, K. A. T. O., & Ibuki, T. (2023) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.59.128 · Cited by 2
Consensus over Clustered Networks Using Output Feedback and Asynchronous Inter-Cluster Communication
Nino, C. F., Zegers, F. M., Phillips, S. A., et al. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156394 · Cited by 2
“Generally, distributed controllers are more amenable to scaling than centralized methods since the latter requires at least one agent to access and process global information [1].”
BackgroundA Complete Set of Connectivity-aware Local Topology Manipulation Operations for Robot Swarms
Soma, K., Khateri, K., Pourgholi, M., Montazeri, M., Sabattini, L., & Beltrame, G. (2023) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48891.2023.10160312 · Cited by 4
“As in [39], the degree matrix associated with a graph G is defined as:”
BackgroundControllability of consensus of multi-agent networks over heterogeneous dynamics
Muni, V. S., Rafeek, K. V. M., Athira, V. S., et al. (2023) · Results in Control and Optimization · doi:10.1016/j.rico.2023.100272 · Cited by 2
Aly, I. A., Dogan, K. M., Yucelen, T., & Muse, J. A. (2023) · International Journal of Control · doi:10.1080/00207179.2023.2285408 · Cited by 2
“In addition, the degree of a node, d i , represents the number of its neighbours, where the degree matrix of a graph where its key properties are captured in the following lemma (details in Mesbahi and Egerstedt (2010) and Lewis et al. (2014)).”
Flocking motion of multi-agent systems: A proximity digraph case
Barajas-Ramírez, J. G., & Ávila-Martínez, E. J. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.904 · Cited by 2
On Nash Equilibria for Decentralized Symbolic Control of Interconnected Finite State Systems
Pola, G., Santis, E. D., & Benedetto, M. D. D. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383662 · Cited by 2
“…optimization and reliability design [3], [4], [5], decentralized adaptive control [6], consensus and formation control problems in multi–agent systems [7], [8], [9], applications to mobile robotics [10], [11], decentralized supervisory control of discrete–event systems (DES) [12], [13].”
BackgroundAdaptive Consensus-Based Reference Generation for the Regulation of Open-Channel Networks
Fabris, M., Bellinazzi, M., Furlanetto, A., et al. (2024) · IEEE Access · doi:10.1109/access.2024.3357722 · Cited by 2
Connectivity Maintenance through Unlabeled Spanning Tree Matching
Hamaoui, M. (2024) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-024-02048-9 · Cited by 2
“Moreover, existence and iden-tification of a persistent interaction graph allows formulation of a linear control law which will asymptotically drive all agents to a constant displacement of the target positions (see Corollary 6.13 in [2]).”
InfluentialDistributed Model Reference Adaptive Control for an Uncertain Modular Robotic System
Vongkunghae, T., Aly, I. A., & Dogan, K. M. (2024) · AIAA SciTech Forum · doi:10.2514/6.2024-0116 · Cited by 2
Formation Control of Cooperative-Competitive Robot Manipulators with Inter-agent Constraints
Şekercioğlu, P., Jayawardhana, B., Sarras, I., et al. (2024) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2024.10.141 · Cited by 2
Distributed Online Planning for Min-Max Problems in Networked Markov Games
Tzikas, A. E., Park, J., Kochenderfer, M. J., & Allen, R. E. (2024) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2024.3409028 · Cited by 2
“The per-agent computational complexity of the proposed algorithm is completely determined by the three submodules included in Algorithm 1: the online planning module (POMCPOW) in line 5, the convex function approx-imator [22] in line 7, and the distributed optimization framework in lines 10–11.”
BackgroundMethodAdaptive Observer From Body-Frame Relative Position Measurements for Cooperative Localization
Carli, N. D., Restrepo, E., & Giordano, P. R. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3410893 · Cited by 2
“This demonstrates that, L is the classical unweighted Laplacian matrix, which, as well-known [17], [18], is positive semi-definite and if the graph has a spanning tree, then 0 is a simple eigenvalue corresponding to the right eigenvector 1 N = (cid:2) 1 , . . . (cid”
BackgroundOn Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph
Babarinsa, O., & Kamarulhaili, H. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-64419-6_28 · Cited by 2
Distributed estimation for spatial rigid motion based on dual quaternions
Zu, Y., Lee, U., & Dai, R. (2018) · Optimal Control Applications and Methods · doi:10.1002/oca.2416 · Cited by 2
“Distributed estimation technology has been commonly used in process control, signal processing and information systems [8].”
MethodA Follower-Based Control Allocation in Multi-Agent Networks
Buzorgnia, D., & Aghdam, A. G. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431516 · Cited by 2
“It is well-known that graph-theoretic techniques can be very effective in the formulation and analysis of multiagent network control systems [6]–[8].”
BackgroundDistributed Approach to Dynamic Quantization for Multi-Agent Systems
Jadhav, S., Datar, A., & Werner, H. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431183 · Cited by 2
“Distributed control and consensus problems have become an extensively studied area of research, some representative works being [1], [2], [3].”
BackgroundLippi, M., & Marino, A. (2018) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2018.8442476 · Cited by 2
“We assume the graph is connected and undirected [11].”
BackgroundAffine transformation‐based no‐beacon circular formation of agents
Jin, L., & Yu, S. (2019) · The Journal of Engineering · doi:10.1049/joe.2018.9389 · Cited by 2
Distributed Control Strategy of the Leader-Follower for Offshore Wind Farms under Fault Conditions
Wang, B., Tang, Z., Gao, X., Liu, W., & Xianhui, C. (2019) · Sustainability · doi:10.3390/su11082290 · Cited by 2
“In this section, we introduce some basic concepts in graph theory [24].”
BackgroundConsensus analysis of systems with time-varying interactions : An event-triggered approach
Kumar, S., Chowdhury, N. R., Sukumar, S., et al. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.1433 · Cited by 2
“The augmented dynamics of the system can be written in terms of the state vectors (5) Taking cue from Zelazo and Mesbahi (2011), Mesbahi and Egerstedt, 2010, p. 77-81 we transform the consensus problem of equation (5) into a stabilization problem by considering the edge states instead of node…”
InfluentialHamed, K. A., Kamidi, V. R., Pandala, A., et al. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147673 · Cited by 2
Buckley, I., West, M., Egerstedt, M., et al. (2019) · OCEANS MTS/IEEE Conference (OCEANS) · doi:10.23919/oceans40490.2019.8962667 · Cited by 2
Self-citationMajority Determination on Binary-valued Communication Networks
Azuma, S., & Nagahara, M. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9028909 · Cited by 2
“For the network structure G in (3), we denote by A 2 R n (cid:2) n , D 2 R n (cid:2) n , and L 2 R n (cid:2) n the adjacency matrix, the degree matrix, and the graph Laplacian, i.e., L = D (cid:0) A [18], respectively.”
BackgroundCommunication Topology Selection for Secondary Controllers in DC Microgrid
Premakumar, A. V. P., Shyam, A., Sahoo, S. R., et al. (2019) · National Power Electronics Conference (NPEC) · doi:10.1109/npec47332.2019.9034875 · Cited by 2
“convergence speed and offer inferior performance compared to a full communication [10].”
BackgroundSubmodular Input Selection for Synchronization in Kuramoto Networks
Sahabandu, D., Clark, A., Bushnell, L. G., et al. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304102 · Cited by 2
“A passivity-based decomposition was proposed in [13] to study synchronization in positively 2020 59th IEEE Conference on Decision and Control (CDC) Jeju Island, Republic of Korea, December 14-18, 2020”
MethodEconomically Enabled Energy Management: Overview and Research Opportunities
Wasa, Y., Tanaka, K. K., Tsuji, T., Managi, S., & Uchida, K. (2020) · Springer eBooks · doi:10.1007/978-981-15-3576-5_1 · Cited by 2
A stopping rule for multi-agent consensus with bounded noise in measurements
Hanada, K., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2020) · SICE International Symposium on Control Systems (SICE ISCS) · doi:10.23919/siceiscs48470.2020.9083495 · Cited by 2
“Since the undirected graph G is connected, the eigenvalues are all real values and satisfy 0 [12].”
BackgroundMajority Determination in Binary-Valued Communication Networks
Azuma, S., & Nagahara, M. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3038839 · Cited by 2
“Next, the off-diagonal elements of any graph Laplacian are nonpositive because L = D − A, D is diagonal, and the elements of A are nonnegative [19].”
BackgroundDistributed Concurrent Targeting of Point Source Queues
Wu, J., Zhang, F., Pu, W., et al. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264526 · Cited by 2
“In order to achieve specific group behaviors, distributed coordination is a key technique for multi-agent networks and has obtained a lot of attention from our control society [2], [3], [4].”
BackgroundRing Formation Maneuver: Single-Integrator Kinematics
Tran, D. M., Casbeer, D. W., García, E., Weintraub, I. E., Milutinović, D., & Manyam, S. G. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-0978 · Cited by 2
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.