The DOI matches its Crossref record.
Graph Theoretic Methods in Multiagent Networks
Abstract
This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Items 1,401–1,500 of 2,960
Distributed Stabilization Control of Rigid Formations with Prescribed Orientations
Sun, Z. (2018) · Springer theses · doi:10.1007/978-3-319-74265-6_6 · Cited by 6
Local Convergence of Multi-Agent Systems Toward Rigid Lattices
Giusti, A., Coraggio, M., & di Bernardo, M. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3289060 · Cited by 6
“We wish to remark here that formation control [15], [16], [17] differs from geometric pattern formation because of a typically smaller number of agents (order of tens) with, possibly, unique identifiers, numerous roles for the agents and often some coordinated motion of the agents.”
BackgroundDouble Integrator Consensus Systems With Application to Power Systems
Goldin, D. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130925-2-de-4044.00023 · Cited by 6
Zhang, K., & Demetriou, M. A. (2013) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2013-4800 · Cited by 6
Пашаевич, А. Р., & Chebotarev, P. (2017) · Automation and Remote Control · doi:10.1134/s0005117917010076 · Cited by 6
“An equivalent condition is the presence of a spanning in-tree in this digraph [1, 2].”
BackgroundEvent triggered non-inverting chopper fed networked DC motor speed synchronization
Masroor, S., & Peng, C. (2018) · COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering · doi:10.1108/compel-09-2017-0397 · Cited by 6
Contzen, M. P. (2018) · European Journal of Control · doi:10.1016/j.ejcon.2018.05.001 · Cited by 5
Strong Structural Controllability and Zero Forcing
van Waarde, H. J., Monshizadeh, N., Trentelman, H. L., et al. (2019) · Lecture notes in control and information sciences · doi:10.1007/978-3-030-18572-5_3 · Cited by 6
Interaction Matrix Based Analysis and Asymptotic Cooperative Control of Multi-agent Systems
Hou, Z., Xu, J., Zhang, G., Wang, W., & Han, C.-S. (2019) · International Journal of Control Automation and Systems · doi:10.1007/s12555-018-0841-z · Cited by 6
Liu, T., Trinh-Hoang, M., Yang, Y., & Pesavento, M. (2019) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap45676.2019.9022643 · Cited by 7
“The graph Laplacian is defined as L = diag(W1)−W, which is always positive semidefinite and singular [14].”
BackgroundTime-scale Separation on Networks for Multi-City Epidemics
Lewien, P., & Chapman, A. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9030236 · Cited by 6
“They provide an effective platform for modelling and understanding complex phenomena that arise from interactions between dynamic systems [1].”
BackgroundLeader-Follower Bearing-based Formation System with Exogenous Disturbance
Bae, Y., Ahn, H., & Lim, Y. (2019) · IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) · doi:10.1109/saci46893.2019.9111593 · Cited by 6
“We note that rank(H) = n−1 for a connected graph [14].”
BackgroundMaadani, M., & Butcher, E. A. (2020) · Transactions of the Institute of Measurement and Control · doi:10.1177/0142331220969055 · Cited by 6
“Thus, from LaSalle’s invariance principle, the system converges to span f 1 nl g , which is the agreement subspace (Mesbahi and Egerstedt, 2010).”
BackgroundMethodResilient Self/Event-Triggered Consensus Based on Ternary Control
Matsume, H., Wang, Y., & Ishii, H. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304448 · Cited by 6
“In such systems, a number of agents form a network over which they communicate with each other using wired or wireless channels and individually make decisions to achieve their global objectives [1].”
BackgroundDamping With Varying Regularization in Optimal Decentralized Control
Feng, H., & Lavaei, J. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3102008 · Cited by 6
Bounded Hybrid Connectivity Control of Networked Multiagent Systems
Torre, G. D. L., Yucelen, T., & Johnson, E. N. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2303247 · Cited by 6
“3We refer to [2] and [18] for additional details.”
BackgroundSpectrum of Laplacians for Graphs with Self-LoopsPreprint
Acikmese, B. A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.08133 · Cited by 6
“1 Introduction Graph theory has proven to be an extremely useful mathematical framework for many emerging engineering applications [1, 2, 3, 4, 5, 6].”
BackgroundMethodDistributed estimation and control for preserving formation rigidity for mobile robot teamsPreprint
Sun, Z., Yu, C. B., & Anderson, B. D. O. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.4850 · Cited by 6
“Further detai ls can be found in [12] and [4].”
BackgroundInfluentialSwitching to LearnPreprint
Shahrampour, S., Rahimian, M. A., & Jadbabaie, A. (2015) · arXiv (Cornell University) · Cited by 6
Velocity Field Generation for Density Control of Swarms using Heat Equation and Smoothing KernelsPreprint
Eren, U., & Acikmese, B. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.00299 · Cited by 6
“…such as leader-follower Desai et al. (2001); Yu et al. (2010) based solutions, algorithms that takes advantage of graph theory and consensus notion Mesbahi and Egerstedt (2010); Chapman (2015); Gal-busera et al. (2007), distributed optimization techniques Zhu and Mart´ınez (2015) and artificial…”
BackgroundContinuous-time Opinion Dynamics on Multiple Interdependent TopicsPreprint
Ye, M., Trinh, M. H., Lim, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.02836 · Cited by 6
“ph is strongly connected if and only if, for every node v i, there exists a directed path to every other node v j. The following is a standard result that will be used throughout this paper. Lemma 1 ([16]) The Laplacian Lassociated with a graph G= (V;E;A) has a single eigenvalue at 0 if and only if Ghas a directed spa…”
MethodOn the NP-completeness of the Constrained Minimal Structural Controllability/Observability ProblemPreprint
Pequito, S., Kar, S., & Aguiar, A. P. (2014) · arXiv (Cornell University) · Cited by 6
Shifting Opinions in a Social Network Through Leader SelectionPreprint
Yi, Y., Castiglia, T., & Patterson, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.13009 · Cited by 6
“Since −LF,F is Hurwitz for a nonempty leader set S [26], the system converges to a single stable steady state [27].”
BackgroundA Survey of Distributed Optimization Methods for Multi-Robot SystemsPreprint
Halsted, T., Shorinwa, O., Yu, J., & Schwager, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.12840 · Cited by 71
“Other useful background material can be found for distributed computation [23] [24], and on multi-robot systems in [25] [26].”
BackgroundConsensus-Driven Deviated Pursuit for Guaranteed Simultaneous Interception of Moving Targets
Sinha, A., Mukherjee, D., & Kumar, S. R. (2025) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2025.3575049 · Cited by 5
Zhang, L., He, X., Yu, J., et al. (2025) · ISA Transactions · doi:10.1016/j.isatra.2025.08.050 · Cited by 5
Tracking Control with Zero Phase-Difference for Linear Switched Reluctance Machines Network
Zhang, B., Pan, J., Yuan, J., et al. (2017) · Energies · doi:10.3390/en10070949 · Cited by 5
“The parameters θ, φ described in Equation (7) can be estimated by the recursive least square method as [29]: θ̂(k) = θ̂(k− 1) + R(k)ei(k), R(k) = P(k− 1)φ(k− 1) [ ρ + φT(k)P(k− 1)φ(k) ]−1, P(k) = ρ−1 [ I − K(k)φT(k) ] P(k− 1), (8)”
BackgroundCluster consensus in multi-partitioned matrix weighted graphs
Gopika, R., Resmi, V., & Warier, R. R. (2022) · Asian Control Conference (ASCC) · doi:10.23919/ascc56756.2022.9828008 · Cited by 5
Mariano, S., Bertollo, R., Postoyan, R., et al. (2023) · Automatica · doi:10.1016/j.automatica.2023.111324 · Cited by 5
A Window-Based Periodic Event-Triggered Consensus Scheme for Multiagent Systems
Seidel, M., Hertneck, M., Yu, P., Linsenmayer, S., Dimarogonas, D. V., & Allgöwer, F. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3285863 · Cited by 5
“However, the presented re-sults for single-integrator dynamics can be extended to multiple states by redefining L using the Kronecker product, cf., [1].”
BackgroundMethodInfluentialYuan, R., Zhao, Z., Chen, S., & Chai, T. (2024) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7336 · Cited by 6
“38”
Decentralized Connectivity Maintenance for Multi-Agent Systems Using Control Barrier Functions
Bhatia, P., Roy, S. B., Sujit, P. B., et al. (2024) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas60882.2024.10557121 · Cited by 5
“Proof: The proof can be found in section 2.4 of [15].”
BackgroundInfluentialDistributed Minimum-Time Consensus Prediction for High-Order Multiagent Systems
Hu, F., Zhang, H., Xu, B., & Zhe, H. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3535664 · Cited by 7
Modeling and Analysis of Delayed Matthew Effect in Social Systems via $k$-Winners-Take-All Network
Wang, J., Li, S., Jin, L., & Li, S. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3562075 · Cited by 5
“Lemma 1: Given a connected undirected graph with n nodes to represent the social network, the Laplacian matrix of the social network is real symmetric and positive semi-definite, and its real eigenvalues are able to arrange in order as 0 = μ 1 < μ 2 ≤ . . . ≤ μ n [44].”
Responsiveness and manipulability of formations of multi-robot networks
Kawashima, H., Zhu, G., Hu, J., et al. (2012) · doi:10.1109/cdc.2012.6426291 · Cited by 5
“Let D(G) ∈ {−1, 0, 1} be an incidence matrix [2] of graph G.”
BackgroundSelf-citationA novel homogenous protocol for multi-agent clustering over directed graphs
Proskurnikov, A. V., & Cao, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525197 · Cited by 5
Leader-follower synchronization with disturbance rejection
Paliotta, C., & Pettersen, K. Y. (2016) · IEEE Conference on Control Applications (CCA) · doi:10.1109/cca.2016.7587858 · Cited by 5
“Further information about graph theory can be found in [22].”
BackgroundPerformance of Second-Order Platoon of Vehicles in Presence of Time-Delay and Noise
Ghaedsharaf, Y., Somarakis, C., & Motee, N. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431737 · Cited by 6
“Consensus networks exist in numerous applications and natural systems including bird flocking, power grid and formation control of autonomous vehicles [1]–[5].”
BackgroundGao, F., Chen, W., Li, Z., Li, J., & Yan, R. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2896458 · Cited by 5
“During the past decade, consensus problems for multiagent systems have received tremendous interest (see [10], [30]–[34], and the references therein).”
BackgroundTrust-Driven Privacy in Human-Robot Interactions
Hale, M., Setter, T., & Fregene, K. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815004 · Cited by 7
“These results are motivated by the various goal-oriented robotic applications in which gradient-based controllers are used, such as rendezvous, formation control, and coverage control [21], and we present a case study to show the behaviors one can attain with this framework.”
BackgroundDistributed leader following of an active leader for linear heterogeneous multi-agent systems
Chung, Y.-F., & Kia, S. S. (2020) · Systems & Control Letters · doi:10.1016/j.sysconle.2020.104621 · Cited by 5
Finite horizon discrete models for multi-agent control systems with coupled dynamics
Boskos, D., & Dimarogonas, D. V. (2020) · Automatica · doi:10.1016/j.automatica.2020.108838 · Cited by 6
“These dynamics can describe several multi-agent controllers, including consensus, connectivity maintenance, rendezvous, and formation [25], which are encountered for instance in decentralized multi-robot coordination applications.”
BackgroundTarassov, V. B., & Gapanyuk, Y. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-59535-7_13 · Cited by 5
Benahmed, S., Riedinger, P., & Pierfederici, S. (2021) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2021.06.142 · Cited by 6
Thermodynamical Material Networks for Modeling, Planning, and Control of Circular Material Flows
Zocco, F., Sopasakis, P., Smyth, B. M., & Haddad, W. M. (2023) · International Journal of Sustainable Engineering · doi:10.1080/19397038.2023.2209582 · Cited by 5
“…formalism to represent a network of systems is graph theory (Bondy and Murty 1976); examples of network design theories based on graphs are electrical networks (Freitas, Delvenne, and Esposito 2020), hydraulic networks (Deuerlein 2008), and multiagent systems (Mesbahi and Egerstedt 2010).”
BackgroundMethodMinimal Laplacian Controllability of Directed Threshold Graphs
Hsu, S. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3135350 · Cited by 5
Distributed Consensus of Stochastic Multi-agent Systems with Prescribed Performance Constraints
Jagtap, P., & Dimarogonas, D. V. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683249 · Cited by 5
“Among many interesting problems, the synchronization or consensus problem of multi-agent system is an active research topic in the past years [3], [4], whose objective is to design a distributed consensus algorithm (or protocol) using only limited neighborhood information to ensure that all the agents achieve some com…”
BackgroundExcitation Allocation for Generic Identifiability of Linear Dynamic Networks With Fixed Modules
Dreef, H. J., Shi, S., Cheng, X., et al. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3171172 · Cited by 5
“The dynamic network interconnection structure can be represented by a directed graph ˘ G that consists of the finite set of vertices ˘ V := { 1 , 2 , . . . , L } and the edge set See for details of graph theory e.g., [12].”
BackgroundGe, F., Chen, Y., & Kou, C. (2018) · Springer eBooks · doi:10.1007/978-3-319-72896-4_1 · Cited by 5
Axelson-Fisk, M., & Knorn, S. (2022) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2022.07.243 · Cited by 5
Further Analysis on Structure and Spectral Properties of Symmetric Graphs
Tran, Q. V., & Ahn, H. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9837973 · Cited by 5
Event-triggering Signed-average Consensus Algorithms under Directed Signed Networks
Du, W. J., Wei, Y., & Fu, S. (2022) · International Journal of Control Automation and Systems · doi:10.1007/s12555-021-0746-0 · Cited by 5
A distributed counting architecture for exploring the structure of anonymous active–passive networks
Tran, D. M., Casbeer, D. W., & Yucelen, T. (2022) · Automatica · doi:10.1016/j.automatica.2022.110550 · Cited by 6
On the Emergent Hypocycloidal and Epicycloidal Formations in a Swarm of Double Integrator Agents
Fedele, G., & D’Alfonso, L. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3210044 · Cited by 5
“Lemma 1: For a connected undirected graph G, defined by the Laplacian matrix LG , the following properties are important for the analysis of the swarm [26]: • LG is a semidefinite matrix with at least one zero eigenvalue with the associated eigenvector 1n; • LG has a simple zero eigenvalue if and only if the correspon…”
BackgroundH∞ performance of multi‐agent consensus with output feedback and saturated input
Aggarwal, S., Goyal, J. K., Ghosh, S., et al. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6491 · Cited by 5
Control Architecture for Synchronization and Tracking in Descriptor Multi-Agent Systems
Patel, M., & Datta, S. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3313512 · Cited by 5
Topology uniformity pinning control for multi-agent flocking
Liu, J., Wu, Z., Xin, Q., et al. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-023-01253-7 · Cited by 5
“Specifically, the smallest non-zero eigenvalue λ 2 of the Laplacian matrix directly indicates the robustness of graph connectivity and even affects the convergence of multi-agent distributed cooperative control [15].”
Laplacian Eigenvalue Allocation Through Asymmetric Weights in Acyclic Leader-Follower Networks
Parlangeli, G. (2023) · IEEE Access · doi:10.1109/access.2023.3331592 · Cited by 5
“Consider now that one node, say node 1, adds a driving signal v 1 ( t ) to its own u 1 ( t ) as a control input for the team [42].”
BackgroundXiong, C., Ma, Q., & Zhou, G. (2024) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7177 · Cited by 5
“If node j and node i can exchange information, there is a channel between i and j , i.e., ( j , i ) According to the properties of the incidence matrix D of the unweighted and undirected graph in, 26 we can obtain L = DD T .”
BackgroundRevisiting disturbance decoupling with an optimization perspective
Sarsılmaz, S. B., Li, S. H. Q., & Acikmese, B. A. (2024) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2023.100928 · Cited by 6
Finite-Time Topology Identification for Complex Dynamical Networks
Wang, N., & Dimarogonas, D. V. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383624 · Cited by 5
“Complex dynamical networks represent many systems, ranging across social networks, distributed robots, sensor networks and biological systems [1], [2], thus attracting increasing attention.”
BackgroundDecentralized Federated Learning using Gaussian Processes
Kontoudis, G. P., & Stilwell, D. J. (2023) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs60187.2023.10416790 · Cited by 8
Network partition detection and recovery with the integration of unmanned aerial vehicle
Zear, A., Ranga, V., & Gola, K. K. (2024) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.8048 · Cited by 5
Event-triggered design for optimal output consensus of high-order multi-agent systems
Tang, Y., Li, R., Liu, H., & Zhu, K. (2024) · International Journal of Control · doi:10.1080/00207179.2024.2395322 · Cited by 8
“More graph notations can be found in [25].”
BackgroundConservative Versus Non-conservative Diffusion Toward a Target in a Networked Environment
Estrada, E. (2024) · Springer eBooks · doi:10.1007/978-3-031-67802-8_21 · Cited by 5
Palani, T., Fukushima, H., & Izuhara, S. (2025) · Advanced Robotics · doi:10.1080/01691864.2025.2478920 · Cited by 6
Negotiation Framework for Safe Multi-Agent Planning via Spatiotemporal Tubes
Faruqui, M. F., Das, R., Ravi Kumar, L., & Jagtap, P. (2025) · European Control Conference (ECC) · doi:10.23919/ecc65951.2025.11187220 · Cited by 5
“Consider an undirected graph G = ( I , E ) , such that E ⊆ I × I is the set of edges that represents bidirectional communication between agents represented by vertices, where I = { 1 , 2 , 3 , ..., N } is the set of N agents [14].”
Consensus of heterogeneous multi-agent systems using output feedback
Danaeefard, N., & Majd, V. J. (2015) · doi:10.1109/rios.2015.7270734 · Cited by 5
“[9][10]”
BackgroundOn the termination time of the one-sided asymmetric Hegselmann-Krause dynamics
Coulson, J., Steeves, D., Gharesifard, B., & Touri, B. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171963 · Cited by 6
“In recent years, the increasing applications of multi-agent systems have generated great interest in creating mathematical models that prescribe the behaviours of these systems, see [1], [2] and references therein.”
BackgroundOn the fiedler vector of graphs and its application in consensus networks
Shao, H., & Mesbahi, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170983 · Cited by 5
“, x1(t) = x2(t) = · · · = xn(t) when t → ∞, if the network is connected [6], [10].”
BackgroundSelf-citationToward haptic-based management of small swarms in cordon and patrol
Alder, C. K., McDonald, S. J., Colton, M. B., & Goodrich, M. A. (2015) · Swarm/Human Blended Intelligence Workshop (SHBI) · doi:10.1109/shbi.2015.7321675 · Cited by 5
“This is precisely the Laplacian consensus algorithm described in [22], [23], where state is the average distance between an agent and its neighbors.”
BackgroundMethodChen, Y., Qu, X., Guo, Y., & Aleksandrov, A. Y. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896858 · Cited by 6
“We refer readers to the monographs [1], [2], [3] and the overview papers [4], [5] on the recent research progress of state consensus problems.”
BackgroundAlgebraic characterization of observability in distance-regular consensus networks
Kibangou, A. Y., & Commault, C. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760064 · Cited by 5
“Then, resorting to the notion of equitable partitions of a graph necessary conditions have been stated in [10] for observability over arbitrary graphs and in [7], [8], [11], [12] for controllability.”
BackgroundConsensus of spatially distributed filters using mobile sensor networks with limited connectivity
Demetriou, M. A. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6579883 · Cited by 5
“On a somewhat related aspect of the filter design of spatially distributed processes, the concept of consensus has been studied in a multitude of research works [7].”
BackgroundComplete Heterogeneous Self-Reconfiguration: Deadlock Avoidance Using Hole-Free Assemblies
Pickem, D., Egerstedt, M., & Shamma, J. S. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130925-2-de-4044.00059 · Cited by 5
“The number of zero eigenvalues indicates the number of connected components (according to Mesbahi and Egerstedt (2010)).”
BackgroundSelf-citationOptimal control for linear and nonlinear semistabilization
L׳Afflitto, A., Haddad, W. M., & Hui, Q. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859343 · Cited by 5
“Specifically, the consensus problem involves the design of a dynamic protocol algorithm that guarantees semistability and system state equipartition [21], that is, limt-1 xiðtÞ 1⁄4 αAR for i1⁄4 1;.”
BackgroundAdaptive communication-constrained deployment of mobile robotic networks
Ny, J. L., Ribeiro, A., & Pappas, G. J. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314804 · Cited by 5
“In particular, the disc model enables the use of graph theoretical methods to account for connectivity constraints [2], [3].”
MethodHaddad, W. M., Nersesov, S. G., Hui, Q., et al. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760200 · Cited by 5
“Recent technological advances in communications and computation have spurred a broad interest in control of networks and control over networks [3] .”
BackgroundMulti-Agent Coordination with arbitrarily shaped Descriptor Functions
Braga, A. F., Pollini, L., & Innocenti, M. (2013) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2013-4996 · Cited by 5
Cooperative control of uncertain multivehicle systems
Yucelen, T., & Johnson, E. N. (2012) · doi:10.1109/cdc.2012.6426154 · Cited by 5
“PRELIMINARIES In this section, we overview the basic results from multivehicle systems (see [12] for details).”
BackgroundLQR performance for multi-agent systems: Benefits of introducing delayed inter-agent measurements
Seuret, A., Menon, P. P., & Edwards, C. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760698 · Cited by 5
A decentralized observer for a general class of Lipschitz systems
Arrichiello, F., Marino, A., & Meddahi, A. (2013) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2013.6720324 · Cited by 5
“…manage global properties of the system; a representative example is the consensus problem, i.e. the problem of making the agents reaching an agreement regarding a certain variable dependent on the state of all the others, where each agent can only communicate with its direct neighbors [19], [20].”
BackgroundFree probability induced by electric resistance networks on energy Hilbert spaces
Cho, I., & Jørgensen, P. E. T. (2011) · Opuscula Mathematica · doi:10.7494/opmath.2011.31.4.549 · Cited by 5
“There is a variety of such problems in the literature, but studied with different methods, for example [12, 25] on geometry and telecommunications networks, [13] studying Jacobi matrices on trees, [14, 15] on random directed networks, [16, 24] on fractal networks and Sierpinski gaskets, [26] in potential theory, [17]…”
Advection on networks with an application to decentralized load balancing
Chapman, A., Schoof, E., & Mesbahi, M. (2012) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2012.6386284 · Cited by 5
“Advection has been used to model the spread of diseases [1], population migration [2], and supply and demand in economic systems [3], and recently applied to formation control and a sensor coverage problem by the authors in [4].”
MethodSelf-citationOn the synchronization of spatially coupled oscillators
Cenedese, A., & Favaretto, C. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402974 · Cited by 5
“, N}, consisting of the indices of the N agents of the network, and of a set of edges E ⊆ V×V , in which each edge connects one node to another (see for example, [13]).”
BackgroundResilient consensus of double-integrator multi-agent networks with communication delays
Dibaji, S. M., & Ishii, H. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402888 · Cited by 5
“We recall some concepts on graphs [13].”
Jain, A., Ghose, D., & Menon, P. P. (2016) · Indian Control Conference · doi:10.1109/indiancc.2016.7441126 · Cited by 5
Halftone Mass Games by Fixed Number of Mobile Robots
Azuma, S., Izumi, S., & Sugie, T. (2012) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.25.94 · Cited by 5
Somarakis, C., & Baras, J. S. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973273.18 · Cited by 5
“…Phsysics, Mathematics) concerning types of coordination among autonomous agents who exchange information in a distributed way in many frameworks (e.g. deterministic or stochastic) and under various communication conditions (for example [8, 7, 4, 6, 12, 10, 11, 9] and references therein).”
BackgroundDistributed estimation and learning over heterogeneous networks
Rahimian, M. A., & Jadbabaie, A. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852386 · Cited by 5
“This gives rise to the distributed sensing problems that include distributed network consensus or agreement [19], [20], [1], and distributed averaging [21]; with close relations to the consensus and coordination problems that are studied in the distributed control theory [22], [23], [24].”
BackgroundConsensus speed optimisation with finite leadership perturbation in k-nearest neighbour networks
Clark, R., Punzo, G., & Macdonald, M. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798378 · Cited by 5
“Lemma 1 [14], [15] For a directed network G with”
BackgroundDistributed Event Triggered Control, Estimation, and Optimization for Cyber-Physical Systems
Meng, X. (2014) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3h12vg5n · Cited by 5
Entropy Evolution in Consensus Networks
Fu, S., Shi, G., Petersen, I. R., & James, M. R. (2017) · Scientific Reports · doi:10.1038/s41598-017-01615-5 · Cited by 5
“Inspired by this, consensus control over networks has been systematically studied in the past decade 6, 7 , becoming one of the foundational blocks for engineering solutions to distributed coordination problems in multi-agent systems 8 .”
BackgroundExpected Convergence Rate to Consensus in Asymmetric Networks: Analysis and Distributed Estimation
Asadi, M. M., Khosravi, M., Aghdam, A. G., et al. (2017) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2017.2693026 · Cited by 5
“Let the weighted digraph G be strongly connected, which implies that the zero eigenvalue of L has algebraic multiplicity one [33].”
BackgroundSafe Metropolis–Hastings algorithm and its application to swarm control
Chamie, M. E., & Acikmese, B. A. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.10.006 · Cited by 5
“cent research has focused on synthesizing fast mixing Markov chains with desired stationary distributions that incorporate constraints on transition probabilities [9, 10] by using tools from graph theory [11], Lyapunov stability analysis [12], and convex optimization [13].”
MethodConsensus on a sphere for a 3-dimensional speeding up and slowing down strategy
Al‐Abri, S., & Zhang, F. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263865 · Cited by 4
“It has been heavily studied in the last decade and various types of consensus problems can be found in the literature [4],[5],[6].”
BackgroundStability of Leaderless Resource Consumption Networks
Ruf, S. F., Hale, M., Manzoor, T., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619010 · Cited by 5
“The influence of the agents on each others’ consumption is similar to how agents influence each other in mathematical models of opinion formation [13] and consensus in cooperative multiagent systems [14].”
BackgroundHybrid Framework for Consensus in Directed and Asynchronous Network of Non-Holonomic Agents
Borzone, T., Morărescu, I., Jungers, M., et al. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2847407 · Cited by 5
“The most studied problem within this framework is related to consensus which mathematically formulates the fact that multiple systems with local sensing and actions have to collaborate in order to reach a common goal [1].”
BackgroundKrishna, A., Schiffer, J., & Raisch, J. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550191 · Cited by 5
“A weighted undirected graph [23], [24] of order n > 1 is a triple G = (N , E ,W) with set of vertices N = {1, .”
BackgroundDistributed proximal augmented Lagrangian method for nonsmooth composite optimization
Hassan-Moghaddam, S., & Jovanović, M. R. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431301 · Cited by 5
“(3) In the absence of exogenous disturbances, the network converges to the average of the initial node values ψ̄ = (1/n) ∑ i ψi(0) if and only if it is connected [16].”
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.