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,201–1,300 of 2,960
Mining hierarchical relations in building management variables
González, L. I. L., & Amft, O. (2015) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2015.10.009 · Cited by 11
Rheotaxis performance increases with group size in a coupled phase model with sensory noise
Chicoli, A., Bak-Coleman, J. B., Coombs, S., et al. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-50080-x · Cited by 8
“Consider a network [37] of N phase angles indexed by k = 1, .”
BackgroundAdaptive sliding mode observation in a network of dynamical systems
Menon, P. P., Edwards, C., & Shtessel, Y. B. (2016) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.2670 · Cited by 8
“The underlying graph topology of the Chua oscillators, which are assumed to be coupled via resistors, is based on the nearest-neighbour rule [3], which naturally defines Lij in (48).”
BackgroundReaching Agreement in Quantum Hybrid Networks
Shi, G., Li, B., Miao, Z., Dower, P. M., & James, M. R. (2017) · Scientific Reports · doi:10.1038/s41598-017-05158-7 · Cited by 6
“From the computational side, solving the Bellman equation (1) relies on recursively along the equation (1) computing C(x, t) (and therefore obtain the optimal σ⁎ x ( ) t ) from C(x, t + 1) for all = − .”
BackgroundMethodInfluentialDecentralized observability with limited communication between sensors
Alexandru, A. B., Pequito, S., Jadbabaie, A., & Pappas, G. J. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798379 · Cited by 7
“The present paper contains three main contributions.”
Resilient randomized quantized consensus with delayed information
Dibaji, S. M., Ishii, H., & Tempo, R. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798795 · Cited by 8
“The following corollary of Theorem 1 demonstrates that to achieve quantized consensus in this setting with delays and asynchrony, it is necessary and sufficient that a spanning tree exists in the network, which is the wellknown topological condition for multi-agent consensus when the states take real values [19].”
BackgroundInfluentialDecentralized Power Agreement for Improved Frequency Response in Interconnected Power Systems
Qureshi, M. U., & Grijalva, S. (2017) · IEEE Green Technologies Conference (GreenTech) · doi:10.1109/greentech.2017.62 · Cited by 8
“One of the properties of graph Laplacian L is to preserve the inherent network topology, and henceforth, the required information exchange within a network [8].”
BackgroundDistributed Optimization over Directed Graphs with the help of Lie Brackets
Ebenbauer, C., Michalowsky, S., Grushkovskaya, V., et al. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2456 · Cited by 8
Coherence of Noisy Double-Integrator Networks Without Velocity Measurements
Liu, M., & Li, Z. (2018) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2018.2868422 · Cited by 8
“Furthermore, the Laplacian matrix L can be written as L = RRT for the unweighted graph G [26].”
BackgroundTran, D. M., Yucelen, T., & Sarsilmaz, B. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619259 · Cited by 8
“We now concisely overview several notions from graph theory (we refer to, e.g., [1] for details).”
BackgroundBabazadeh, R., & Šelmić, R. R. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619654 · Cited by 8
“For an agent i, the neighboring set Ni is defined as a set of agents that are adjacent to the agent i [14].”
Convergence Analysis of Signed Nonlinear Networks
Chen, H., Zelazo, D., Wang, X., et al. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2913550 · Cited by 8
“network model captures the celebrated consensus, or Laplacian, dynamics over graphs [24].”
BackgroundDistributed Motion Tomography for Reconstruction of Flow Fields
Chang, D., Zhang, F., & Sun, J. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8793797 · Cited by 8
“The consensusbased methods [27] utilize the graph connectivity of multiagent networks, in which individual agents compute their own solutions and reach an agreement on the solutions among other agents by exchanging estimated solutions with their neighbors.”
MethodConsensus of Discrete-time Positive Multi-agent Systems with Observer-type Protocols
Gong, X., Liu, J., Wang, Y., et al. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899988 · Cited by 8
“The common characteristic of these applications is that each individual agent can only communicate with its neighbours to achieve certain global goals, which has leaded to an essential issue of multi-agent systems, called the consensus problem [5], [6].”
BackgroundHuman-Collaborative Schemes in the Motion Control of Single and Multiple Mobile Robots
Franchi, A. (2017) · Springer eBooks · doi:10.1007/978-3-319-40533-9_13 · Cited by 8
“Algebraic graph theory plays a fundamental role in the control of networked robots, see, e.g., [4] for an introduction to this vast topic.”
BackgroundSIS Epidemic Model under Mobility on Multi-layer Networks
Abhishek, V., & Srivastava, V. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147631 · Cited by 8
Distributed Fault Diagnosis of Nonlinear Stochastic Systems With Monitoring Networks
Raptis, I. A., & Noursadeghi, E. (2020) · IEEE Access · doi:10.1109/access.2020.3011725 · Cited by 8
Chen, F., & Dimarogonas, D. V. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304096 · Cited by 8
“, D = [ D F D T L ]T [10] with DF , DL denoting the incidence matrices with respect to the followers and leaders, respectively.”
BackgroundWang, Y., Yang, Y., Pu, Y., et al. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483087 · Cited by 8
Cyber-Attack Detection in Discrete-Time Nonlinear Multi-Agent Systems Using Neural Networks
Mousavi, A., Aryankia, K., & Šelmić, R. R. (2021) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta48906.2021.9658741 · Cited by 10
Distributed-infrastructure multi-robot routing using a Helmholtz-Hodge decomposition
Kingston, P., & Egerstedt, M. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160632 · Cited by 10
“[20]).”
Self-citationFinite-time median-related group consensus over directed networks
Ye, Y., & Shang, Y. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1514130 · Cited by 8
“Definition 2.2 ((Mesbahi & Egerstedt, 2010)): An edge cut-set in G is the set of edges whose deletion increases the number of connected components ofG.”
BackgroundInfluentialAchieving consensus on networks with antagonistic interactions
Altafini, C. (2012) · doi:10.1109/cdc.2012.6427063 · Cited by 8
Active Power Control of Wind Power Plants for Grid Integration
Pao, L. Y. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_272 · Cited by 10
Distributed algorithms for interacting autonomous agents
Xia, W. (2013) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 7
Deniz, M., Dogan, K. M., & Yucelen, T. (2022) · International Journal of Systems Science · doi:10.1080/00207721.2022.2146988 · Cited by 7
“Following the graph-theoretical notions of Godsil and Royle (2001) and Mesbahi and Egerstedt (2010), an undirected graph G is defined by a set of nodes V G = { 1, . . . , N } and a set of edges When ( i , j ) ∈ E G , the nodes i and j are said to be neighbours, where i ∼ j represents the…”
BackgroundMethodOptimal time-invariant distributed formation tracking for second-order multi-agent systems
Fabris, M., Fattore, G., & Cenedese, A. (2024) · European Journal of Control · doi:10.1016/j.ejcon.2024.100985 · Cited by 7
“Such an approach can be seen as a generalized consensus protocol [1] for the dynamics under investigation. i.e. the first-order cohesion/separation task.”
BackgroundTowards a unified theory of consensus
Somarakis, C. (2014) · doi:10.13016/m2mw3b · Cited by 7
“consider in [20, 32] an agreement problem over random information networks where the existence of an information channel between a pair of elements at each time instance is probabilistic and independent of other channels.”
BackgroundQuantum network reduced-state synchronization part I-convergence under directed interactions
Shi, G., Fu, S., & Petersen, I. R. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170716 · Cited by 7
“The past decade has witnessed various research efforts on distributed solutions to network systems, where interconnected nodes representing cars, robots, and sensors cooperatively perform tasks such as formation, coverage, and filtering via local communication and individual decision making [1].”
BackgroundAmani, A. M., Gaeini, N., Jalili, M., et al. (2016) · IEEE Innovative Smart Grid Technologies-Asia · doi:10.1109/isgt-asia.2016.7796518 · Cited by 7
“It has been shown in all of these studies that the structure of the communication network plays an important role in coordination of the system [12-14].”
BackgroundGaeini, N., Amani, A. M., Jalili, M., & Yu, X. (2016) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon.2016.7793837 · Cited by 7
Long-term voltage stability analysis and network topology in power systems
Rincon, R., Pavas, A., & Mojica‐Nava, E. (2016) · IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe) · doi:10.1109/isgteurope.2016.7856237 · Cited by 7
“(12) This matrix is symmetric and positive semidefinite [4], thus its eigenvalues can be ordered as”
BackgroundInfluentialCoverage Control for Wire-Traversing Robots
Notomista, G., & Egerstedt, M. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8461123 · Cited by 7
“From [18] we know that ∂J ∂pi (p ? i ) ‖ (ρi− pi ), where ‖ is the parallel symbol.”
Self-citationPerformance of leader-following consensus on multiplex networks
Gan, Z., Shao, H., Xu, Y., & Li, D. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.06.049 · Cited by 7
Hamed, K. A., Kamidi, V. R., Pandala, A., et al. (2020) · CaltechAUTHORS (California Institute of Technology) · Cited by 7
Chen, F., & Dimarogonas, D. V. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838497 · Cited by 7
“This assumption is not conservative: for example, in the popular connectivity maintenance [14] ∂x L is a zero vector if and only if x N = x 1 holds, which trivially satisfies the task specification.”
BackgroundInfluentialNetwork controllability measures of subnetworks: implications for neurosciences
Stocker, J. E., Nozari, E., van Vugt, M. K., Jansen, A., & Jamalabadi, H. (2023) · Journal of Neural Engineering · doi:10.1088/1741-2552/acb256 · Cited by 9
Distributed Online Generalized Nash Equilibrium Tracking for Prosumer Energy Trading Games
Xie, Y., Wang, Z., Pang, J. Z. F., et al. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10155982 · Cited by 7
Temporal Logic Swarm Control with Splitting and Merging
Cardona, G. A., Leahy, K., & Vasile, C.-I. (2023) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48891.2023.10160335 · Cited by 8
“This can be implemented using standard formation control [25], [26] and attitude control [27], [28] methods.”
MethodScale-Free Noncollaborative Linear Protocol Design for a Class of Homogeneous Multi-Agent Systems
Liu, Z., Saberi, A., & Stoorvogel, A. A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3324266 · Cited by 7
“In recent decades, the synchronization problem for multi-agent systems (MAS) has attracted substantial attention due to the wide potential for applications in several areas, see, for instance, the books [1], [2], [7], [13], [17], [19], [26] and references [8], [15], [16], etc.”
BackgroundDynamic wide‐area cooperative protection: A new approach
Koloushani, S. M., & Taher, S. A. (2023) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.13030 · Cited by 7
Aly, I. A., & Dogan, K. M. (2024) · Electronics · doi:10.3390/electronics13030524 · Cited by 7
“In addition, the degree matrix is denoted by T with a degree of a node d i being equal to the number of its neighbors, the adjacency matrix is denoted by , [3,41].”
BackgroundAdaptive Distributed Control for Leader–Follower Formation Based on a Recurrent SAC Algorithm
Li, M., Liu, H., Xie, F., & Huang, H. (2024) · Electronics · doi:10.3390/electronics13173513 · Cited by 12
Yucelen, T., Haddad, W. M., & Johnson, E. N. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580132 · Cited by 7
“In this section, we establish notation, definitions, and recall some basic results from graph theory [3, 15].”
BackgroundMethodJalalmaab, M., Pirani, M., Fi̇dan, B., & Jeon, S. J. (2016) · SAE International journal of passenger cars. Electronic and electrical systems · doi:10.4271/2016-01-0149 · Cited by 7
“The necessary conditions for convergence of above consensus estimation law is discussed in [3, 10].”
BackgroundConsensus of Quantum Networks With Directed Interactions: Fixed and Switching Structures
Shi, G., Fu, S., & Petersen, I. R. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2590503 · Cited by 7
“The basic idea is that [4] nodes in a network with suitable connectivity can reach a common state or trajectory where all nodes’ initial values are encoded with distributed node interactions, and the strong involvement of graph-theoretic approaches has reshaped the study of networked control systems [5].”
BackgroundOutput average consensus over heterogeneous multi-agent systems via two-level approach
Tang, Y. (2017) · Kybernetika · doi:10.14736/kyb-2017-2-0282 · Cited by 7
“Associated with these multi-agent systems, a digraph G = {V , E , A} is defined with node set N = { 1 , ..., N } to describe the communication topology (see [11] for details).”
The driving regulators of the connectivity protein network of brain malignancies
Tahmassebi, A., Pinker, K., Wengert, G., et al. (2017) · doi:10.1117/12.2263554 · Cited by 7
Distributed design of optimal structured feedback gains
Hassan-Moghaddam, S., & Jovanović, M. R. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264652 · Cited by 7
“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 [19].”
BackgroundAugmented state feedback for improving observability of linear systems with nonlinear measurements
Alaeddini, A., Morgansen, K. A., & Mesbahi, M. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.104520 · Cited by 7
“nd estimates for the baseline LQR control. (a) States estimation errors and 3s bounds from the EKF estimator. (b) True and estimated states. this network. The corresponding dynamics can be written as [28], x˙ = 2 4 2 1 1 1 2 1 1 1 2 3 5x+ 2 4 1 1 1 3 5u: If we solve the optimal LQR control for Q=I and R=1, we have u L…”
BackgroundSelf-citationDistributed Connectivity Maintenance and Collision Avoidance Control of Spacecraft Formation Flying
Xue, X., Yue, X., & Yuan, J. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866017 · Cited by 7
Distributed Control of Time-Varying Signed Networks: Theories and Applications
Meng, D., Wu, Y., & Cai, K. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2973306 · Cited by 7
Consensus based Nonlinear Guidance for Cooperative Salvo
Sinha, A., Kumar, S. R., & Mukherjee, D. (2019) · Indian Control Conference · doi:10.1109/icc47138.2019.9123223 · Cited by 7
“In compact form, we may write ė(t) = −Le(t), (13) which guarantees an asymptotic average consensus, with a convergence rate governed by λ2(L), [22].”
BackgroundBearing Rigidity-Based Localizability Analysis for Wireless Sensor Networks
Luo, X., Zhong, W., Li, X., et al. (2020) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2020.3011850 · Cited by 7
“Definition 3 (Incidence matrix): [34] Given Definition 4 (Connected graph): [33] Given an undirected graph G = ( V, E ) , G is connected if there is a path connecting each pair of nodes.”
BackgroundA Consensus Strategy for Decentralized Kinematic Control of Multi-Segment Soft Continuum Robots
Lafmejani, A. S., Farivarnejad, H., Doroudchi, A., & Berman, S. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147239 · Cited by 7
“(25), and using spectral factorization of the matrix L as in [36], Eq.”
MethodMulti-Robot Trajectory Tracking and Rendezvous Algorithm
Patil, A., & Shah, G. (2020) · IETE Journal of Research · doi:10.1080/03772063.2020.1800521 · Cited by 7
“For construction of Laplacian matrix L from underlying communication graph G N refer [17]”
BackgroundPersistent Awareness-Based Multi-Robot Coverage Control
Xu, X., Rodríguez-Seda, E. J., & Diaz-Mercado, Y. J. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304483 · Cited by 7
“…find By Gershgorin Circle Theorem [19], whereby applying the triangle inequality we get and consequently The following can be concluded where one can find max For a connected graph, the Laplacian matrix is positive semi-definite with a single zero eigenvalue associated with the eigenvector v = 1 [20].”
BackgroundFunctions of the Laplacian Matrix With Application to Distributed Formation Control
Morbidi, F. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3113263 · Cited by 11
“Matrix e−aL is doubly stochastic, and it has appeared under different forms in consensus theory [6].”
BackgroundQiu, L., Chen, W., & Wang, D. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-1249-z · Cited by 9
Control of Collective Dynamics with Time-Varying Weights
Piccoli, B., & Duteil, N. P. (2021) · Springer INdAM series · doi:10.1007/978-3-030-82946-9_12 · Cited by 7
Fault-Tolerant Formation Control of Passive Multi-Agent Systems Using Energy Tanks
Cristofaro, A., Giunta, G., & Giordano, P. R. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3169308 · Cited by 7
“Many control problems involving networks of agents strongly hinge on graph theory and are typically related to driving all systems composing the network toward a consensus behavior [4] or to the more general problem of formation control, whose goal is to make the overall set of agents attain a desired geometrical arra…”
Gomez, M. A., & Ramírez, A. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3203355 · Cited by 9
“Remark 1 (Consensus state and numbering of the eigenvalues): Note that if consensus is reached, one of the factors in (4) represents the consensus state of the agents [42].”
BackgroundKurtoglu, D., Yucelen, T., Ristevski, S., & Muse, J. A. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867518 · Cited by 7
“With regard to graph-theoretical notations (see, for example, [2] and [15]), G denotes an undirected graph, which is defined by the set V G = {1,... , n } of nodes and the set E G ⊂ V G × V G of edges.”
BackgroundBadrnoebashar, H., Baradarannia, M., Bagheri, P., et al. (2022) · Iranian Journal of Science and Technology Transactions of Electrical Engineering · doi:10.1007/s40998-022-00544-y · Cited by 7
“Alternatively, the following lemma in (Mesbahi and Egerstedt 2010) expresses the necessary condition for reaching consensus in multi-agent systems.”
BackgroundCompetitive equilibriums and social shaping for multi-agent systems
Chen, Y., Islam, R., Ratnam, E. L., et al. (2022) · Automatica · doi:10.1016/j.automatica.2022.110663 · Cited by 7
Giannini, F., Fortino, G., Franzè, G., et al. (2022) · 2022 IEEE 18th International Conference on Automation Science and Engineering (CASE) · doi:10.1109/case49997.2022.9926699 · Cited by 7
“The coordination and control of multi-vehicle systems have attracted the attention of several researchers in the last decades as testified by relevant review contributions, see e.g., [2], [3].”
BackgroundA Low-Complexity Brain–Computer Interface for High-Complexity Robot Swarm Control
Canal, G., Diaz-Mercado, Y. J., Egerstedt, M., & Rozell, C. J. (2023) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2023.3257261 · Cited by 9
“Over the last couple of decades, there have been many developments in large classes of coordination algorithms and abstractions that support the required mapping from low-complexity, high-level commands to highly complex coordinated swarm behaviors [42].”
BackgroundSelf-citationMachine Learning for Quantum Control
Dong, D., & Petersen, I. R. (2023) · Communications and control engineering/Communications and control engineering series · doi:10.1007/978-3-031-20245-2_5 · Cited by 9
Aly, I. A., Kurttisi, A., & Dogan, K. M. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156000 · Cited by 7
“In particular, this graph is defined by a set of nodes V G = { 1 , . . . , N } and a set of edges [29], [30].”
BackgroundPolicy Optimization Over Submanifolds for Linearly Constrained Feedback Synthesis
Talebi, S., & Mesbahi, M. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3306384 · Cited by 21
Self-citationMulticonsensus induced by network symmetries
Tomaselli, C., Gambuzza, L. V., Sorrentino, F., et al. (2023) · Systems & Control Letters · doi:10.1016/j.sysconle.2023.105629 · Cited by 7
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
Hedetniemi, S. T., Jacobs, D. P., & Kennedy, K. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.06.004 · Cited by 7
Distributed optimization on proximity network rigidity via robotic movements
Sun, Z., Yu, C. B., & Anderson, B. D. O. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260739 · Cited by 7
“Following the definition of the weighted Laplacian matrix L(Gw), we construct a new matrix E for the proximity network in a similar way as follows: L(Gw) = HTWH → E(Gw, p) = RTWR = H̄T ZWZT H̄ (7) where the weight matrix W represents the physical constraints in the network, and the weight function is usually chosen as…”
BackgroundMethodInfluentialGraph Process Specifications for Hybrid Networked Systems
Twu, P., Martin, P., & Egerstedt, M. (2010) · IFAC Proceedings Volumes · doi:10.3182/20100830-3-de-4013.00013 · Cited by 7
Self-citationDistributed convergence to Nash equilibria by adversarial networks with directed topologies
Gharesifard, B., & Cortés, J. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426083 · Cited by 7
“These are consensus-based dynamics, see [21], [22], [23], [24], and are typically designed in discrete time.”
BackgroundCluster Consensus of Multi-agent Systems with Signal Amplitude Constraint in Communication
Wang, M., & Uchida, K. (2012) · International Symposium on Computational Intelligence and Design · doi:10.1109/iscid.2012.56 · Cited by 6
Proportional integral distributed optimization for dynamic network topologies
Droge, G. N., & Egerstedt, M. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6858826 · Cited by 8
“The reader is encouraged to see, for example, [1] for a complete development of graph-based multi-agent control design.”
BackgroundMethodInfluentialSelf-citationOn the controllability and weight controllability of double integrator consensus systems
Goldin, D. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6759961 · Cited by 7
“We require the following definition, which is an extension of [6], Def.”
BackgroundMethodInfluentialDecentralized formation of random regular graphs for robust multi-agent networks
Yazıcıoğlu, Y., Egerstedt, M., & Shamma, J. S. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039446 · Cited by 7
“Robust interaction graphs with fast mixing times are desirable in numerous multi-agent applications including, but not limited to, flocking and swarming (e.g., [4]), sensor coverage (e.g., [5]), distributed estimation (e.g., [6]), and distributed control of robotic networks (e.g., [7], [8]).”
BackgroundSelf-citationMicrogrids coordination based on heterogeneous multi-agent systems
Toro, V., & Mojica‐Nava, E. (2015) · IEEE Colombian Conference on Automatic Control (CCAC) · doi:10.1109/ccac.2015.7345197 · Cited by 7
Zhang, M., Stoorvogel, A. A., & Saberi, A. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170828 · Cited by 7
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [12], [18], [28]).”
BackgroundTrust in multi-agent networks: From self-centered to team-oriented
Setter, T., Gasparri, A., & Egerstedt, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963083 · Cited by 6
Self-citationOn solving probabilistic load flow for radial grids using polynomial chaos
Appino, R. R., Mühlpfordt, T., Faulwasser, T., & Hagenmeyer, V. (2017) · doi:10.1109/ptc.2017.7981264 · Cited by 9
“Specifically, the graph is an in-branching tree [12].”
BackgroundMethodEnhanced Frequency Response Based on Multiagent Distributed Power Agreement
Qureshi, M. U., & Grijalva, S. (2017) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2017.2769662 · Cited by 7
“One of the properties of graph Laplacian L is to preserve the inherent network topology, and henceforth, the required information exchange within a network [30].”
BackgroundGeometric Pattern Formation on a Plane Under a General Graph Topology
Monsingh, J. M., Sinha, A., & Boland, D. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.431 · Cited by 7
Scale-Free Vision-Based Aerial Control of a Ground Formation With Hybrid Topology
Aranda, M., Mezouar, Y., Nicolás, G. L., et al. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2018.2834308 · Cited by 7
“We address here the particular problem of formation shape control, where multiple robots move to collectively form a desired shape with unspecified location, rotation, and size [1].”
BackgroundFault Tolerant Control for Networked Mobile Robots
Pierpaoli, P., Sauter, D., & Egerstedt, M. (2018) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2018.8511420 · Cited by 7
“The degree of interaction depends on the sensor and communication architectures, and can be conviniently modeled using elements from graph theory [1], [2].”
BackgroundMethodInfluentialSelf-citationDistributed Decision Making and Control for Cooperative Transportation Using Mobile Robots
Ebel, H., & Eberhard, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93818-9_9 · Cited by 9
Towards Almost Global Synchronization on the Stiefel Manifold
Markdahl, J., Thunberg, J., & Gonçalves, J. M. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619593 · Cited by 8
“Consensus protocols for agents whose dynamics evolve over linear spaces are well understood [13].”
BackgroundLaplacian Controllability of Interconnected Graphs
Hsu, S. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2947589 · Cited by 7
“MODERN control, communication, and networking technologies admit their integrations to innovative systems composed of the units such as robots or drones [1].”
BackgroundDistributed Fault-Tolerant Formation Control of Cooperative Mobile Robots
Khalili, M., Zhang, X., Gilson, M., & Cao, Y. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.09.617 · Cited by 7
Distributed Source Seeking and Robust Obstacle Avoidance Through Hybrid Gradient Descent
Mohr, H., Schroeder, K., & Black, J. T. (2019) · Proceedings - IEEE Aerospace Conference · doi:10.1109/aero.2019.8741882 · Cited by 7
“It was shown in [13] that the Laplacian is a symmetric positive semidefinite matrix with a zero eigenvalue corresponding to the eigenvector of all ones.”
BackgroundOn the stability and convergence of a class of consensus systems with a nonlinear input
Liu, M., Wirth, F. R., Corless, M., & Shorten, R. N. (2017) · Automatica · doi:10.1016/j.automatica.2017.08.003 · Cited by 5
“For a discussion of conditions used in this area we refer the reader to [1,14,15].”
An Event-Triggered Approach to Quantized Resilient Consensus
Wang, Y., & Ishii, H. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796025 · Cited by 7
“By (24), with positive probability, for any l ≥ 1, it holds”
BackgroundTheoretical Analysis of Mobile Control Method for Group Agents Motivated by Sheepdog Shepherding
Tsunoda, Y., SUEOKA, Y., Wada, T., et al. (2019) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.55.507 · Cited by 7
Distributed Circumnavigation Control with Dynamic Spacing for a Heterogeneous Multi-robot System
Yao, W., Luo, S., Lu, H., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-27544-0_31 · Cited by 7
“time period where i is constant, Aand bare constant matrix and vector respectively. Note that matrix Ais a row stochastic matrix [2] and furthermore, it could be considered as the adjacency matrix [5] corresponding to a weighted directed ring denoted by G(A). It can be readily veried that G(A) is strongly connected. N…”
BackgroundOn Modal Properties of the Koopman Operator for Nonlinear Systems with Symmetry
Mesbahi, A., Bu, J., & Mesbahi, M. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815342 · Cited by 7
“The controllability and observability of networked dynamical systems can be dramatically affected by their symmetry [12], [13].”
BackgroundSelf-citationA Distributed Model Predictive Scheme for Resilient Consensus with Input Constraints
Wang, Y., & Ishii, H. (2019) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2019.8920700 · Cited by 7
“Robust graphs may not be strongly connected in general, but this property indicates that the notion of robust graphs is a generalization of those containing directed spanning trees, which are of great relevance in the literature of consensus [17].”
BackgroundKashyap, A., & Keilholz, S. D. (2020) · Network Neuroscience · doi:10.1162/netn_a_00129 · Cited by 9
“own, the consensus system does not add in any unstable dynamics due to all of its 352 eigenvalues being less than zero, if k is set to less than 1 [24].”
BackgroundDistributed Learning in Network Games: a Dual Averaging Approach
Talebi, S., Alemzadeh, S., Ratliff, L. J., et al. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9030002 · Cited by 7
“Common to all of these systems, a global objective is achieved based on local interactions which in turn require local decision-making that is inherently restricted by limited information exchange and prescribed set of admissible policies [1].”
BackgroundSelf-citation
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.