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 1,701–1,800 of 2,960
Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal GraphsPreprint
Khosoussi, K., Sukhatme, G. S., Huang, S., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.01116 · Cited by 4
“P For every simple weighted graph G = ( V, E, w ) with w : Theorem 2.2 (Weighted Matrix-Tree Theorem [20]) .”
MethodInfluentialThe transfer-function approach to travelling waves in path graphs.Preprint
Martinec, D., Herman, I., & Šebek, M. (2014) · arXiv (Cornell University) · Cited by 4
Herdability of Linear Systems Based on Sign Patterns and Graph StructuresPreprint
Ruf, S. F., Egerstedt, M., & Shamma, J. S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.08778 · Cited by 6
“al in the 1960s [1] and recently has seen a renewed interest in the study of networked systems [2] and complex networks [3].”
BackgroundSelf-citationOn the Robustness of Uncertain Consensus NetworksPreprint
Zelazo, D., & Bürger, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.4471 · Cited by 4
“In this paper, we consider the linear weighted consensus protocol [1] in the presence of exogenous finite-energy disturbances.”
BackgroundMethodOptimal mass transport and kernel density estimation for state-dependent networked dynamic systemsPreprint
de Badyn, M. H., Eren, U., Acikmese, B. A., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.07496 · Cited by 4
“A class of the more widely used local control laws is called consensus , where each agent averages data from their neighbours to compute a parameter related to their objective – for example, heading, position or a formation center [1], [5], [6].”
BackgroundMethodInfluentialSelf-citationAbstractions of varying decentralization degree for coupled multi-agent systems
Boskos, D., & Dimarogonas, D. V. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798250 · Cited by 4
“The dynamics (1) are encountered in a popular set of multi-agent protocols [17], including consensus, connectivity maintenance, collision avoidance and formation control.”
Yi, X., Zhang, S., Yang, T., Johansson, K. H., & Chai, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.03282 · Cited by 3
“In this section, we present some definitions from algebraic graph theory [45], the restricted secant inequality [46], and monotonicity properties of vector functions [47].”
BackgroundValentini, G. (2019) · arXiv (Cornell University) · doi:10.11499/sicejl.59.90 · Cited by 6
“The community of control theory has also intensively studied the problem of continuous consensus achievement [Mesbahi and Egerstedt, 2010] for formation control [Ren et al.”
BackgroundConsensus on Matrix-weighted Time-varying NetworksPreprint
Pan, L., Shao, H., Mesbahi, M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.11179 · Cited by 4
“INTRODUCTION Reaching consensus is an important construct in distributed coordination of multi-agent systems [1], [2], [3], [4].”
BackgroundSelf-citationHow to Secure Distributed Filters Under Sensor AttacksPreprint
He, X., Ren, X., Sandberg, H., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.05409 · Cited by 4
“[38] The undirected graph G is connected if and only if λ2(L) > 0.”
BackgroundLong, S., & Gong, X. (2024) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac63405.2024.10598450 · Cited by 3
“…of the graph G , denoted by λ c ( G ) (e.g., the second smallest eigenvalues of L ), implies that λ c is connected if and only if Theorem 1 from [18] asserts that in a graph where every node possesses a self-loop and features a doubly stochastic weighted adjacency matrix A , any graph,…”
BackgroundMethodOpinion dynamics based on social learning theory
Dong, J., Dai, Q., Li, H., & Yang, J. (2024) · The European Physical Journal B · doi:10.1140/epjb/s10051-024-00838-6 · Cited by 5
“…problems in other fields or some engineering challenges, such as synchronization in coupled oscillators [13,14] and distributed formation control [15], can be conceptualized as consensus problem in a broader sense [16]. a e-mail: qldai@bupt.edu.cn (corresponding author) b e-mail:…”
Anum, H., Hashmi, M. A., Shahid, M. U., et al. (2025) · IET Renewable Power Generation · doi:10.1049/rpg2.70052 · Cited by 3
On the Minimum Quantity of Mobile Sensor Nodes for Full Coverage in Hybrid WSN
Sousa, M. S., & Neto, J. V. D. F. (2025) · Sensors · doi:10.3390/s25103210 · Cited by 3
“…its modeling are performed by using the G ( V , E ) graph, where V represents the nodes that are the vertices of the graph, E represents the edges [26]; that is, the angular distance between sensor i and its adjacent neighbors ( i As the sensor node i = 1 is a static type that is in the center of…”
An improved privacy-preserved consensus algorithm under an event-triggered prescribed-time mechanism
Chu, H., Gan, L., Dou, C., & Liang, H. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107836 · Cited by 4
Distributed self-triggered secondary control for islanded microgrids
Jiang, X., Zhou, T., & Wang, F. (2025) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2025.111193 · Cited by 3
Dichotomic differential inequalities and multi-agent coordination
Proskurnikov, A. V., & Cao, M. (2016) · European Control Conference (ECC) · doi:10.1109/ecc.2016.7810291 · Cited by 2
“This protocol and its discrete-time counterpart has been thoroughly studied by using Lyapunov methods [5]–[7] and matrix analysis [1], [2], [8], paying special attention to the effects of timevarying interaction topologies.”
BackgroundMethodIshizaki, T., Ku, R., & Imura, J. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799152 · Cited by 3
“Our result is deduced purely from the symmetry of graph motives; The analysis based on the simultaneous diagonalizability makes no distinction among directed and undirected graphs, adjacency and graph Laplacian matrices, and others [8].”
Projection-Based Dynamics for Distributed Optimization Subject to General Constraints
Xu, W., & Yang, S. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8483053 · Cited by 3
“For more details, see [21].”
Esmaeilpour, M., Aghdam, A. G., & Blouin, S. (2018) · IEEE Access · doi:10.1109/access.2018.2880677 · Cited by 3
“The Laplacian of the weighted digraphG(k) is a real asymmetric matrix L(k) ∈ Rn×n whose (i, j) element is given by [10], [31]”
BackgroundTran, D. M., Yucelen, T., & Jagannathan, S. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-2262 · Cited by 3
Distributed H2 Controller Synthesis for Multi-Agent Systems with Stochastic Packet Loss
Hespe, C., Datar, A., Schneider, D. M., et al. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156194 · Cited by 3
“Of the aforementioned papers, only [4], [7], [8] and [11] study the controller synthesis problem for general agent models.”
BackgroundMathew, S., Jacob, J., & Mija, S. J. (2023) · IEEE Region 10 Symposium (TENSYMP) · doi:10.1109/tensymp55890.2023.10223649 · Cited by 3
“where, pcij and pdij are the current and desired distance between i and j agents [24].”
BackgroundDistributed Planning of Collaborative Locomotion: A Physics-Based and Data-Driven Approach
Fawcett, R. T., Ames, A. D., & Hamed, K. A. (2023) · IEEE Access · doi:10.1109/access.2023.3332820 · Cited by 3
“It is therefore desirable to consider a reduced-order model, though this is often not sufficient and further necessitates the use of distributed control techniques [3], [4], [5], [18], [19].”
BackgroundGuralnik, D. P., Stiller, P. F., Zegers, F. M., et al. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3346796 · Cited by 3
“The identity (6) ensures that the total potential and weights satisfy the identity [29, Sec.”
BackgroundDecentralized State-Dependent Markov Chain Synthesis With an Application to Swarm Guidance
Uzun, S., Üre, N. K., & Acikmese, B. A. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3353673 · Cited by 6
“Consensus protocols, in contrast to Markov chains, operate without the limitations of nonnegative valued nodes and edge weights or the requirement for the sum of the values of the nodes is equal to one [18].”
BackgroundExploring Oriented Threshold Graphs: A Study on Controllability/Observability
Mousavi, S. S. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3424873 · Cited by 3
“Notably, in-degree and out-degree Laplacian matrices, introduced to describe consensus and advection dynamics respectively, differ for directed networks [2], [3].”
BackgroundConsensus Control with Safety Guarantee: An Application to the Kinematic Bicycle Model
Niu, K., Abdallah, C. T., & Hayajneh, M. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644196 · Cited by 3
“Consensus control has been extensively investigated in the setting of multi-agent systems, where typically it is under-scored by a distributed algorithm that guarantees convergence of the state or output variables of various agents to a common target value [1].”
BackgroundA Low-Cost Experimental Testbed for Decentralized Control of Multi-UAV Systems
Sahebsara, F., Snellgrove, M., & de Queiroz, M. S. (2024) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta60707.2024.10666654 · Cited by 3
“During the past several years, considerable work has been conducted in this area under various names: multi-agent systems, networked systems, cooperative control, swarming, and collaborative robotics [1]–[3].”
BackgroundControl of Multiagent Networks With Misbehaving Nodes Over Directed Graph Topologies
Yildirim, E., & Yucelen, T. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3526569 · Cited by 4
Mathematical modeling of Chinese medicine by complex-valued five-agent network
Yang, C.-D. (2025) · Discover Applied Sciences · doi:10.1007/s42452-025-06602-4 · Cited by 3
“…to yield the complex-valued five-agent network, which provides a mathematical model for TCM via the equivalence between the Yin-Yang complementarity and the real-imaginary complementarity network represents a multi-agent network [10, 11], whose number of agents is five, as shown in Fig.”
Leaderless Nonlinear Formation Control of Nonholonomic Robots Without Velocity Measurements
Díaz, Y., & Davila, J. A. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886761 · Cited by 3
“The neighborhood of vertex i is the set The adjacency matrix A associated to the graph G is the n × n symmetric matrix whose elements are defined as there is a path from a to b , [14].”
Decentralized Density Control of Multi-Robot Systems Using PDE-Constrained Optimization
Niu, L. X., & Notomista, G. (2025) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2025.3548501 · Cited by 8
“A decentralized approach is then developed, utilizing a communication graph based on each robot’s detection radius— Δ -disk graph [11]—making each robot interact with physically close robots only.”
Resilience for Distributed Consensus With Constraints
Wang, X., Mou, S., & Sundaram, S. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3565681 · Cited by 6
“Recently, the consensus approach has powered many applications, including motion synchronization [13], multirobot path planning/formation control [14], [15], flocking of mobile robots [16], and cooperative sensing [17], [18], across the overall network.”
Quality of Control Based Resource Dimensioning for Collaborative Edge Robotics
Roy, N., Dhullipalla, M. H., Sharma, G. P., et al. (2025) · doi:10.1109/ccnc54725.2025.10976180 · Cited by 3
“From a communication standpoint, the level of control most crucial for collaborative robotics is motion level, since the robots exchange their position (or, more generally, state) information to achieve a joint objective such as rendezvous, formation control, optimal coordination [4], [10].”
BackgroundMethodInfluentialThe relative tempo of discrete-time consensus networks
Shao, H., Mesbahi, M., & Xi, Y. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260806 · Cited by 3
“For the fundamental principles and applications of consensus model, we refer to [16, 22] and the citations therein.”
BackgroundSelf-citationStabilization by controller networks
Izumi, S., Azuma, S., & Sugie, T. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580182 · Cited by 3
Distributed optimization by myopic strategic interactions and the price of heterogeneity
Gharesifard, B., Touri, B., Başar, T., & Langbort, C. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760041 · Cited by 2
“I. INTRODUCTION In the past decade, distribution and decentralization of tasks have allowed for achieving global objectives, costly to achieve in a centralized manner, using groups of individuals; see [2], [3] and references therein.”
BackgroundSomarakis, C., & Baras, J. S. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6761131 · Cited by 3
“The rate of convergence is exponential with rate equal to the second smallest eigenvalue of L, which in the case of G being simply connected is positive (see [5]).”
BackgroundMethodZhu, G., & Hu, J. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6579967 · Cited by 3
“This structure resembles that of the well-known graph Laplacian [14].”
ResultHu, B., & Lemmon, M. D. (2014) · doi:10.1145/2566468.2566473 · Cited by 3
“In the past decade, formation control has found extensive applications in industry and academia [2, 11, 8, 10, 5].”
BackgroundObservability and reachability of simple grid and torus graphs
Parlangeli, G., & Notarstefano, G. (2011) · IFAC Proceedings Volumes · doi:10.3182/20110828-6-it-1002.03618 · Cited by 3
Panagou, D. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402637 · Cited by 3
“Research efforts have achieved the formalization of problems such as consensus and formation control in multi-agent networks using tools and notions from graph theory, matrix theory and Lyapunov stability theory [12]–[15].”
BackgroundMaintaining Connectivity for Networked Mobile Systems in the Presence of Agent Loss
Aksaray, D., & Mavris, D. N. (2013) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2013-4886 · Cited by 3
Predictive modeling and retaining connectivity for mobile wireless communication network
Shtessel, Y. B., Edwards, C., Menon, P. P., et al. (2012) · IEEE Conference on Technologies for Homeland Security (HST) · doi:10.1109/ths.2012.6459911 · Cited by 3
State synchronization of linear and nonlinear agents in time‐varying networks
Zhang, M., Saberi, A., & Stoorvogel, A. A. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3764 · Cited by 3
Zhai, S., Xiao, M., & Li, Q. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.03.012 · Cited by 3
Coordination of Multi-agent Systems with Intermittent Access to a Cloud Repository
Adaldo, A., Liuzza, D., Dimarogonas, D. V., et al. (2017) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-55372-6_21 · Cited by 3
Hierarchical Distributed Motion Control for Multiple Linear Switched Reluctance Machines
Zhang, B., Yuan, J., Luo, J., Wu, X., Qiu, L., & Pan, J. (2017) · Energies · doi:10.3390/en10091426 · Cited by 3
Event-triggered active-passive dynamic consensus filters
Peterson, J., Yucelen, T., Jagannathan, S., et al. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963552 · Cited by 3
“We now introduce some basic notions from graph theory and refer the reader to [14], [15] for further details.”
BackgroundDynamic domain reduction for multi-agent planning
Ma, A., Ouimet, M., & Cortés, J. (2017) · International Symposium on Multi-Robot and Multi-Agent Systems (MRS) · doi:10.1109/mrs.2017.8250943 · Cited by 3
Dogan, K. M., Gruenwald, B. C., Yucelen, T., Muse, J. A., & Butcher, E. A. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431705 · Cited by 3
“Lemma 1 [15].”
Optimal Output Consensus for a Class of Uncertain Nonlinear Multi-agent Systems
Tang, Y., & Wang, X. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431501 · Cited by 3
“For this purpose, an undirected graph G = (V , E , A ) [28] is employed to describe the information sharing relationships among those nodes represented by N = {1, .”
MethodZhang, M., Saberi, A., Stoorvogel, A. A., et al. (2018) · European Journal of Control · doi:10.1016/j.ejcon.2018.08.002 · Cited by 3
Robust Output Consensus for Networks of Homogeneous Negative Imaginary Systems
Skeik, O., & Lanzon, A. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619029 · Cited by 3
“This includes complete and star graphs (see e.g. [20]).”
BackgroundDistributed Robust Resource Allocation with Convex-Concave Uncertain Objective Functions
Li, M., & Liu, T. (2018) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2018.8492684 · Cited by 3
“For more details consult [18].”
Somarakis, C., & Motee, N. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.2968474 · Cited by 3
“This is the standard control law to achieve asymptotic agreement over a network of agents that has several applications in cooperative planning, formation control, distributed computation, and optimization [18].”
Modelling of Track Layout for Intelligent Railway Signalling System: A Machine Learning Application
Baviskar, Y., Suryawanshi, U., & Sheikh, A. (2018) · IEEE Annual Southern Power Electronics Conference · doi:10.1109/spec.2018.8635878 · Cited by 4
“Theorem: The graph G is connected ⇐⇒ λ2(G) > 0 [9] Proof: Since the null spaces of D(G) and L(G) are the same, it suffices to show that the null space of D(G) has dimension”
BackgroundRisk and security tradeoffs in graphical coordination games
Paarporn, K., Alizadeh, M., & Marden, J. R. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9028894 · Cited by 3
Towards Topological Analysis of Networked Holonic Multi-agent Systems
Esmaeili, A., Mozayani, N., Jahed‐Motlagh, M. R., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-24209-1_4 · Cited by 3
Distributed Event-Based Control for Second-Order Multi-Agent Systems
Sewlia, M., & Zelazo, D. (2019) · Mediterranean Conference on Control and Automation (MED) · doi:10.1109/med.2019.8798577 · Cited by 3
Accelerated Distributed Primal-Dual Dynamics Using Adaptive Synchronization
Bansode, P., Kosaraju, K. C., Wagh, S. R., Pasumarthy, R., & Singh, N. M. (2019) · IEEE Access · doi:10.1109/access.2019.2937448 · Cited by 2
A Generalized Time Transformation Method for Finite-Time Control
Tran, D. M., & Yucelen, T. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815010 · Cited by 3
“Moreover, we now recall several graph-theoretical notions (see [28] and [29] for details).”
BackgroundConsensus of Heterogeneous Systems with constraints in a Switching Network - A Governor Approach
Ong, C. J., & Djamari, D. W. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029412 · Cited by 3
“The study on consensus of multi-agent systems connected via a communication networks has been an active area of research in the last decade and a rich literature is available, see for example [12] and references therein.”
BackgroundWan, W., Kim, H., Cheng, Y., et al. (2021) · AIAA AVIATION Forum · doi:10.2514/6.2021-2463 · Cited by 3
Coordination control strategies for multivehicle systems
Hamdan, M. M., Mahmoud, M. S., & Xia, Y. (2020) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2020.09.007 · Cited by 3
Distributed Quantized Consensus With Recursive Channel Filters Over Directed Networks
Rong, L., Su, P., Gao, H., & Xu, S. (2021) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2021.3099875 · Cited by 4
“It is satisfied that L = DE T [22].”
BackgroundReduced-order modeling of large-scale network systems
Cheng, X., Scherpen, J., & Trentelman, H. (2020) · Cambridge University Engineering Department Publications Database · Cited by 3
Bearing‐based autonomous communication relay positioning under field‐of‐view constraints
Fabris, M., & Zelazo, D. (2022) · Advanced Control for Applications · doi:10.1002/adc2.103 · Cited by 3
“From a control systems perspective, the challenge in formation control is to find distributed strategies, e.g. 19,20 for the control and estimation of multi-agent systems (MASs) 21,22 that achieve a desired formation with guarantees on certain properties such as stability and performance.”
An energy-efficient and self-triggered control method for robot swarm networking systems
Byun, H., & Yang, S. (2022) · Measurement and Control · doi:10.1177/00202940221095534 · Cited by 4
Human Dense Avoidance Based on A Coverage Control through Robots
Morita, S., Okura, Y., & Kojima, C. (2022) · IEEJ Transactions on Electronics Information and Systems · doi:10.1541/ieejeiss.142.1031 · Cited by 3
A distributed algorithm for aggregative games of disturbed Euler-Lagrange systems
Ma, T., Deng, Z., Hu, C., et al. (2022) · Measurement and Control · doi:10.1177/00202940221139633 · Cited by 3
“We briefly introduce some concepts on graph theory (referring to Mesbahi and Egerstedt 32 ).”
BackgroundEvent-Triggered ℓ2-Optimal Formation Control with State-Estimation for Agents Modeled as LPV Systems
Gebhardt, G., Saadabadi, H., & Werner, H. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992894 · Cited by 3
Frequency domain cascade consensus and disturbance rejection control of multi-agent systems
Ahmed, Z. (2023) · Transactions of the Institute of Measurement and Control · doi:10.1177/01423312231156234 · Cited by 3
“A directed tree known as a spanning tree which describes a subset of edges in G (Mesbahi and Egerstedt, 2010).”
BackgroundThe Effect of Mathematics Anxiety on Cognitive Failures Among High School Students
Mosahab, A. (2023) · European Journal of Education and Pedagogy · doi:10.24018/ejedu.2023.4.2.632 · Cited by 3
A Distributed Algorithm for the Assignment of the Laplacian Spectrum for Path Graphs
Parlangeli, G. (2023) · Mathematics · doi:10.3390/math11102359 · Cited by 3
Accelerated Gradient Flow for Directed Graphs With Event-Based Broadcasting
Dhullipalla, M. H., Yu, H., & Chen, T. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3290112 · Cited by 3
“Next, we introduce some concepts from algebraic graph theory [28].”
MethodBarkai, G., Mirkin, L., & Zelazo, D. (2023) · Automatica · doi:10.1016/j.automatica.2023.111158 · Cited by 3
“…consensus protocol (Olfati-Saber et al., 2007), which is a diffusive state-feedback of the form If certain connectivity conditions on the communication topology hold (i.e. connectedness), then the control law (2) drives the agents to agreement exponentially fast (Mesbahi and Egerstedt, 2010, Ch. 3).”
InfluentialA Norm-Free Adaptive Event-Triggering Law for Distributed Control of Nonholonomic Mobile Robots⋆
Kurtoglu, D., Yucelen, T., Tran, D. M., Casbeer, D. W., & García, E. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156262 · Cited by 3
“We next state the graph-theoretical notation (details in [2]).”
BackgroundDistributed State Estimation for Linear Time-Varying Systems with Sensor Network Delays
Chandrasekaran, S., Varadan, V., Krishnan, S. V., et al. (2023) · European Control Conference (ECC) · doi:10.23919/ecc57647.2023.10178246 · Cited by 3
Sequential formation control in multiagent systems
Witke, K. A., & Yucelen, T. (2023) · International Journal of Systems Science · doi:10.1080/00207721.2023.2241958 · Cited by 3
Consensus-Based Leader-Follower Formation Tracking for Control-Affine Nonlinear Multiagent Systems
Enwerem, C. O., & Baras, J. S. (2023) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit58514.2023.10284199 · Cited by 3
“Theorem 1 (Mesbahi and Egerstedt [10]): For a connected goal formation, encoded by the graph, G f = ( V , E f ) , and a goal location set X f = { ξ 1 , ξ 2 , . . . , ξ N } , where ξ i is the goal location of the i th agent, the following formation control scheme will drive the MAS so that the…”
BackgroundMonsingh, J. M., Sinha, A., & Chung, H. (2023) · European Journal of Control · doi:10.1016/j.ejcon.2023.100928 · Cited by 3
Sarsılmaz, S. B., Koru, A. T., Yucelen, T., & Acikmese, B. A. (2023) · Advances in industrial control · doi:10.1007/978-3-031-39767-7_11 · Cited by 4
Identifiability of diffusively coupled linear networks with partial instrumentation*
Kivits, E. M. M., & den Hof, P. M. J. V. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.1213 · Cited by 3
A new virtual consensus‐based wide area differential protection
Koloushani, S. M., & Taher, S. A. (2024) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.13168 · Cited by 4
Zegers, F. M., Guralnik, D. P., & Dixon, W. E. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3405338 · Cited by 3
“Centralized and distributed variants of the connectivity maintenance problem under continuous interagent communication have been extensively studied [7], [8], [9], [10], [11], [12], as well as in discrete time [13], where connectivity maintenance can be addressed inductively.”
Stoorvogel, A. A., Saberi, A., & Liu, Z. (2024) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7527 · Cited by 3
“…systems (MAS) has attracted substantial attention due to the wide potential for applications in several areas, such as autonomous vehicles, satellites/robots system, distributed sensor network, and smart gird (power grid), see for instance the books [1,2,4,9,12,13,18] and references [5,10,11].”
BackgroundControl-Based Graph Embeddings with Data Augmentation for Contrastive Learning
Ahmad, O. U., Said, A., Shabbir, M., et al. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644876 · Cited by 3
Sensor Placement for Flapping Wing Model Using Stochastic Observability Gramians
Boyacıoğlu, B., Babaei, M., Mamo, A. H., et al. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644510 · Cited by 3
“The use of pure condition number ( w ν = 0 ) resulted in having no sensors in the regions where the output energy is highest.”
BackgroundCommand Governor Mechanism for Uncertain Multi-agent Systems with Actuator Dynamics
Kurttisi, A., Dogan, K. M., Sarioglu, N. E., et al. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644663 · Cited by 3
“In the literature, many algorithms exist to provide collaborative behavior with multiple robots [1]–[4].”
BackgroundSynchronization of networked mechanical systems without velocity information
Jiang, S., Zhang, Y., Du, Y., & Zhang, Z. (2024) · Asian Journal of Control · doi:10.1002/asjc.3529 · Cited by 3
Alvarez, E., & Dong, W. (2025) · International Journal of Systems Science · doi:10.1080/00207721.2024.2448771 · Cited by 3
“It is shown that the columns of D c are linearly depend on the columns of D t (Chowdhury et al., 2018; Mesbahi & Egerstedt, 2010) and The incidence matrix D can also be written as the following block matrix where − m ) .”
Xue, X., Yuan, B., Yi, Y., Mu, L., & Zhang, Y. M. (2025) · Drones · doi:10.3390/drones9020136 · Cited by 3
Zhou, T. (2025) · Asian Journal of Control · doi:10.1002/asjc.3810 · Cited by 3
Model reduction of consensus networks by graph simplification
Jongsma, H.-J., Trentelman, H. L., & Camlibel, M. K. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403055 · Cited by 4
“These edges represent the communication channels between unordered pairs of nodes, see [12], [13].”
BackgroundStability analysis of mobile robot formations based on synchronization of coupled oscillators
Nakamura, T., Miyuki, T., Hara, N., et al. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.10.394 · Cited by 3
Potential Field Based Optimization of a Prey-Predator Multi-Agent System
Baillard, V., Goy, A., Vasselin, N., et al. (2018) · doi:10.11128/arep.55.a55287 · Cited by 3
“For formation control, graph theory (Mesbahi and Egerstedt (2010)) is a natural paradigm for systems with imperfect information coupled to agents’ dynamics, while set-theoretic methods (Blanchini and Miani (2007)) are suitable for addressing uncertainty and implementing constrained control for MAS…”
MethodSecure Diagnosability of Hybrid Dynamical Systems
Fiore, G., Santis, E. D., & Benedetto, M. D. D. (2018) · Springer eBooks · doi:10.1007/978-3-319-74962-4_7 · Cited by 3
Wang, J., Butcher, E. A., & Yucelen, T. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-1163 · Cited by 3
Metadata
- Authors
- Mesbahi, M., & Egerstedt, M.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 2010-12-31
- OpenAlex
- W613360614
- Cited by
- 2,897
- References
- 0
- Citations by year
- 2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
- FWCI
- 74.30
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Princeton University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.