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,201–2,300 of 2,960
Dynamical complex network theory applied to the therapeutics of brain malignancies
Meyer‐Baese, A., Fratte, D., Barbu, A., et al. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2181816 · Cited by 1
Graph-Based Framework for Evaluating the Feasibility of Transition to Maintainomics
Xing, B. (2014) · Studies in big data · doi:10.1007/978-3-319-08254-7_5 · Cited by 1
“Interested readers are referred to [48–50] for more information regarding GTA.”
BackgroundA decoherence theorem in quantum-network synchronization
Fu, S., Shi, G., & Petersen, I. R. (2015) · IEEE Conference on Control Applications (CCA) · doi:10.1109/cca.2015.7320877 · Cited by 1
“The analysis of quantum consensus seeking was further developed using the graphical methods for studying classical network systems [4], and it was shown that the vectorized density operator evolving along quantum consensus dynamics is equivalent to a number of parallel classical consensus dynamics over disjoint subgra…”
MethodConvergence rate of a distributed algorithm for matrix scaling to doubly stochastic form
Domínguez-García, A. D., & Hadjicostis, C. N. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039890 · Cited by 1
Graph-based verification and misbehavior detection in multi-agent networks
Lee, P., Saleh, O., Alomair, B., et al. (2014) · doi:10.1145/2566468.2566477 · Cited by 1
“Furthermore, it is known [14] that the linear update dynamics for distributed averaging is marginally stable, i.”
BackgroundInfluentialDecentralized Bayesian consensus over networks
Willert, V., Haumann, D., & Gering, S. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862220 · Cited by 1
“Each graph holds a maximal in-degree δin max = maxnδ in n and a maximal outdegree δout max = maxnδ out n [18].”
BackgroundGraph Matching-Based Topology Reconfiguration Algorithm for Systems of Networked Autonomous Vehicles
Navaravong, L., Shea, J. M., Pasiliao, E. L., et al. (2013) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2013.155 · Cited by 1
Ray, T., Majumdar, S., & Mukherjee, S. (2014) · International Conference on Non Conventional Energy (ICONCE) · doi:10.1109/iconce.2014.6808742 · Cited by 1
Uncontrollability of controlled consensus networks characterized by Faria vectors
Sieber, D., & Hirche, S. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862389 · Cited by 1
“If the eigenvector of the Laplacian has a zero-entry at the position of the leader the leader consensus network becomes uncontrollable [3], [5].”
BackgroundFault and Intrusion Tolerance of Complex Networks: A Controllability View
Zhou, Y., Zeng, Y., Liu, Z., et al. (2013) · International Conference on Intelligent Networking and Collaborative Systems (INCoS) · doi:10.1109/incos.2013.97 · Cited by 1
“A vertex is matched if it is an ending vertex of an edge in the matching.”
BackgroundMethodDistributed self-tuning consensus and synchronization
Radenković, M. S., & Gołkowski, M. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.12.006 · Cited by 1
“All rights reserved.”
Hybrid protocols for maintaining connectivity of multiagent systems
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.6759981 · Cited by 1
“Suppose, the graph G is subjected to a ∆-disk proximity graph [15] such that G(t) = (VG , EG(t)) where (i, j) 6∈ EG(t) if ‖xi(t) − xj(t)‖ > ∆.”
BackgroundInfluentialMenon, P. P., Edwards, C., & Shtessel, Y. B. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315590 · Cited by 1
“The optimisation problem considered here is not convex [6], [22].”
BackgroundMethodInfluentialGraph process specifications for hybrid networked systems
Twu, P., Martin, P., & Egerstedt, M. (2012) · Discrete Event Dynamic Systems · doi:10.1007/s10626-012-0134-2 · Cited by 1
“Each atom explicitly states a network topological transition (a so-called graph process as discussed in Mesbahi and Egerstedt 2010).”
BackgroundSelf-citationCharalampidis, A. C. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039605 · Cited by 1
“Initially stated as a problem of agreement in groups of individuals [7], it seems to be widely accepted as important for the multiagent systems and is included in textbooks and reviews of the field [3], [8].”
BackgroundConstrained formation protocols for networked multiagent systems
Torre, G. D. L., Yucelen, T., & Johnson, E. N. (2013) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas.2013.6564766 · Cited by 1
“Unlike the formation protocols presented in [2] and [8], the proposed formation protocol in (13) defines a set of possible control inputs.”
BackgroundObserver-based synchronization of networked distributed parameter systems
Lou, X., Ye, Q., & Cui, B. (2014) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2014.7053530 · Cited by 1
The forest consensus theorem and asymptotic properties of coordination protocols
Chebotarev, P., & Пашаевич, А. Р. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130925-2-de-4044.00052 · Cited by 1
Circular formation control protocols for dynamic unicycles via hybrid stabilization of sets
Haddad, W. M., & Hui, Q. (2013) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2013.6608921 · Cited by 1
“For our result, we assume that the graph G of the communication topology for the mobile agents is undirected and strongly connected [3].”
BackgroundSource seeking with a variable Leader multi-agent fixed topology network
Paliotta, C., & Pettersen, K. Y. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330672 · Cited by 1
“Conditions on the graph structure to be controllable are given in [2], [11], [18].”
BackgroundMethodInfluentialCluster synchronization and controllability of complex multi-agent networks
Xia, W., & Cao, M. (2012) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2012.6271573 · Cited by 1
“First consider the case when the graph G = (V, E) is unweighted and undirected as in [12], [11], meaning that for any distinct pair of nodes i and j, if (i, j) ∈ E , then (j, i) ∈ E and the weights aij = aji = 1.”
BackgroundOn the Role of Homogeneity When Controlling Single‐Leader Networks
Twu, P., & Egerstedt, M. (2012) · Asian Journal of Control · doi:10.1002/asjc.609 · Cited by 1
“Before stating this result, however, we must first review some definitions from [5, 11, 12].”
BackgroundSelf-citationA comparative study of persistence based convergence rate estimates to consensus
Chowdhury, N. R., & Sukumar, S. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.09.241 · Cited by 2
Zavlanos, M. M., Egerstedt, M., & Pappas, G. J. (2011) · Cited by 1
Self-citationSynchronization in Cartesian-Product Networks of Time-Delay Coupled Systems
Murguia, C., Ramírez, J. P., Jeurgens, N., et al. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.11.044 · Cited by 1
Shao, H., Xi, Y., & Mesbahi, M. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402001 · Cited by 1
“ing communication network is connected [8], [9].”
BackgroundSelf-citationA New Centrality Measure Based on Formation Response
Robertson, C. J., Sinclair, A. J., & Doucette, E. A. (2016) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2016-0639 · Cited by 1
New Results On Stochastic Consensus Networks
Somarakis, C., & Baras, J. S. (2015) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611974072.17 · Cited by 1
Synchronization of Linear Multi-Agent Systems with Input Nonlinearities via Dynamic Protocols
Takaba, K. (2015) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-21003-2_9 · Cited by 1
A Distributed Control Algorithm for Small Swarms in Cordon and Patrol
Alder, C. (2016) · ScholarsArchive (Brigham Young University) · Cited by 1
Robust metropolis-hastings algorithm for safe reversible Markov chain synthesis
Chamie, M. E., & Acikmese, B. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526795 · Cited by 1
“The M-H algorithm builds on the theory of Markov processes, Markov-Chain-Monte-Carlo sampling methods [4], [5], [6], [7], [8], [9], graph theory [10], [11], and Lyapunov stability analysis.”
MethodFollower distribution algorithms for leader-follower networks
Cannataro, B. Ş., Kan, Z., & Dixon, W. E. (2016) · doi:10.1109/cacsd.2016.7602540 · Cited by 1
“Multi-agent networked systems have wide potential in civilian and military applications such as transportation and distribution, logistics, surveillance, search and rescue operations, humanitarian demining, environmental monitoring, and planetary exploration [1]–[4].”
BackgroundCarvalho, S. R., Pinto, L. R., Almeida, L., et al. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.11.158 · Cited by 1
Tran, D. M., Yucelen, T., & Peterson, J. (2017) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2017-1505 · Cited by 1
Communication protocol design in event-triggered control of multi-agent systems
Meng, X., Xie, L., & Soh, Y. C. (2016) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2016.7838626 · Cited by 1
“Some fundamental algorithms have been developed from a theoretical point of view with the assumption of unlimited on-board energy and communication bandwidth [3], [4], [5], [6].”
BackgroundOn the controllability of diffusively coupled multi-agent networks with switching topologies
Cao, M. (2012) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 1
Agreeing over quantum hybrid networks: Centralized and distributed solutions
Shi, G., Li, B., Miao, Z., Dower, P. M., & James, M. R. (2016) · Australian Control Conference · doi:10.1109/aucc.2016.7868180 · Cited by 1
“Consensus seeking over complex networks has played a foundational role in the development of distributed computation and networked control systems [8], [13].”
BackgroundOn the connectivity of unions of random graphs
Hale, M. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264311
“We denote the sample space of all Erdős-Rényi graphs on n nodes with edge probability p by G(n, p), and we denote the set of Laplacians of all such graphs by L(n, p).”
BackgroundMethodInfluentialEnumeration of Configurations and Their Kinematics for ModRED II Modular Robots
Hossain, K. M., Nelson, C. A., & Dasgupta, P. (2016) · doi:10.1115/detc2016-60307 · Cited by 1
Designing Function Allocations in Air Traffic Concepts of Operation Using Network Optimization
Bhattacharyya, R., & Pritchett, A. R. (2017) · Journal of Air Transportation · doi:10.2514/1.d0075 · Cited by 2
Discrete-time algorithm for distributed Nash equilibrium seeking of a class of aggregative games
Wang, L., Liang, S., & Hong, Y. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8029164 · Cited by 1
“3 Graph Theory The following concepts of graph theory can be found in [12].”
BackgroundNecessary and sufficient conditions for controllability of multi-agent systems with special topology
Guan, Y., & Long, W. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028673 · Cited by 1
Consensus disturbance rejection over uncertain networks
Liu, M., & Li, Z. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028728 · Cited by 1
“Lemma 1 ([21]) For a weighted undirected graph, L = DWD , where W ∈ R|E|×|E| is a diagonal matrix whose diagonal items are positive aij .”
BackgroundOn Timescale Separation in Networked Systems With Intermittent Communication
Awad, A., & Narang-Siddarth, A. (2017) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4038096 · Cited by 1
Averaging in Time-Invariant Networks
Fagnani, F., & Frasca, P. (2017) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-68022-4_2 · Cited by 1
Resilient Control of Linear Time-Invariant Networked Multiagent Systems
Peterson, J., Torre, G. D. L., Yucelen, T., Tran, D. M., Dogan, K. M., & McNeely, D. (2017) · ASME Dynamic Systems and Control Conference (DSCC) · doi:10.1115/dscc2017-5059 · Cited by 1
“Until recently, however, much work has focused on fixed-gain distributed controllers, which are unable to recover the desired performance in the presence of unknown exogenous disturbances as outlined in [3] and [4].”
BackgroundSynchronization in Time-Varying Networks
Frasca, M., Gambuzza, L. V., Buscarino, A., & Fortuna, L. (2018) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-319-75957-9_6 · Cited by 3
Output synchronization of passive agents over stochastically switching networks
Takaba, K. (2013) · Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications · doi:10.5687/sss.2013.269 · Cited by 1
Liu, Z., Saberi, A., Stoorvogel, A. A., et al. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431198 · Cited by 1
Tran, D. M., Yucelen, T., Jagannathan, S., et al. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431110 · Cited by 1
“We next recall some basic notions from graph theory and refer to excellent textbooks [13] and [14] for details.”
BackgroundLiu, Z., Saberi, A., & Stoorvogel, A. A. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431721 · Cited by 1
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [10], [13], [17], [22] and references therein).”
BackgroundNetwork Linear Equations with Finite Data Rates
Lei, J., Yi, P., Shi, G., & Anderson, B. D. O. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619116 · Cited by 1
“Simultaneously, control theory has embraced to a much greater degree than graph theory, communication theory, and complexity analysis, leading to many celebrated results for both theories and applications [3].”
BackgroundReal-Time Verification for Distributed Cyber-Physical Systems
Tran, H.-D., Nguyen, L. V., Musau, P., et al. (2015) · Leibniz transactions on embedded systems · doi:10.4230/lites.8.2.7 · Cited by 1
Structure-preserving model reduction of physical network systems by clustering
Monshizadeh, N., & van der Schaft, A. J. (2014) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.48550/arxiv.1403.4789 · Cited by 1
Continuous-time Proportional-Integral Distributed Optimization for Networked Systems
Droge, G. N., Kawashima, H., & Egerstedt, M. (2013) · SMARTech Repository (Georgia Institute of Technology) · doi:10.48550/arxiv.1309.6613 · Cited by 1
“The graph Laplacian for a connected graph with N nodes always has rank N − 1 , [2].”
InfluentialSelf-citationOptimal Bilevel Lottery Design for Multiagent Systems
Kim, H., & Zhu, M. (2023) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2023.3296643 · Cited by 2
“Substantial effort has been spent on analysis, design, and con-trol of multiagent systems [1], [2], [3], [4], [5].”
MethodDistributed Connectivity-Preserving Coordination of Multi-agent Systems with Bounded Velocities
Yang, Y., Constantinescu, D., & Shi, Y. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-25629-6_108 · Cited by 1
Realtime l1-fault-and-state estimation for multi-agent systems
Hashimoto, K., Chong, M. S., & Dimarogonas, D. V. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815068 · Cited by 1
“The control of multi-agent systems arises in many areas, such as vehicle platooning, formation control of autonomous vehicles and satellites, cooperative control of robots and so on [1].”
BackgroundCollision-Free Decentralised Density Feedback Control for Swarms
Eren, U., & Hansen, E. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.11.270 · Cited by 1
Lag-Bipartite Consensus of Linear Multi-agent Systems over Signed Directed Graph
Bhowmick, S., & Panja, S. (2019) · IEEE Region 10 Symposium (TENSYMP) · doi:10.1109/tensymp46218.2019.8971042 · Cited by 1
“There is copious amount of studies carried out on collaborative control of MAS that interact over unsigned graph [3] where the agents achieve the control tasks by cooperating with one-another.”
Backgroundℋ2 sub-optimal model reduction for second-order network systems
Yu, L., Cheng, X., Scherpen, J. M. A., et al. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029735 · Cited by 1
“The following definitions can be found in [30].”
BackgroundTang, Y., & Wang, D. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6263 · Cited by 1
“tive semidefinite. Denote its i-th row as L i and its ordered eigenvalues as 0=λ 1 ≤λ 2 ≤...λ N. The corresponding eigenvector of λ 1 =0 is the all one vector 1 N. Here is a lemma for connected graphs [28]. Lemma 1: Let L be the Laplacian matrix of an undirected graph G. Then, λ 2 >0 if and only if the graph G is co…”
BackgroundSliding Modes in Consensus Control
Zambelli, M., & Ferrara, A. (2020) · Studies in systems, decision and control · doi:10.1007/978-981-15-8613-2_8 · Cited by 2
Masroor, S., & Peng, C. (2021) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-021-05513-x · Cited by 1
Robust Sampled-Data Consensus-Based Cooperative Control of Multi–UAVs
Ferdinando, M. D., Pepe, P., & Gennaro, S. D. (2021) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med51440.2021.9480249 · Cited by 1
Xue, X., Yue, X., & Yuan, J. (2021) · Lecture notes in electrical engineering · doi:10.1007/978-981-15-8155-7_307 · Cited by 1
Haddad, W. M., & Lee, J. (2021) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta48906.2021.9659121 · Cited by 1
An Information Flow Filter Approach to Formation Control for Heterogeneously Scheduled LPV Agents
Attallah, A., & Werner, H. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9682780 · Cited by 1
Discrete Time Consensus Algorithm In Multi-Agent System
Patil, A., & Shah, G. (2021) · Indian Control Conference · doi:10.1109/icc54714.2021.9702911 · Cited by 2
Cooperative Target Capture Using Predefined-Time Consensus
Sinha, A., & Kumar, S. R. (2021) · Indian Control Conference · doi:10.1109/icc54714.2021.9703170 · Cited by 1
“[43] The smallest non-zero eigenvalue of L(G) (denoted by λ2 (L(G)) and referred to as the algebraic connectivity of the graph, G satisfies x>L(G)x ≥ λ2 (L(G))‖x‖(2)2 > 0 for some x ∈ R.”
BackgroundIndirect adaptive synchronization for a heterogeneous multiagent network
Arevalo‐Castiblanco, M. F., Tellez‐Castro, D., & Mojica‐Nava, E. (2022) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.3404 · Cited by 1
An Euler-Poincaré Approach to Mean-Field Optimal Control
Liu, H., & Shi, D. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-16-9492-9_204 · Cited by 1
Distributed control for complex missions: Quasi‐linear parameter varying approach
Attallah, A., & Werner, H. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6184 · Cited by 1
Distributed formation control of a fleet of underwater gliders
Ma, X., Wang, Y., Niu, W., et al. (2022) · OCEANS 2022 - Chennai · doi:10.1109/oceanschennai45887.2022.9775506 · Cited by 1
Consensus in Operational Space for Robotic Manipulators with Task and Input Constraints
Murtaza, M. A., & Hutchinson, S. (2022) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra46639.2022.9811846 · Cited by 1
Holzinger, M. J., McMahon, J. W., Rivera, K., et al. (2022) · Journal of Spacecraft and Rockets · doi:10.2514/1.a35188 · Cited by 1
Fault-tolerant formation control of wheeled mobile robots using energy-balancing methods
Paglianti, I., & Cristofaro, A. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838156 · Cited by 1
Butcher, E. A. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.11.349 · Cited by 1
Control of Misbehaving Multiagent Networks through Driver Nodes: The Directed Graph Case
Yildirim, E., & Yucelen, T. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992525 · Cited by 1
Hierarchical Optimal Control for Multiple Aircraft and Spacecraft
Tsubakino, D., & Nishimoto, S. (2023) · Journal of the Japan Society for Precision Engineering · doi:10.2493/jjspe.89.289 · Cited by 1
Consensus Control of Multi-Hopping-Rover Systems: Convergence Analysis
Takekuma, S., Azuma, S., Ariizumi, R., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3264562 · Cited by 1
“For this purpose, we employ the following controller [10], [11], [12]:”
BackgroundMethodInfluentialVoice activity detection in the presence of transient based on graph
Guo, X., Gao, C.-X., & Liu, H. (2023) · EURASIP Journal on Audio Speech and Music Processing · doi:10.1186/s13636-023-00282-x · Cited by 1
On impact of disturbance in the deployment problem of multi-agent system
Topolewicz, K., Olaru, S., Girejko, E., et al. (2023) · Archives of Control Sciences · doi:10.24425/acs.2023.146277 · Cited by 1
Network Science and Automation
Zino, L., Barzel, B., & Rizzo, A. (2023) · Springer handbooks · doi:10.1007/978-3-030-96729-1_11 · Cited by 1
Estimating Networks of Interaction in Fish Schools with a Minimal Model
Kawashima, H. (2023) · IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) · doi:10.1109/percomworkshops56833.2023.10150309 · Cited by 1
“This paper deals with the problem of estimating such a network of influence among individuals, also referred to as an interaction network [7], [8], when the network changes dynamically.”
BackgroundRendezvous Under Cyclic Pursuit With Heterogeneous Input and Communication Delays
De, S., Sahoo, S. R., & Wahi, P. (2023) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2023.3297716 · Cited by 1
“These rendezvous protocols find potential applications in area reconnaissance and search mission [8].”
BackgroundPhase Synchronization With Intermittent Locomotion and Nonoverlapping Sensing and Actuation
Thompson, A. A., Cañuelas, L., & Paley, D. A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3300362 · Cited by 1
“…and the general form of (40) for N particles with noise-free output feedback is where I is the identity matrix of appropriate dimensions, entries on the diagonal, and D ∈ R N 2 − N × N is the transpose of incidence matrix [28] of an all-to-all communication network multiplied by ( e − LT − 1) .”
BackgroundSafety-Critical Control of Euler-Lagrange Systems Subject to Position Constraints
Liu, Z., Wu, S., & Liu, T. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240875 · Cited by 1
On the Critical Value of Time-Delay in Multiagent Systems
Agaev, R., & Khomutov, D. (2023) · 2023 International Russian Automation Conference (RusAutoCon) · doi:10.1109/rusautocon58002.2023.10272796 · Cited by 1
Safety-Critical Control of Euler-Lagrange Systems Subject to Position and Velocity Constraints
Liu, Z., Wu, S., & Liu, T. (2023) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc58219.2023.10326867 · Cited by 1
Local Unidentifiability of EdgeWeights for Linear Systems with Graph Laplacian
Yamakawa, M., Asai, T., Ariizumi, R., et al. (2023) · Annual Conference of the Society of Instrument and Control Engineers (SICE) · doi:10.23919/sice59929.2023.10354231 · Cited by 1
Controlling Identical Linear Multi-Agent Systems Over Directed Graphs
Zaupa, N., Zaccarian, L., Tarbouriech, S., et al. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383830 · Cited by 1
“The spectrum of the Laplacian matrix of this graph plays an important role in the evolution of the associated networked system [3].”
BackgroundYamakawa, M., Asai, T., Ariizumi, R., et al. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383345 · Cited by 1
A Scalable Approach for Analysing Multi-Agent Systems with Heterogeneous Stochastic Packet Loss
Hespe, C., & Werner, H. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383506 · Cited by 1
“In particular, this holds for multi-agent systems (MASs), in which small-scale dynamical systems – called agents and typically only coupled through their mission – collectively solve a control task, such as distributed estimation or source seeking [2].”
BackgroundMethodInfluentialDistributed Neighbor Selection on Matrix-weighted Networks
Wei, H., Pan, L., Shao, H., et al. (2023) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac59482.2023.10401720 · Cited by 1
“The concept of multi-agent systems with distributed rules applied is frequently explored, where numerous independent nodes exist, capable of interacting and exchanging information with neighboring nodes, or the so-called “neighbors” [1], [2], [3].”
BackgroundRecursive Multi-agent Wind Structure Estimation Formulation
Nayeem, N. M., & Faruque, I. (2024) · AIAA SciTech Forum · doi:10.2514/6.2024-2822 · Cited by 1
Hybrid Flock - Formation Control Algorithms
Baumann, C., Perolini, J., Tourki, E., et al. (2024) · Springer proceedings in advanced robotics · doi:10.1007/978-3-031-51497-5_37 · Cited by 1
Nazeer, M. S., Aggravi, M., Giordano, P. R., & Pacchierotti, C. (2024) · International Conference on Control, Automation and Robotics (ICCAR) · doi:10.1109/iccar61844.2024.10569813 · Cited by 1
“If λ 2 > 0 , the graph is connected, while if λ 2 = 0 , the graph is disconnected [46].”
Kurttisi, A., Dogan, K. M., & Gruenwald, B. C. (2024) · Electronics · doi:10.3390/electronics13061142 · Cited by 1
“In addition, since we utilize Graph Theory, for the results of this paper, we start with defining graph-theoretical notations that are standard in the literature [5].”
BackgroundMethodNodal Consensus in Multiagent Systems With Edge Communications
Rong, L., Jiang, G.-P., & Xu, S. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3386055 · Cited by 1
“Then, the Laplacian matrix L o satisfies that L o = EE T [38].”
Background
Metadata
- Authors
- Mesbahi, M., & Egerstedt, M.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 2010-12-31
- OpenAlex
- W613360614
- Cited by
- 2,897
- References
- 0
- Citations by year
- 2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
- FWCI
- 74.30
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Princeton University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.