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,901–2,000 of 2,960
In-Flight Testing Verification of an Adaptive Distributed Fault-Tolerant Control Architecture
Budihartono, M., & Moncayo, H. (2024) · AIAA SciTech Forum · doi:10.2514/6.2024-0120 · Cited by 2
Fixed Set Search Applied to the Maximum Disjoint Dominating Sets Problem
Jovanović, R., & Voß, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-62922-8_26 · Cited by 2
Global Attitude Alignment for Multi-Agent Systems on SO(3) Without Angular Velocity Measurements
Boughellaba, M., & Tayebi, A. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644702 · Cited by 2
“An oriented graph is obtained from an undirected graph by assigning an arbitrary direction to each edge [15].”
BackgroundLodhi, Z. U. A., & Zhang, K. (2024) · Asian Journal of Control · doi:10.1002/asjc.3506 · Cited by 2
“For more details about the directed graphs, see [25, 34, 35].”
Babazadeh, R., & Šelmić, R. R. (2025) · Asian Journal of Control · doi:10.1002/asjc.3604 · Cited by 2
Spatio-Temporal Communication Compression in Distributed Prime-Dual Flows
Ren, Z., Wang, L., Yuan, D., et al. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886430 · Cited by 2
“In this process, each node stores localized information and communicates messages with connected nodes through the network, and collaboratively solves a mathematical problem [1].”
Formation control of double integrators over directed graphs using bearings and bearing rates
Rayabagi, S. T., Pal, D., & Mukherjee, D. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10885828 · Cited by 2
“Technological advancement in recent years has paved the way for synthesizing distributed engineering systems such as multi-vehicle systems, sensor networks [1], which have wide range of applications in automated highways, satellite formations, search and rescue operations [2].”
Accelerated Optimized Topology Design in Affine Formation Control Using ADMM
Wang, Y., Yang, Q., Xiao, F., et al. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3552979 · Cited by 2
Ahsini, Y., Reverte, B., & Conejero, J. A. (2025) · Applied Sciences · doi:10.3390/app15095064 · Cited by 4
“Indeed, one can show lim t →∞ ϕ ( t ) = c · 1 , where c is a constant equal to the average of the initial states ϕ i (0) [36, 33].”
Abbasi, Z., & Liu, X. (2025) · IET Control Theory and Applications · doi:10.1049/cth2.70052 · Cited by 2
Fixed-Time Bearing-Only Formation Control Without a Global Coordinate Frame
Huang, H., Lu, M., Zhang, B., et al. (2025) · Electronics · doi:10.3390/electronics14153021 · Cited by 2
Zhao, Y., Yu, X. J., Hoxha, B., et al. (2025) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3760258 · Cited by 2
Liu, T., Wu, S., Liu, Z., & Jiang, Z. (2025) · Unmanned Systems · doi:10.1142/s2301385025440108 · Cited by 2
A hierarchical structure for opinion convergence in multi-agent networks
D’Alfonso, L., & Fedele, G. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.108013 · Cited by 2
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
Khaledi, M., & Kiumarsi, B. (2025) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.4088 · Cited by 6
Graph Diffusion-Based Satellite Swarm Deployment for Curse-of-Dimensionality Mitigation
Takahashi, Y., & Sakai, S.-I. (2026) · AIAA SciTech Forum · doi:10.2514/6.2026-0116 · Cited by 2
Bestaoui, Y. (2014) · International series on intelligent systems, control and automation: science and engineering · doi:10.1007/978-3-319-03707-3_5 · Cited by 2
On the properties of the deformed consensus protocol
Morbidi, F. (2012) · doi:10.1109/cdc.2012.6426390 · Cited by 2
“The last decade has witnessed a spurt of interest in multiagent systems research, in both the control and robotics communities [1], [2].”
BackgroundCao, K., Mengjiao, L., & Wu, Y. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896812 · Cited by 2
“As shown in [13], the formation control problemwould be solved by reaching agreement over [xi2 − h̄ix, xi3 − h̄iy ] .”
BackgroundOn The Convergence Rate of Non-Linear Consensus Networks with Delays
Somarakis, C., & Baras, J. S. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130904-3-fr-2041.00146 · Cited by 2
“One can use fundamental results from Algebraic Graph Theory to fully analyse it’s stability (see for example Mesbahi and Egerstedt [2010]).”
BackgroundOptimal switching between two linear consensus protocols
Ron, O., & Margaliot, M. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760074 · Cited by 2
“There is an increasing interest in distributed con trol and coordination of networks consisting of multiple autonomous agents [1].”
BackgroundCoordinated decentralized estimation over random networks
Nabi-Abdolyousefi, M., & Mesbahi, M. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5991341 · Cited by 2
Self-citationSadikhov, T., Demetriou, M. A., Haddad, W. M., et al. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580006 · Cited by 2
“The consensus problem appears frequently in coordination of multiagent systems and involves finding a dynamic algorithm that enables a group of agents in a network to agree upon certain quantities of interest with undirected and directed information flow [9]–[11].”
BackgroundTravelling waves in a multi-agent system with general graph topology
Martinec, D., Herman, I., & Šebek, M. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.10.311 · Cited by 2
“The traditional approach for analysis of such a large-scale linear multi-agent system is by using the algebraic graph theory, see for instance works by Ren et al. (2007), OlfatiSaber et al. (2007) or Mesbahi and Egerstedt (2010) for an introduction to this problematic.”
MethodA Distributed Navigation Strategy for Mobile Sensor Networks With the Probabilistic Wireless Links
Madhag, A., & Choi, J. (2016) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4035008 · Cited by 2
Task-oriented decentralized adaptive control of cooperative manipulators
Marino, A., & Chiacchio, P. (2016) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio.2016.7866510 · Cited by 2
“Hence, rank(L) ≤ N − 1 where the equality holds when the graph is strongly connected [14].”
BackgroundAdaptive formation control for route-following ground vehicles
Droge, G. N., Xydes, A., Rahmani, A., et al. (2017) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2266874 · Cited by 2
“The desired trajectory defined in (1) is discretized in terms of the spatial index s into a vector of N equally spaced spatial indices”
BackgroundMethodInfluentialRendezvous Consensus Algorithm Applied to the Location of Possible Victims in Disaster Zones
León, J. A. F., Cardona, G. A., Jaimes, L. G., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-91262-2_61 · Cited by 2
“Thus, if a member agent i has communication with agent j, the entry (i, j) is one, and zero otherwise [9].”
BackgroundInfluentialAlbattat, A., Yucelen, T., & Jagannathan, S. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431039 · Cited by 2
“, see [2], [14], [15], [19]) to encode interactions between agents and to recall some of the basic results for (scalar) multiagent systems.”
BackgroundDistributed Energy Optimization using Consensus Theory Approach
Awais, M., Liu, N., Abbass, M. J., Shah, F. M., Rehman, A., & Al-Fakih, S. M. Q. (2018) · International Conference on Power Generation Systems and Renewable Energy Technologies (PGSRET) · doi:10.1109/pgsret.2018.8685975 · Cited by 2
“To achieve this condition without any central controller a discrete time consensus protocol [17] for ith vertex can be written as:”
BackgroundKoorehdavoudi, K., Roy, S., Xue, M., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814883 · Cited by 2
“specifically pinning controls; or as open-loop actuations, which can be analyzed using controllability concepts [4], [11].”
BackgroundLasso formulation of the shortest path problem
Dong, A., Taghvaei, A., & Georgiou, T. T. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303909 · Cited by 2
“, paths that begin and end at the same node, form a basis for the null space of the incidence matrix of the graph [14], [15].”
BackgroundStochastic Stability of Discrete-Time Phase-Coupled Oscillators Over Uncertain and Random Networks
Jafarian, M., Mamduhi, M. H., & Johansson, K. H. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3303102 · Cited by 6
“Since B (cid:9) B ≥ 0 holds for a connected graph [50], and also Ψ( · ) is an odd function, we obtain Notice that inequality (37) is greater than zero.”
BackgroundInfluentialKhamvilai, T., Sutter, L., Baufreton, P., et al. (2021) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01862-7 · Cited by 2
Target Controllability of Multi-Agent Systems
Ji, Y., Ji, Z., Liu, Y., et al. (2022) · IEEE Data Driven Control and Learning Systems Conference (DDCLS) · doi:10.1109/ddcls55054.2022.9858548 · Cited by 2
“Definition 3: [20] A graph G′ = {V ′, E ′, A′} is called an induced subgraph of graph G = {V, E ,A}, if V ′ ⊆ V and E ′ = {(u, v)|u, v ∈ V ′, (u, v) ∈ E}.”
Distributed Load Shedding via Differentially Private Average Consensus Algorithm
Qiao, Z., Guo, F., Pan, X., Sun, Y., & Wang, L. (2022) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc55256.2022.10034229 · Cited by 2
“By Assumption 1, we have λ1 = 0 and 0 < λ L 2 ≤ λn < 2 [22].”
Cluster Consensus of Multi-agent Systems with Second Order Dynamics Over Matrix-weighted Graphs
Gopika, R., Resmi, V., & Warier, R. R. (2022) · Indian Control Conference · doi:10.1109/icc56513.2022.10093252 · Cited by 2
“These interactions were initially modelled using non-negative scalar weights [5]– [7].”
MethodLiu, J., Liu, J., Wang, C., et al. (2023) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12857 · Cited by 2
Multiagent Networks with Misbehaving Nodes: Control with Driver and Observer Nodes †
Yildirim, E., Saltos, A., & Yucelen, T. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10155887 · Cited by 2
“For the following result, we utilize network partitioning [14].”
MethodLi, Q., Shen, Y., Cheng, L., et al. (2023) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2021.000764 · Cited by 2
Consensus of Nonholonomic Systems Using a Geometric PD Controller
Oza, H., Seshan, R., & Banavar, R. N. (2023) · European Control Conference (ECC) · doi:10.23919/ecc57647.2023.10178299 · Cited by 2
“Preliminaries on graphs Theoretical issues in multi-agent systems have been widely tackled using graph models [19].”
BackgroundCoupled output synchronization in networked systems
Sinha, P., Dutta, M., & Sukumar, S. (2023) · Systems & Control Letters · doi:10.1016/j.sysconle.2023.105646 · Cited by 2
Discovering golden ratio in the world’s first five-agent network in ancient China
Yang, C. (2023) · Scientific Reports · doi:10.1038/s41598-023-46071-6 · Cited by 2
Cooperative concurrent targeting for planar arrays of point sources
Ramazi, P., Zhang, F., & Cao, M. (2023) · Automatica · doi:10.1016/j.automatica.2023.111357 · Cited by 2
Wang, Z., & Hu, W. (2023) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas59377.2023.10316895 · Cited by 2
Resilient Estimation and Safe Planning for UAVs in GPS-Denied Environments
Wan, W., Kim, H., Hovakimyan, N., Voulgaris, P. G., & Sha, L. (2023) · Advances in industrial control · doi:10.1007/978-3-031-39767-7_7 · Cited by 2
Swarm Model for Path Tracking with Reference Motion Profile: a Diffeomorphism-based Approach
Bono, A., Chen, B. M., D’Alfonso, L., et al. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.730 · Cited by 2
“A three-step strategy based on the theory of diffeomorphisms has been described.”
Characterizing bearing equivalence in directed graphs
Sun, Z., Zhao, S., & Zelazo, D. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.1307 · Cited by 2
An Emulation Approach to Sampled-Data Synchronization
Barkai, G., Mirkin, L., & Zelazo, D. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384079 · Cited by 2
“This type of constraint is especially prevalent in agreement problems and is often analyzed through a blend of system and graph theoretic methods [7], [8].”
BackgroundImpulse Elimination and Synchronization in Descriptor Multi-Agent Systems
Patel, M., & Datta, S. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383901 · Cited by 2
Enwerem, C. O., & Baras, J. S. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3364987 · Cited by 2
“As already established in several studies (see [10, Sec.”
BackgroundResultDistributed Zone Allocation and Preservation in Multiagent Systems
Kurtoglu, D., Yucelen, T., Tran, D. M., Casbeer, D. W., & García, E. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3396613 · Cited by 2
“Referenced in seminal works [1], [2], [3], [4], these protocols employ graph theory to create scalable solutions suitable for even substantially large groups of agents.”
BackgroundDifferentially Private Nash Equilibrium Seeking in Quadratic Network Games
Wang, L., Ding, K., Leng, Y., Ren, X., & Shi, G. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3398729 · Cited by 3
“To this end, we introduce We arrange the eigenvalues of L in the increasing order as Then, there hold λ 1 = 0 and | λ i | 2 for all i = 1 , . . . , n [24].”
Reconfiguration of four-degree limited Laman graphs
Trinh, M. H. (2024) · IFAC Journal of Systems and Control · doi:10.1016/j.ifacsc.2024.100277 · Cited by 2
Real-Time Anomaly Detection in Connected Autonomous Vehicles: A Data-Driven Approach
Jalali, M., Moradi, M., & Saif, M. (2024) · Springer eBooks · doi:10.1007/978-3-031-53652-6_9 · Cited by 3
Gulzar, F., Khan, N. M., Butt, Y. A., & Bhatti, A. I. (2024) · Systems Science & Control Engineering · doi:10.1080/21642583.2024.2436666 · Cited by 6
“Considering the consensus problem for the robots i and j in Figure 1 to reach a mutually agreed common location in space, the following consensus equation can be written (Egerstedt, 2007; Mesbahi & Egerstedt, 2010): . where Φ i denotes the near-by robots of ith robot in a multi-robot system.”
InfluentialIdentifiability in networks of nonlinear dynamical systems with linear and/or nonlinear couplings
Verdière, N. (2024) · Franklin Open · doi:10.1016/j.fraope.2024.100195 · Cited by 3
Singularly Perturbed Hybrid Systems for Analysis of Networks With Frequently Switching Graphs
Tanwani, A., Shim, H., & Teel, A. R. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3523242 · Cited by 2
“Consensus problems with time-varying graphs have gathered significant interest in the literature [4], [12] and the techniques based on graph-theoretic methods for analysis of multi-agent systems can be found in [3], [20].”
Containment Control of Matrix-Scaled Multi-agent Networks
Zhang, X., Pan, L., Shao, H., et al. (2024) · IEEE International Conference on Unmanned Systems (ICUS) · doi:10.1109/icus61736.2024.10839904 · Cited by 2
Deadlock Resolution of Connected Multi-Agent Systems using Hierarchical Control
Garg, K., Hamilton, S., & Fan, C. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886421 · Cited by 2
“From [29, Theorem 2.8], we know that the graph topology G ( t ) is connected at time t if and only if the second smallest eigenvalue of the Laplacian matrix is positive, i.e., λ 2 ( L ( A ( t ))) > 0 .”
InfluentialKurtoglu, D., Yucelen, T., Tran, D. M., et al. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886107 · Cited by 2
“With growing interest, significant research has advanced distributed control protocols that are based on local, agent-to-agent information exchange (e.g., see [1]–[3] for the seminal books on the topic).”
Construction of the Sparsest Maximally r-Robust Graphs
Lee, H., & Panagou, D. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886656 · Cited by 2
“…by agent i , and where the following conditions are assumed for w ij [ t ] for ∀ i ∈ V and t ∈ Z ≥ 0 : Through the protocol given by (1), agents reach asymptotic consensus as long as the graph has a rooted-out branching (i.e. there exists a node that has paths to all other nodes in the graph) [16].”
Ashrafi, H., Baradarannia, M., & Bagheri, P. (2025) · Transactions of the Institute of Measurement and Control · doi:10.1177/01423312251317821 · Cited by 2
“• Distributed approach, where each DG is considered as an agent in a multi-agent system (MAS) and shares information only with a finite set of neighbors in a network defined by a communication graph among DGs (Mesbahi and Egerstedt, 2010).”
Chang, P. Y., Bhatti, S. G., Javed, N. U., et al. (2024) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc58415.2024.10920020 · Cited by 2
A passivity analysis for nonlinear consensus on balanced digraphs
Yue, F.-Y., & Zelazo, D. (2025) · European Journal of Control · doi:10.1016/j.ejcon.2025.101368 · Cited by 2
Shi, G., Ishat-E-Rabban, M., Bonner, G., et al. (2025) · Autonomous Robots · doi:10.1007/s10514-025-10224-5 · Cited by 2
“10, increasing the number of robots by up to 25% relative to the training setup (from 20 to 25) has minimal impact on performance, dem - onstrating strong generalization with respect to team size.”
Robust synchronization of coprime factor perturbed multi-agent systems
Jongsma, H.-J., Trentelman, H. L., & Camlibel, M. K. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760068 · Cited by 2
“Important properties of networked systems can be expressed in terms of the spectrum of the Laplacian, see [4], [12].”
BackgroundWang, J., Butcher, E. A., & Yucelen, T. (2018) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2018-1580 · Cited by 2
Data-Driven Impedance Matching in Multilateral Teleoperation Systems
Ramli, M. S., & Ahmad, H. (2018) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v10.i2.pp713-724 · Cited by 2
“The Laplacian matrix associated with is defined by [12]:”
BackgroundKoopman Performance Analysis of Nonlinear Consensus Networks
Mousavi, H., Somarakis, C., Sun, Q., et al. (2020) · Lecture notes in control and information sciences · doi:10.1007/978-3-030-35713-9_20 · Cited by 2
“,n w̃i j and g = min s1,s2∈Ω0 g(|s1 − s2|) > 0 [33].”
Analysis of containment control for multi-agent systems based on broadcast gossip algorithm
Ma, Z., Chen, H., Shi, L., et al. (2019) · Chinese Automation Congress · doi:10.1109/cac48633.2019.8996305 · Cited by 2
“The gossip algorithm is utilized in many fields, such as networked control [16] and multi-robot systems [17].”
MethodDistributed Multi-agent Deployment for Full Visibility of 1.5D and 2.5D Polyhedral Terrains
Ma, A., & Cortés, J. (2020) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-020-01229-6 · Cited by 2
“We are inspired by research on distributed algorithms for multi-agent networks [1, 7, 18] addressing computational geometric and optimization problems and, in particular, the classical art-gallery problem [5, 19], which seeks to find the optimum number of guards in a nonconvex environment so that each point is visible…”
MethodA Distributed Reinforcement Learning approach for Power Control in Wireless Networks
Ornatelli, A., Tortorelli, A., & Liberati, F. (2021) · IEEE World AI IoT Congress (AIIoT) · doi:10.1109/aiiot52608.2021.9454208 · Cited by 2
“The main advantage of these algorithms is the capability of inducing collective behavior through local interactions [21].”
BackgroundMethodDiscrete networked dynamic systems with mode separation: state and output synchronization
Mahmoud, M. S., & Karaki, B. J. (2021) · The Journal of Difference Equations and Applications · doi:10.1080/10236198.2021.1954627 · Cited by 2
“On a parallel development in view of the available results, it turns out that research avenues in multiagent systems offer great opportunities for further developments from theoretical, simulation and implementation standpoints [4,19].”
BackgroundRing Formation Maneuvering with Double Integrator Dynamics
Tran, D. M., Casbeer, D. W., García, E., et al. (2021) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas51884.2021.9476770 · Cited by 2
Swarm fixed-time reference tracking: a discrete model
Fedele, G., D’Alfonso, L., & Bono, A. (2021) · International Journal of Control · doi:10.1080/00207179.2021.1987525 · Cited by 2
“To this aim, we have chosen the method proposed in Gazi and Passino (2011) since it is designed for pure discrete-time systems and solves the shape control using the graph rigidity theory which is a very common tool in this context (Mesbahi & Egerstedt,2010 ).”
MethodYamauchi, J., Omainska, M., Beckers, T. L., et al. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683432 · Cited by 2
“For details, refer to [17].”
On the Selection of Leaders for the Controllability of Multi-agent Networks
Muni, V. S., Rafeek, K. V. M., Reddy, G. J., & George, R. K. (2022) · Bulletin of the Iranian Mathematical Society. · doi:10.1007/s41980-022-00683-2 · Cited by 2
Providing Local Resilience to Vulnerable Areas in Robotic Networks
Cavorsi, M., & Gil, S. (2022) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra46639.2022.9812033 · Cited by 2
Consensus in Multi-Agent Systems: A Transfer Function-Based Controller Design Approach
Datta, S. (2022) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2022.3184322 · Cited by 2
“The major global control objectives that are considered in the literature (see [2]–[4] and the references therein) are: i) consensus, ii) leader-follower synchronization and iii) formation.”
BackgroundMethodFard, N. E., & Šelmić, R. R. (2022) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv57592.2022.10004318 · Cited by 2
“A pair of agents i and j communicate if and only if (i, j) ∈ E [12].”
BackgroundSynchronization of heterogeneous agents using min-max optimization
Strubel, J., Stein, G., & Konigorski, U. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170710 · Cited by 2
“[18]).”
Predicting the disconnection of flocking agents in a swarm
Naruse, K. (2015) · IEEE International Conference on Advanced Intelligent Mechatronics (AIM) · doi:10.1109/aim.2015.7222805 · Cited by 2
“We can then represent the dynamics of all the agents [7, 8] as follows.”
BackgroundA data-driven approach for influencing consensus networks
Shao, H., Pan, L., & Mesbahi, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170760 · Cited by 2
“We start this section by considering the continuoustime consensus protocol via which state agreement can be guaranteed when the underlying communication network is connected [9], [14].”
BackgroundMethodSelf-citationSynchronization of dynamical networks under sampling
Giraldo, J., Mojica‐Nava, E., & Quijano, N. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669801 · Cited by 2
“We give here some necessary definitions adapted from [18] to follow the developments in this work.”
Non-linear flocking networks with collision avoidance
Somarakis, C., & Baras, J. S. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260851 · Cited by 2
“As only a brief introduction to the subject the interested reader is referred to [4, 5, 7, 9, 10, 12].”
BackgroundControllability of path graphs by using information of second-order neighbors
Yongcui, C., Ji, Z., & Wang, Y. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260682 · Cited by 2
“In particular, the multi-agent controllability contributes to the study of formation control [17, 18].”
BackgroundThe projection method for continuous-time consensus seeking
Agaev, R. P., & Chebotarev, P. Y. (2015) · Automation and Remote Control · doi:10.1134/s0005117915080081 · Cited by 2
“Then [4, Theorem 3.12] there are vectors of initial opinions such that the algorithm (1) and (2) does not lead to consensus.”
InfluentialConsensus in switching symmetric networks of first-order agents with delayed relative measurements
Proskurnikov, A. V. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6759999 · Cited by 2
“As a simple yet instructive case study of coordinated be havior, consensus Consensus was the subject of extensive research, the reader is referred to the monographs [1]-[3] for the survey of recent results and applications, including flocking, swarming and stabilization of formations.”
BackgroundKulkarni, A., Kazi, F., & Singh, N. (2013) · International Conference on Advances in Computing, Communications and Informatics (ICACCI) · doi:10.1109/icacci.2013.6637486 · Cited by 2
Achieving Relative Time Synchronization in Wireless Sensor Networks
Ahmed, S., Xiao, F., & Chen, T. (2013) · Journal of Control Science and Engineering · doi:10.1155/2013/538181 · Cited by 2
“, V n }, and an edge set, E(G) ⊂ {(V i , V j ) : V i , V j ∈ V(G)} where an edge is an unordered (ordered) pair of vertices [15].”
BackgroundConsensus via adaptation of the network structure
Lellis, P. D., di Bernardo, M., & Scafuti, F. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6759957 · Cited by 2
“Recently, there has been tremendous interest in coordination problems for multiagent systems, see [2]–[4] and references therein.”
BackgroundSelf-tuning average consensus in complex networks
Radenković, M. S., & Tadi, M. (2014) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2014.12.003 · Cited by 2
Uniform deployment of second-order agents on a line segment
Parsegov, S. E., & Proskurnikov, A. V. (2014) · International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) · doi:10.1109/icumt.2014.7002174 · Cited by 2
“Numerous examples that include, but are not limited to, oscillator networks, smart power grids, robotic and sensor networks, distributed estimation and optimization, models of economical and social interaction, intellectual behavior of biologic populations may be found in recent monographs and reviews [1], [3], [5], […”
BackgroundAchieving unanimous opinions in signed social networks
Altafini, C., & Lini, G. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862161 · Cited by 2
“Notice that, unlike in a consensus problem [17], [22], unanimity does not require all opinions to have the same value, but only the same sign.”
BackgroundStructural controllability of multi-agent networks
Rahimian, M. A., & Aghdam, A. G. (2012) · doi:10.1145/2401603.2401652 · Cited by 2
“The past decade has seen a growing interest in the control of multi-agent networks [2, 17].”
BackgroundOutput synchronization of uncertain nonlinear multi-agent systems with relative degree one
Strubel, J., Phan, H. T., & Konigorski, U. (2014) · IEEE International Symposium on Intelligent Control · doi:10.1109/isic.2014.6967596 · Cited by 2
“[5]) which allows to synchronize agents with integrator dynamics.”
BackgroundA Distributed Real-Time Algorithm for Preference-Based Agreement
Zelazo, D., Bürger, M., & Allgöwer, F. (2011) · IFAC Proceedings Volumes · doi:10.3182/20110828-6-it-1002.03155 · Cited by 2
“One well-studied problem related to this is the consensus, or agreement protocol [Mesbahi and Egerstedt (2010)].”
BackgroundOn connectivity preservation in mobile wireless multi-agent/node mesh networks
Edwards, C., Menon, P. P., Shtessel, Y. B., et al. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580760 · Cited by 2
“This quantity is known as the Fiedler eigenvalue and is associated with the algebraic connectivity of the graph [9], [15] and constitutes a measure of how connected the agents are (based on the proximity).”
BackgroundMulti-agent consensus with noisy communication via time averaging
Morita, R., Wada, T., Masubuchi, I., et al. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862595 · Cited by 2
“Therefore, it is useful for balancing large scale networked systems and expected for applications in various fields [1]–[4].”
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.