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 401–500 of 2,960
Coupled Multi-Robot Systems Under Linear Temporal Logic and Signal Temporal Logic Tasks
Lindemann, L., Nowak, J., Schönbächler, L., Guo, M., Tůmová, J., & Dimarogonas, D. V. (2019) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2955628 · Cited by 36
“The multi-agent system is modeled by an undirected graph G := ( V , E ) [5].”
BackgroundRobust Distributed Fixed-Time Economic Dispatch Under Time-Varying Topology
Baranwal, M., Garg, K., Panagou, D., & Hero, A. O. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3020248 · Cited by 37
“Lemma 5 ([16]).”
Distributed Control for Satellite Cluster Flight Under Different Communication Topologies
Zhang, H., & Gurfil, P. (2015) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g001355 · Cited by 34
“The graph G contains a rooted-out branching subgraph [27]: if there exists at least one vertex vr such that, for each other vertex v, there is a communication link from v to vr.”
BackgroundInfluentialFormation control of multiple autonomous underwater vehicles: a review
Yan, T., Xu, Z., Yang, S. X., & Gadsden, S. A. (2023) · Intelligence & Robotics · doi:10.20517/ir.2023.01 · Cited by 53
Observability and Detectability of Stochastic Labeled Graphs
Zhu, S., Cao, J., Lin, L., et al. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3278797 · Cited by 33
Chapman, A., & Mesbahi, M. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402964 · Cited by 33
“scenarios include networked robotic systems, human-swarm interaction, and network security [3], [4], and in areas such as quantum networks with respect to controlled potentials [5].”
BackgroundSelf-citationMitigating the Effects of Sensor Uncertainties in Networked Multi-Agent Systems
Arabi, E., Yucelen, T., & Haddad, W. M. (2016) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4035092 · Cited by 33
Analysis and Synthesis of MIMO Multi-Agent Systems Using Network Optimization
Sharf, M., & Zelazo, D. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2908258 · Cited by 33
“The study of graphs and their algebraic representations have emerged as an important tool in the modeling and analysis of these systems [4].”
MethodA distributed passivity approach to AUV teams control in cooperating potential games
Fabiani, F., Fenucci, D., & Caiti, A. (2018) · Ocean Engineering · doi:10.1016/j.oceaneng.2018.02.065 · Cited by 33
Open Multi-Agent Systems With Discrete States and Stochastic Interactions
Varma, V. S., Morărescu, I., & Nešić, D. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2840431 · Cited by 33
“They have a wide range of applications covering robotics [1], [2], power networks [3], [4] and opinion dynamics [5], [6].”
BackgroundTang, Y. (2018) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2018.2866902 · Cited by 35
“We use an undirected graph G = ( N , E , A ) to describe the information sharing topology with the node set N = { 1 , . . . , N } and the edge set E [23].”
MethodZhong, H., Wang, Y., Miao, Z., Tan, J., Li, L., Zhang, H., & Fierro, R. (2019) · International Journal of Control Automation and Systems · doi:10.1007/s12555-018-0005-1 · Cited by 34
Adaptive NN Cooperative Control of Unknown Nonlinear Multiagent Systems With Communication Delays
Psillakis, H. E. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2950114 · Cited by 33
“Many important results have been obtained and the interested reader can find detailed literature reviews on this topic in the works [5]–[7].”
BackgroundMethodOn the Controllability of Matrix-Weighted Networks
Pan, L., Shao, H., Mesbahi, M., Xi, Y., & Li, D. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2981038 · Cited by 41
“Consensus protocol plays a vital role in cooperative control of multi-agent networks, ensuring asymptotic alignment on the states of the agents required for accomplishing a global task via local interactions [32], [33], [34], [35].”
BackgroundSelf-citationVisual victim detection and quadrotor-swarm coordination control in search and rescue environment
Cardona, G. A., Ramirez-Rugeles, J., Mojica‐Nava, E., & Calderón, J. M. (2021) · International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering · doi:10.11591/ijece.v11i3.pp2079-2089 · Cited by 35
“convergence proof is shown in [29], both the sensor network must be connected and ρ(Lw(G)) < 2 ∆ , where ρ(Lw(G)) correspond to the maximum eigenvalue of the graph in absolute values.”
BackgroundFully Distributed Optimization-Based CAV Platooning Control Under Linear Vehicle Dynamics
Shen, J., Kammara, E. K. H., & Du, L. (2022) · Transportation Science · doi:10.1287/trsc.2021.1100 · Cited by 32
Wu, T., Xue, K., & Wang, P. (2022) · Journal of Mechanical Science and Technology · doi:10.1007/s12206-022-0336-y · Cited by 34
“Here, the knowledge of graph theory is employed to build the communication structure [46, 47].”
MethodGuiding Vector Fields for the Distributed Motion Coordination of Mobile Robots
Yao, W., de Marina, H. G., Sun, Z., & Cao, M. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3224257 · Cited by 34
“This subsection follows the convention in [29].”
Autonomous Wi-Fi Relay Placement With Mobile Robots
Gao, Y., Chen, H., Li, Y., et al. (2017) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2017.2751149 · Cited by 33
“been described in a previous study [16].”
Scaled consensus of switched multi-agent systems
Shang, Y. (2017) · IMA Journal of Mathematical Control and Information · doi:10.1093/imamci/dnx062 · Cited by 34
Multi-Robot Assignment and Formation Control
Macdonald, E. A. (2012) · SMARTech Repository (Georgia Institute of Technology) · Cited by 30
Continuous-time distributed convex optimization on weight-balanced digraphs
Gharesifard, B., & Cortes, J. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426897 · Cited by 32
“Nevertheless, it is natural to study whether the dynamics (6) enjoys the same convergence properties as in the undirected situation (as, for instance, is the case in the agreement problem [7], [8], [9], [10]).”
BackgroundEvent-Triggered Consensus of Matrix-Weighted Networks Subject to Actuator Saturation
Pan, L., Shao, H., Li, Y., Li, D., & Xi, Y. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3212773 · Cited by 32
“CONSENSUS problem on matrix-weighted networks is becoming a recent concern since, as an immediate generalization of scalar-weighted networks, matrix-weighted networks naturally capture interdependency complexity among vector-valued states of neighboring agents in a multi-agent network [1], [2], [3], [4], [5], [6], [7]…”
BackgroundConsensus and polarization in Altafini's model with bidirectional time-varying network topologies
Proskurnikov, A. V., Matveev, A. S., & Cao, M. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039710 · Cited by 45
“We refer the reader to [16], [23], [24] for excellent surveys of recent research on distributed consensus protocols and their applications, as well as historical milestones.”
BackgroundMethodControllability Characterizations of Leader-Based Swarm Interactions
de la Croix, J.-P., & Egerstedt, M. (2012) · SMARTech Repository (Georgia Institute of Technology) · Cited by 35
Self-citationModel Reduction Methods for Complex Network Systems
Cheng, X., & Scherpen, J. M. A. (2020) · Annual Review of Control Robotics and Autonomous Systems · doi:10.1146/annurev-control-061820-083817 · Cited by 32
“Chemical reaction chains, cellular and metabolic networks, social networks, multi-robot coordination, and large-scale power grids are only a few examples (1, 2, 3, 4, 5, 6, 7, 8).”
BackgroundStable switched controllers for a swarm of UGVs for hierarchal landmark navigation
Kumar, S. A., Sharma, B. N., Vanualailai, J., & Prasad, A. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100926 · Cited by 33
An Efficient Distributed Kalman Filter Over Sensor Networks With Maximum Correntropy Criterion
Hu, C., & Chen, B. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3175363 · Cited by 32
Convex Necessary and Sufficient Conditions for Density Safety Constraints in Markov Chain Synthesis
Acikmese, B. A., Demir, N., & Harris, M. W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2400712 · Cited by 32
“where Aa is the adjacency matrix [20]: Aa[i, j] = 1 if the transition from i to j state is feasible, and is 0 otherwise.”
BackgroundYao, W., Lu, H., Zeng, Z., Xiao, J., & Zheng, Z. (2018) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-018-0906-5 · Cited by 31
Cooperative localization and circumnavigation of multiple targets with bearing-only measurements
Chen, K., Qi, G., Li, Y., & Sheng, A. (2022) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.09.039 · Cited by 32
Haptic Interactions With Multi-Robot Swarms Using Manipulability
Setter, T., Fouraker, A., Kawashima, H., & Egerstedt, M. (2015) · Journal of Human-Robot Interaction · doi:10.5898/jhri.4.1.setter · Cited by 30
“The resulting graph structure is known as the interaction network (Mesbahi & Egerstedt, 2010) and its topology (i.e., what the graph looks like) has a direct impact on how easy or hard it is to control the network, as shown in de la Croix and Egerstedt (2012).”
BackgroundSelf-citationSparsity-promoting optimal control of consensus and synchronization networks
Wu, X., & Jovanović, M. R. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859497 · Cited by 31
“INTRODUCTION Consensus and synchronization problems are of increased importance in networks of dynamical systems [1].”
BackgroundZhang, K., & Demetriou, M. A. (2014) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g000009 · Cited by 31
What Can Systems Theory of Networks Offer to Biology?
Rajapakse, I., Groudine, M. T., & Mesbahi, M. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002543 · Cited by 31
“We have proposed a framework to examine this notion of controllability via the controllability gramian, a matrix that captures how directions in the nodes’ configuration space are attainable with a given external input [11].”
MethodSelf-citationYuan, C. (2017) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2017.06.003 · Cited by 32
Model Reduction of Multiagent Systems Using Dissimilarity-Based Clustering
Cheng, X., Kawano, Y., & Scherpen, J. M. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2853578 · Cited by 31
“IN recent decades, multiagent systems (or network systems) have received increasing attention from the system and control field [1], [2].”
BackgroundTargeted Bipartite Consensus of Opinion Dynamics in Social Networks With Credibility Intervals
Zou, Y., & Meng, Z. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2973422 · Cited by 33
A Survey on Techniques in the Circular Formation of Multi-Agent Systems
Litimein, H., Huang, Z.-Y., & Hamza, A. (2021) · Electronics · doi:10.3390/electronics10232959 · Cited by 31
Decentralized centroid and formation control for multi-robot systems
Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6631068 · Cited by 33
“the problem of reaching an agreement regarding a certain variable dependent on the state of all the agents; recent studies on this subject are summarized in the books [13], [14].”
BackgroundCoordinate Dual Averaging for Decentralized Online Optimization With Nonseparable Global Objectives
Lee, S., Nedić, A., & Raginsky, M. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2573639 · Cited by 46
Observability in Connected Strongly Regular Graphs and Distance Regular Graphs
Kibangou, A. Y., & Commault, C. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2357532 · Cited by 30
“Agents in distributed multiagent networks are required to operate in concert with each other in order to achieve system-level objectives, while having access to short-range communications, local sensing capabilities, and limited computational resources [17].”
BackgroundOnline Leader Selection for Improved Collective Tracking and Formation Maintenance
Franchi, A., & Giordano, P. R. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2567222 · Cited by 29
“The simple linear dynamics (7) is expressive enough for suitably modeling a generic (also non-linear) formation control action around its equilibrium point.”
BackgroundMethodInfluentialHorizons of cybernetical physics
Fradkov, А. L. (2017) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2016.0223 · Cited by 31
Distributed consistent data association via permutation synchronization
Leonardos, S., Zhou, X., & Daniilidis, K. (2017) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2017.7989308 · Cited by 31
“8 page 51 of [25], we have that if the (directed) graph G contains a rooted-out branching as a subgraph, then rankL(G) = n − 1.”
BackgroundBroadcast Your Weaknesses: Cooperative Active Pose-Graph SLAM for Multiple Robots
Chen, Y., Zhao, L., Lee, K. M. B., Yoo, C., Huang, S., & Fitch, R. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2970665 · Cited by 33
“1: (Weighted Matrix-Tree Theorem [25]).”
InfluentialEvent-Triggered Resilient Consensus for Multi-Agent Networks Under Deception Attacks
Wu, Y., Xu, M., Zheng, N., & He, X. (2020) · IEEE Access · doi:10.1109/access.2020.2989743 · Cited by 30
“Here we collect some basic concepts about graphs, and one can find further details in [33].”
MethodBuckley, I., & Egerstedt, M. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3072549 · Cited by 31
Self-citationResilient Real-Valued Consensus in Spite of Mobile Malicious Agents on Directed Graphs
Wang, Y., Ishii, H., Bonnet, F., et al. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2021.3096074 · Cited by 30
“of graphs containing directed spanning trees, which is central to consensus problems without adversaries [8], [23].”
BackgroundDistributed optimal control allocation for 6-dof spacecraft with redundant thrusters
Lang, X., & de Ruiter, A. H. J. (2021) · Aerospace Science and Technology · doi:10.1016/j.ast.2021.106971 · Cited by 33
Haddad, W. M., Lee, J., & Bhat, S. P. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3142189 · Cited by 30
“A sizable body of work has emerged in recent years that addressesthedistributedconsensusproblemusingthetoolsofal-gebraicgraphtheory(see,forexample,[6]–[16]forcontinuous-timenetworksand[17]–[23]fordiscrete-timenetworks).”
BackgroundKim, J., Fawcett, R. T., Kamidi, V. R., Ames, A. D., & Hamed, K. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3319896 · Cited by 30
“In addition, distributed control algorithms, including distributed receding horizon control approaches, have been developed to address the motion planning of MRSs, see, e.g., [33], [34], [35], [36].”
MethodGiraldo, J., Mojica‐Nava, E., & Quijano, N. (2014) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2014.05.042 · Cited by 31
Multiagent Coordination Via Distributed Pattern Matching
Sakurama, K., Azuma, S., & Sugie, T. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2885491 · Cited by 30
“To deal with such nonsmooth dynamics, the following lemma is available, derived from the nonsmooth version of LaSalle’s invariance theorem [37]–[39].”
MethodA Dynamic Game Model of Collective Choice in Multiagent Systems
Salhab, R., Malhamé, R. P., & Ny, J. L. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2723956 · Cited by 30
Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
Wang, C., Pan, L., Shao, H., et al. (2022) · Automatica · doi:10.1016/j.automatica.2022.110237 · Cited by 29
“[8], Olfati-Saber and Murray [11], Ren and Atkins [15], Mesbahi and Egerstedt [10]).”
BackgroundZhao, Z., Ding, J., Zhang, J., et al. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3285887 · Cited by 29
Detection and Isolation of Failures in Directed Networks of LTI Systems
Rahimian, M. A., & Preciado, V. M. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2378873 · Cited by 27
“Fault Detection and Isolation (FDI) is an active area of research with a wide range of applications, such as power systems analysis [1], robotic networks [2], and security of cyber-physical systems [3].”
BackgroundCollision-free consensus in multi-agent networks: A monotone systems perspective
Miao, Z., Wang, Y., & Fierro, R. (2015) · Automatica · doi:10.1016/j.automatica.2015.11.025 · Cited by 29
“…coordination and cooperative control of multi-agent systems in the past decade (Bai, Arcak, & Wen, 2011; Bullo, Cortes, & Martinez, 2009; Lewis, Zhang, Hengster-Movric, & Das, 2014; Mesbahi & Egerstedt, 2010; Qu, 2009; Ren & Beard, 2008; Ren & Cao, 2011; SemsarKazerooni & Khorasani, 2012).”
Coordination of multi-agent systems on interacting physical and communication topologies
Wang, J., Chen, K., & Lewis, F. L. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.12.008 · Cited by 31
Sahin, Y. E., Nilsson, P., & Özay, N. (2017) · doi:10.1145/3055004.3055021 · Cited by 29
“Classical techniques for coordination deal with relatively simple objectives, such as reaching a goal state while avoiding collisions or converging to a consensus formation, with various degrees of complexity in the dynamics [17, 24, 29].”
BackgroundDogan, K. M., Gruenwald, B. C., Yucelen, T., Muse, J. A., & Butcher, E. A. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1454606 · Cited by 29
“The last two decades have witnessed extensive research studies on these systems owing to their widespread applications in military and civilian environments (e.g. see Olfati-Saber, Fax, & Murray, 2007; Shamma, 2007; Ren & Beard, 2008; Bullo, Cortes, & Martinez, 2009; Mesbahi & Egerstedt, 2010).”
BackgroundMethodInfluentialDecentralized Formation Control of a Swarm of Quadrotor Helicopters
Toksöz, M. A., Oğuz, S., & Gazi, V. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899628 · Cited by 29
Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach
Elamvazhuthi, K., Kakish, Z., Shirsat, A., & Berman, S. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3031237 · Cited by 37
“Thesetechniquescontrastwith classicalapproachestomultiagentcontrol[28],inwhichthe controllawsdependontheindividualagents’identities.”
BackgroundControlling Symmetries and Clustered Dynamics of Complex Networks
Gambuzza, L. V., Frasca, M., Sorrentino, F., Pecora, L. M., & Boccaletti, S. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3037039 · Cited by 31
“CONTROL of complex networks is a challenging problem in many applications such as transport networks, power grids, wireless sensor networks, multi-robot teams, epidemics, social and biological systems [1], [2].”
BackgroundShifting Opinions in a Social Network Through Leader Selection
Yi, Y., Castiglia, T., & Patterson, S. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3058620 · Cited by 41
“Since −LF,F is Hurwitz for a nonempty leader set S [26], the system converges to a single stable steady state [27].”
BackgroundDistributed coordinated path following using guiding vector fields
Yao, W., de Marina, H. G., Sun, Z., & Cao, M. (2021) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48506.2021.9560845 · Cited by 28
“Please see [35] for an introduction to graph theory.”
BackgroundRistevski, S., Yucelen, T., & Muse, J. A. (2021) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2021.3089911 · Cited by 33
“In this section, we provide the notation used throughout this article (Section II-A) and outline some basic definitions from graph theory (Section II-B), where we refer to, for example, [3] and [22] for details.”
BackgroundMethodThe Artistic Geometry of Consensus Protocols
Tsiotras, P., & Castro, L. I. R. (2014) · Springer eBooks · doi:10.1007/978-3-319-03904-6_6 · Cited by 32
Fast Online Reinforcement Learning Control Using State-Space Dimensionality Reduction
Sadamoto, T., Chakrabortty, A., & Imura, J. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3027780 · Cited by 25
“This is often the case when the network exhibits a consensus property over a connected graph [39].”
BackgroundPequito, S., Kar, S., & Pappas, G. J. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171972 · Cited by 28
“where sensor parameters such as sampling rate and choice of installation site may dramatically affect the cost, or leader selection problems in which some agents are preferred to others in executing some tasks [3].”
BackgroundTopology Design for Stochastically Forced Consensus Networks
Hassan-Moghaddam, S., & Jovanović, M. R. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2674962 · Cited by 30
“Positive definiteness of the strengthened graph Laplacian G guarantees stability of the closed-loop network (2a) on the subspace 1 ⊥, and thereby consensus in the absence of disturbances [1].”
Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
Mousavi, S. S., Haeri, M., & Mesbahi, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2992444 · Cited by 28
“2992444 networks is of great interest in scenarios, such as formation control, human-swarm interaction, and network security [10], [11].”
BackgroundSelf-citationNecessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks
van Waarde, H. J., Tesi, P., & Camlibel, M. K. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2957345 · Cited by 37
“N ETWORKS of dynamical systems appear in a variety of domains, including power systems, robotic networks, and aerospace systems [1].”
BackgroundDelayed and Switched Control of Formations on a Line Segment: Delays and Switches Do Not Matter
Aleksandrov, A. Y., Fradkov, А. L., & Semenov, A. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2918995 · Cited by 28
Dynamic prioritized motion coordination of multi-AGV systems
Güney, M., & Raptis, I. A. (2020) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2020.103534 · Cited by 28
Cooperative output regulation for a network of parabolic systems with varying parameters
Deutscher, J. (2021) · Automatica · doi:10.1016/j.automatica.2020.109446 · Cited by 27
Reduction of Second-Order Network Systems with Structure Preservation
Cheng, X., Kawano, Y., Scherpen, J., et al. (2017) · Cambridge University Engineering Department Publications Database · Cited by 28
Gou, P., Guo, B., Guo, M., et al. (2023) · Sensors · doi:10.3390/s23020573 · Cited by 28
“When everything is said and done, the connection of the whole network is analyzed using the matrix power technique in [37].”
MethodTsukamoto, J., Iwai, D., & Kashima, K. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2459905 · Cited by 28
“As with most of radiometric compensation methods, we assume our projection objects as arbitrary shaped and textured but limited to Lambertian surfaces.”
BackgroundMultiagent Consensus With Noisy Communication: Stopping Rules Based on Network Graphs
Morita, R., Wada, T., Masubuchi, I., et al. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2481119 · Cited by 28
Laplacian dynamics on cographs: Controllability analysis through joins and unionsPreprint
Mousavi, S. S., Haeri, ء., & Mesbahi, M. (2018) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000381682 · Cited by 28
Self-citationA Sustainable Multi-Agent Routing Algorithm for Vehicle Platoons in Urban Networks
Giannini, F., Franzè, G., Pupo, F., & Fortino, G. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3305463 · Cited by 29
“By taking a look to the autonomous multi-vehicle systems, the coordination and control have gained more and more interest, see e.g., [26] and [27].”
BackgroundCooperative control of heterogeneous multi-agent systems under spatiotemporal constraints
Chen, F., Sewlia, M., & Dimarogonas, D. V. (2024) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2024.100946 · Cited by 27
Limited bandwidth recognition of collective behaviors in bio-inspired swarms
Brown, D. S., & Goodrich, M. A. (2014) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2615731.2615798 · Cited by 36
Feedback Navigation in an Uncertain Flowfield and Connections with Pursuit Strategies
Bakolas, E., & Tsiotras, P. (2012) · Journal of Guidance Control and Dynamics · doi:10.2514/1.54950 · Cited by 29
Feedback through graph motifs relates structure and function in complex networks
Hu, Y., Brunton, S. L., Cain, N., Mihalaş, Ş., Kutz, J. N., & Shea‐Brown, E. (2018) · Physical review. E · doi:10.1103/physreve.98.062312 · Cited by 39
Graph structure-preserving model reduction of linear network systems
Cheng, X., Kawano, Y., & Scherpen, J. M. A. (2016) · European Control Conference (ECC) · doi:10.1109/ecc.2016.7810580 · Cited by 27
“orientation, then the incidence matrix of G is defined by a n×m matrix E = [eij ] such that eij = 1 if the edge j is heading to vertex i, −1 if it is leaving vertex i and 0 otherwise, see [1].”
BackgroundMethodLiu, Z., Saberi, A., Stoorvogel, A. A., et al. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4046 · Cited by 27
“The objective of synchronization is to secure asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [11], [16], [19], [28] and references therein).”
BackgroundRobust formation control of multiagent systems on the Lie group SE(3)
Ghasemi, K., Ghaisari, J., & Abdollahi, F. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4806 · Cited by 31
Chen, Q., Xu, X., Jiang, H., & Liu, X. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3007973 · Cited by 28
“According to the graph theory [24], the edge set E ⊂ K × K contains the information interactions.”
BackgroundEmergence of extreme events in coupled systems with time-dependent interactions
Kumarasamy, S., Srinivasan, S., Gogoi, P. B., et al. (2021) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2021.106170 · Cited by 27
Capelli, B., & Sabattini, L. (2023) · IRIS UNIMORE (University of Modena and Reggio Emilia) · doi:10.1016/j.automatica.2023.111209 · Cited by 27
On a Class of Hierarchical Formations of Unicycles and Their Internal Dynamics
Consolini, L., Morbidi, F., Prattichizzo, D., et al. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2166299 · Cited by 27
Chebotarev, P., & Пашаевич, А. Р. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2304369 · Cited by 30
“Spanning diverging trees are also called out-arborescences or out-branchings [18].”
Online Learning of Dynamic Parameters in Social NetworksPreprint
Shahrampour, S., Rakhlin, A., & Jadbabaie, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.0432 · Cited by 37
“Noting that the spectrum of LKN , LSN and LCN are, respectively [15], {λN = 0,λN−1 = N, .”
BackgroundConsensus formation in first-order graphon models with time-varying topologies
Bonnet, B., Duteil, N. P., & Sigalotti, M. (2022) · Mathematical Models and Methods in Applied Sciences · doi:10.1142/s0218202522500518 · Cited by 50
“It is widely known (see e.g. [59, 64] along with the monographs [6, 57]) that in order to study the formation of consensus with respect to the ℓ 2 -norm for discrete systems of the form (2.4), it is often insightful to introduce the graph-Laplacian operator L N : R + × ( R d ) N → L (( R d ) N )…”
BackgroundInfluentialPopov-Type Criterion for Consensus in Nonlinearly Coupled Networks
Proskurnikov, A. V., & Matveev, A. S. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2354519 · Cited by 25
“More examples, along with extended surveys of the recent progress in the area and its motivation, can be found in [6]–[9].”
Impact of temporal network structures on the speed of consensus formation in opinion dynamics
Li, M., & Dankowicz, H. J. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.04.206 · Cited by 33
Optimal Mass Transport and Kernel Density Estimation for State-Dependent Networked Dynamic Systems
de Badyn, M. H., Eren, U., Acikmese, B. A., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619808 · Cited by 26
“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-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.