The DOI matches its Crossref record.
Graph Theoretic Methods in Multiagent Networks
Abstract
This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Items 1,801–1,900 of 2,960
Stoorvogel, A. A., Nojavanzadeh, D., Liu, Z., et al. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619229 · Cited by 3
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [15], [21], [33] and references therein).”
BackgroundJafarian, M., Mamduhi, M. H., & Johansson, K. H. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796107 · Cited by 3
“The edge Laplacian of a tree graph is invertible [22].”
Robustification of sample-and-hold controllers for the consensus problem
Cesarone, F., & Pepe, P. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796076 · Cited by 3
Implementation of min-max time consensus tracking on a multi-quadrotor testbed
Joshi, A., Sawant, V., Chakraborty, D., et al. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8795992 · Cited by 3
“It is usually assumed that the followers can only communicate with neighbouring agents, where proximity might be based on a network architecture or geographical distance [8] [9].”
BackgroundDistributed Sparse Modeling for Society 5.0: Big Data Analysis over Multiagent Networks
Hayashi, N., & Nagahara, M. (2019) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.13.2_95 · Cited by 3
Control of Multiagent Systems with Local and Global Objectives: Experimental Results
Yildirim, E., Sarsılmaz, S. B., Tran, D. M., et al. (2020) · AIAA SciTech Forum · doi:10.2514/6.2020-1115 · Cited by 3
“Since multiagent systems have been an active research topic in the control systems community over the last two decades, major issues (e.g., consensus, formation, and so on) have been addressed in numerous studies (e.g., see [2] and [3]).”
BackgroundBabazadeh, R., & Šelmić, R. R. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029296 · Cited by 3
“A set of agents that are adjacent to a particular agent i is called the neighboring set of the agent and is denoted by N i [14].”
BackgroundFastest Mixing Markov Chain on a Compact Manifold
Biswal, S., Elamvazhuthi, K., & Berman, S. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029224 · Cited by 3
“While there are numerous well-established methods for control of multi-agent systems [4], [21], [23], many of these control approaches do not scale well to very large agent populations.”
BackgroundStability and Sustainability of a Networked Resource Consumption Model
Hale, M., Ruf, S. F., Manzoor, T., & Muhammad, A. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.2999039 · Cited by 4
“Work in this literature has studied the effects of topology on distributed agreement problems [24], [25], robotic formations [26]–[28], and many other related problems [29].”
BackgroundUAV Implementation of Distributed Robust Target Location in Unknown Environments
Mohr, H. (2020) · Proceedings - IEEE Aerospace Conference · doi:10.1109/aero47225.2020.9172459 · Cited by 3
“The approach used to mathematically describe the interactions among drones is derived from the graph theoretic methods developed for multi-agent systems discussed in [17], [18].”
MethodOn the Boundedness of Subgradients in Distributed Optimization
Zhu, K., Zhu, H., & Tang, Y. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189617 · Cited by 2
“In this section, we first provide some preliminaries about graph theory [13] and convex analysis [12], and then present the formulation of our problem.”
BackgroundSpreading dynamics on complex dynamical networks
Wang, L., Bin, W. U., Yuting, W. E. I., Zhou, D., & Du, J. (2020) · Scientia Sinica Informationis · doi:10.1360/ssi-2020-0087 · Cited by 3
Distributedly Solving Boolean Equations over Networks
Qi, H., Li, B., Jing, R.-J., Proutière, A., & Shi, G. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304144 · Cited by 3
Rezaei, V., & Stefanovic, M. (2021) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med51440.2021.9480347 · Cited by 3
“Unlike the standard definitions in the literature [21], G a and G c admit selfloops where, by a selfloop, we mean an edge that goes out and returns to the same node without passing through others.”
BackgroundIndustry-track: Challenges in Rebooting Autonomy with Deep Learned Perception
Abraham, M., Mayne, A., Pérez, T., de Oliveira, Í. R., Yu, H., Hsieh, C., Li, Y., Sun, D., & Mitra, S. (2022) · ACM International Conference on Embedded Software (EMSOFT) · doi:10.1109/emsoft55006.2022.00016 · Cited by 3
“Flocking and formation control algorithms have been extensively studied [17], [18].”
BackgroundLaplacian eigenvalue allocation by asymmetric weight assignment for path graphs
Parlangeli, G. (2022) · International Conference on System Theory, Control and Computing (ICSTCC) · doi:10.1109/icstcc55426.2022.9931897 · Cited by 3
“This condition, together with the simplicity of the eigenvalues, is related to several properties of the leader with respect to the network which are usually desirable, such as controllability and observability [21].”
BackgroundRiemannian Constrained Policy Optimization via Geometric Stability Certificates
Talebi, S., & Mesbahi, M. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992877 · Cited by 3
Self-citationOptimal Control and Station Relocation of Vehicle-Sharing Systems With Distributed Dynamic Pricing
Sakurama, K. (2023) · IEEE Open Journal of Intelligent Transportation Systems · doi:10.1109/ojits.2023.3279441 · Cited by 3
“First, we show that the system in question is of the same form as a consensus control system with external disturbance, which has been studied in the control engineering field [19].”
BackgroundFormation Control for a Class of Nonlinear Multi-Agent Systems Using Three-Layer Neural Networks
Aryankia, K., & Šelmić, R. R. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10155832 · Cited by 3
“The reader is invited to see definitions of the Adjacency matrix, neighboring set, and the graph Laplacian in [15].”
BackgroundEfficient leader selection for translation and scale of a bearing-compass formation
Schoof, E., Chapman, A., & Mesbahi, M. (2015) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2015.7139434 · Cited by 3
“One approach requires knowledge of the relative position of neighboring agents, either in Cartesian or polar coordinates [2].”
BackgroundSelf-citationGraphs for Ontology, Law and Policy
Mazzéga, P., Romain Boulet, A., & Libourel, T. (2012) · InTech eBooks · doi:10.5772/35046 · Cited by 3
Cenedese, A., & Zanella, F. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.00985 · Cited by 3
“For more details, we refer the reader to the specialized literature (e.g. Mesbahi and Egerstedt (2010), Boyd et al. (2006)).”
MethodAn Online Distributed Game Optimal Control for Heavy Haul Trains with Limited Communication
Gao, K., Huang, Z., Peng, J., et al. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/158695 · Cited by 3
“, V n } in the Graph G(V, ε,A), which is used to describe the communication among the cars (a node in the graph) similarly as [17].”
MethodInterval consensus problem of multi-agent systems in accordance with switching protocol
Wang, M., & Uchida, K. (2014) · International Journal of Systems Science · doi:10.1080/00207721.2014.901581 · Cited by 3
“…the best of the authors’ knowledge, the proposed types of dynamic graphs have not been discussed so far; in the literature on dynamic graphs (e.g., Mesbahi & Egerstedt, 2010 and references therein), most research considers the case when network topology depends on relative states, while the…”
BackgroundInfluentialTowards power-aware rendezvous
Jaleel, H., Bopardikar, S. D., & Egerstedt, M. (2011) · doi:10.1109/cdc.2011.6161023 · Cited by 3
“(To paraphrase [15], “Just because you’re neighbors doesn’t mean you’re friends.”
BackgroundSelf-citationDecentralized mean orbit element formation stability for uncoordinated maneuvers
Holzinger, M. J., & McMahon, J. W. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580583 · Cited by 3
“The problem of spacecraft in a formation with intermittent communications agreeing on the location of the moving barycenter may be directly framed as a consensus problem over random directed graphs [7], [8], [9], [10].”
BackgroundConsensus between nonlinearly coupled discrete-time agents
Proskurnikov, A. V. (2014) · European Control Conference (ECC) · doi:10.1109/ecc.2014.6862617 · Cited by 3
“Alternative techniques for proving consensus employ the theory of stochastic matrices [4], [20] and theory of contracting mappings [6].”
BackgroundMethodInfluentialAinsworth, N., & Grijalva, S. (2013) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesmg.2013.6672571 · Cited by 3
Menon, P. P., & Edwards, C. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760316 · Cited by 3
“Control of network of dynamical systems using distributed and consensus control methods [1] involve the exchange of output information among the agents of the network over cyber-space.”
BackgroundNetwork Clustering for SISO Linear Dynamical Networks via Reaction-Di usion Transformation
Ishizaki, T., Kashima, K., Imura, J., et al. (2011) · IFAC Proceedings Volumes · doi:10.3182/20110828-6-it-1002.00791 · Cited by 3
“See, e.g., [Mesbahi and Egerstedt (2010)] for a survey on networked systems and multi-agent systems.”
BackgroundConsensus and disagreement in collective homing problems: A mean field games formulation
Salhab, R., Malhamé, R. P., & Ny, J. L. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039498 · Cited by 3
Uncooperative multi-agent communication network control, hybrid LQ approach
Cosby, J. A., Shtessel, Y. B., & Bordetsky, A. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315121 · Cited by 3
“If any eigenvalues are equal zero other than the first eigenvalue, then the graph is d-disconnected [5].”
BackgroundInfluentialTopology control of dynamic networks in the presence of local and global constraints
Moshtagh, N., Mehra, R. K., & Mesbahi, M. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509828 · Cited by 3
“The structure of potential games guarantees the existence of NE [8].”
BackgroundSelf-citationHaddad, W. M., Hui, Q., & L׳Afflitto, A. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6579842 · Cited by 3
“Recent technological advances in communications and computation have spurred a broad interest in control of networks and control over networks [5].”
BackgroundModel order reduction for MIMO linear dynamical networks via Reaction-Diffusion transformation
Ishizaki, T., Kashima, K., Imura, J., et al. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5990628 · Cited by 3
“Examples of such dynamical networks include World Wide Web, gene regulatory networks, spread of infection; see [1], [2], [3] for an overview.”
BackgroundPower-aware rendezvous with shrinking footprints
Jaleel, H., & Egerstedt, M. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094499 · Cited by 3
“The rendezvous problem belongs to the class of consensus problems (see for example [4], [9], [10], [13], [14], [15], [16], [18]), where a collection of agents have to agree on some state value (position in this case).”
BackgroundMethodInfluentialSelf-citationSynchronization of linear agents with sector-bounded input nonlinearities
Takaba, K. (2015) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.1109/iccas.2015.7364868 · Cited by 3
“Over the last decade, distributed cooperative control of multi-agent systems has been attracting a great interest in the control theory community (see [1],[2] and the references therein).”
BackgroundDistributed Consensus and Coordination Control of Networked Multi-agent Systems
Yan, F., & Chen, G. (2012) · Understanding complex systems · doi:10.1007/978-3-642-33359-0_3 · Cited by 4
Structural controllability of multi-agent networks: Importance of individual links
Rahimian, M. A., & Aghdam, A. G. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580918 · Cited by 3
“The past decade has seen a growing interest in the control of multi-agent networks [1], and in particular, those with a leader-follower architecture, for which controllability is a popular research topic [2], [3].”
BackgroundCooperative robust output regulation of heterogeneous Lur'e networks
Zhang, F., Trentelman, H. L., Scherpen, J. M. A., et al. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7403432 · Cited by 3
On the Formation Control of Multiagent Systems Under Nearly Cyclic Pursuit
Iqbal, M., & Ngo, T. D. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-08338-4_41 · Cited by 3
Gradient and passive circuit structure in a class of non-linear dynamics on a graph
Mangesius, H., Delvenne, J., & Mitter, S. K. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.06.019 · Cited by 3
“For LTI symmetric consensus networks such an equ ivalence has been linked to the averaging dynamics of unit capacitor RC circuits in [6] chap.”
MethodJoint Performance and Controllability of Networked Systems
Clark, A., Alomair, B., Bushnell, L. G., & Poovendran, R. (2015) · Communications and control engineering/Communications and control engineering series · doi:10.1007/978-3-319-26977-1_9 · Cited by 3
Oooka, K., & Oguchi, T. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.11.003 · Cited by 3
Aranda, M., Aragüés, R., Nicolás, G. L., et al. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525207 · Cited by 3
“The control of formations [1], [2] is a relevant topic in this field.”
BackgroundModel-Free Learning of Nash Games With Applications to Network Security
Vamvoudakis, K. G. (2016) · Elsevier eBooks · doi:10.1016/b978-0-12-805246-4.00010-0 · Cited by 3
Robust controllability assessment via semi-definite programming
Babazadeh, M., & Nobakhti, A. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.10.001 · Cited by 3
Online algorithms for network formation
Meng, D., Fazel, M., & Mesbahi, M. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798259 · Cited by 3
Self-citationPartial attitude consensus for underactuated satellite clusters
Brewer, J. M., & Tsiotras, P. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798798 · Cited by 3
“Since a tree with N vertices and N − 1 edges has an incidence matrix D ∈ RN×(N−1) for an arbitrarily directed digraph that is full column rank [18], the agreement subspace lim t→∞ ∑ j∈Ni w ij = 0, for all i ∈ S, can be described as ∑ j∈N1 w 1j”
MethodZhang, F., Trentelman, H., & Scherpen, J. M. A. (2014) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 3
Distributed flow network control with demand response via price adjustment
Sakurama, K. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.02.092 · Cited by 3
Robust ℋ∞consensus for multi-agent systems with time-varying input delay using dynamic IQCs
Yuan, C. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963072 · Cited by 3
“Numerous interesting results have been reported in the literature (see [1], [2], [3] and the references therein).”
BackgroundTran, D. M., Yucelen, T., & Jagannathan, S. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963548 · Cited by 3
“In this section, we recall some basic notions from graph theory and refer to excellent textbooks [32] and [33] for all related additional details.”
BackgroundLaplacian eigenvector centrality as tool for assessing causality in power quality
Garzőn, C., & Pavas, A. (2017) · doi:10.1109/ptc.2017.7981261 · Cited by 3
“The system depicted in Fig 4, comprises a PCC and N agents connected thereto, which in the context of graph theory is called a full information systems [14].”
BackgroundMethodPrivacy-based cooperation for networked cyber-physcial systems
Zhang, W., Zuo, Z., & Wang, Y. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028720 · Cited by 3
“We suggest the interesting readers refer the survey reference [5] and the representative monographes [6, 7].”
BackgroundMethodCoordination of heterogeneous nonlinear multi-agent systems with prescribed behaviours
Tang, Y. (2016) · International Journal of Control · doi:10.1080/00207179.2016.1239839 · Cited by 3
“The neighbour set of agent i is defined as Mesbahi and Egerstedt (2010) for more details).”
BackgroundAmani, A. M., Gaeini, N., Jalili, M., et al. (2017) · doi:10.1109/anzcc.2017.8298498 · Cited by 3
“It has been shown that the structure of this communication network plays an important role in coordination of the system [12, 13].”
BackgroundPointing consensus for rooted out-branching graphs
Trinh, M. H., Zelazo, D., Tran, Q. V., et al. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430992 · Cited by 3
“Given n agents having different initial state values, by exchanging and updating the states based on the weighted sum of differences, all agents’ states eventually reach a same value [6].”
BackgroundStochastic Consensus over Time-Varying Networks of Linear Symmetric Agents
Hanada, K., Wada, T., Masubuchi, I., Asai, T., & Fujisaki, Y. (2018) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.31.28 · Cited by 3
“,p}, where 1N is the N -dimensional vector whose elements are all 1 [3].”
BackgroundInfluentialNew Internal Model Average Consensus Estimators with Light Communication Load
Lee, J., & Back, J. (2018) · International Journal of Control Automation and Systems · doi:10.1007/s12555-018-0024-y · Cited by 3
Optimal Control of Left-Invariant Multi-Agent Systems with Asymmetric Formation Constraints
Colombo, L. J., & Dimarogonas, D. V. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550238 · Cited by 3
“Multi-agent systems [13] have gained a lot of attention in the last decades due to the advances in communication, robotics and cooperative control of spacecrafts, robotic manipulators as well as unmanned aerial and underwater vehicles.”
BackgroundGeometric Pattern Formation with Coordinated Double-Integrator Agents
Jerome Moses, M., Sinha, A., & Chung, H. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.11.537 · Cited by 3
Control and Powertrain Management for Multi-Autonomous Hybrid Vehicles
Ghasemi, M., & Song, X. (2019) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4043110 · Cited by 3
Topological Controllability of Undirected Networks of Diffusively-Coupled Agents
Ahn, H., Moore, K. L., Kwon, S., Tran, Q. V., Kim, B., & Oh, K. (2019) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2019.8859783 · Cited by 4
“Under Laplacian dynamics, input symmetry was characterized for making a network uncontrollable in [12].”
BackgroundDistributed Adaptive Formation Control of a Team of Aerial Robots in Cluttered Environments
Xie, Z., Long, Y., & Cheng, H. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-27535-8_49 · Cited by 3
Detection of False Data Injection Attack in Smart Grids via Interval Observer
Wang, X., Luo, X., Zhang, M., et al. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8832350 · Cited by 3
“Definition 1: (Cartesian product graph [17]): Assume a case where, there are any two graphs G1 = (ν1, ε1) and G2 = (ν2, ε2), hence the Cartesian product graph G has the vertex set ν = ν1 × ν2 and vertices (i1, i2) , (j1, j2) ∈ ν which are adjacent if and only if either i1 = j1 and i2j2 ∈ ε2 or i2 = j2 and i1j1 ∈ ε1.”
BackgroundA Viral Model of Product Adoption with Antagonistic Interactions
Ruf, S. F., Paré, P. E., Liu, J. Y., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815349 · Cited by 3
“Both the SIS and opinion dynamic models have recently been of interest to the controls community [11], [23], [26], where the emphasis has been on analysis of their limiting behavior.”
BackgroundDesign of Swarm Robots Formation Control System Based on Vision Guidance
Lan, R., Wang, X., Xiao, Z., et al. (2019) · IEEE/ASME International Conference on Advanced Intelligent Mechatronics · doi:10.1109/aim.2019.8868886 · Cited by 3
“In addition, Mesbahi and Egerstedt [5], Lin and Wang [6], Santos and Diaz-Mercado [7] have made achievements in swarm robots formation control and consistency issues [8].”
BackgroundGlobal Synchronization of Clocks in Directed Rooted Acyclic Graphs: A Hybrid Systems Approach
Javed, M. U., Poveda, J. I., & Chen, X. (2019) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc40024.2019.9029874 · Cited by 3
“Multi-agent networked systems have also been analyzed using graph-theoretic methods in [8], and geometric approaches in [9], [10].”
MethodThe Combined Estimator for Stochastic Equations on Graphs with Fractional Noise
Kříž, P., & Szała, L. (2020) · Mathematics · doi:10.3390/math8101766 · Cited by 3
Centrality-Weighted Opinion Dynamics: Disagreement and Social Network Partition
Gao, S. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683067 · Cited by 3
“normalized left eigenvector of L̄ that associated with the only zero eigenvalue λ1 = 0 (see for instance [40]).”
BackgroundAveraging and Cluster Synchronization of Kuramoto Oscillators
Kato, R., & Ishii, H. (2021) · European Control Conference (ECC) · doi:10.23919/ecc54610.2021.9655116 · Cited by 3
Event-Triggered ℓ2-Optimal Formation Control for Agents Modeled as LPV Systems
Saadabadi, H., & Werner, H. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683366 · Cited by 3
“Note that if G is undirected we have L = L T [35].”
BackgroundOn the Properties of Orthogonal Projection Method for Reaching Consensus
Agaev, R., & Khomutov, D. (2023) · Automation and Remote Control · doi:10.1134/s0005117923050028 · Cited by 3
Methods and Metrics for Human Interaction with Bio-Inspired Robot Swarms
Kerman, S. C. (2013) · ScholarsArchive (Brigham Young University) · Cited by 3
Distributed Online Topology Design for Disturbance Rejection
Chapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_4 · Cited by 3
Systematic dimensionality reduction for continuous-time quantum walks of interacting fermions
Izaac, J., & Wang, J. B. (2017) · Physical review. E · doi:10.1103/physreve.96.032136 · Cited by 5
Aggarwal, S., Goyal, J. K., Tr, S., Ghosh, S., Kamal, S., & Dworak, P. (2020) · IEEE Access · doi:10.1109/access.2020.3017012 · Cited by 3
“, N} is a finite nonempty set of vertices, then ε ⊂ V × V is a set of ordered pairs of vertices, called edges of the graph [22].”
BackgroundBavafa-Toosi, Y. (2017) · Elsevier eBooks · doi:10.1016/b978-0-12-812748-3.00010-0 · Cited by 3
Aminzare, Z., & Sontag, E. D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.7145 · Cited by 3
“We will use ideas from spectral graph theory, see for example [62].”
MethodAveraging Algorithms and Consensus
Ren, W. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_214 · Cited by 3
Analytic Hierarchy Process Based on Fuzzy Simulation
Ning, Y., Tang, W., & Zhang, Y. (2005) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzzy.2005.1452452 · Cited by 3
Stability and Controllability of Double Integrator Consensus Systems in Heterogeneous Networks
Goldin, D. (2013) · DepositOnce · doi:10.14279/depositonce-3768 · Cited by 3
Distributed Control of Inverter-Based Power Grids
Simpson-Porco, J. W. (2015) · eScholarship (California Digital Library) · Cited by 3
Advances and Applications of Multiple Scale Methods in Complex Dynamical Systems
Awad, A. (2017) · ResearchWorks at the University of Washington (University of Washington) · Cited by 3
Strong Structural Controllability of Systems on Colored GraphsPreprint
Jia, J., Trentelman, H. L., Baar, W., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.05580 · Cited by 3
“The spreading interest in social networks and biological systems have also contributed to this surge [1], [2], [3], [4].”
BackgroundDynamical Privacy in Distributed Computing -- Part I: Privacy Loss and PPSC MechanismPreprint
Liu, Y., Wu, J., Manchester, I. R., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.06966 · Cited by 3
“…control and optimization has become one of the central streams in the study of complex network operations, due to the rapidly growing volume and dimension of data and information flow from a variety of applications such as social networking, smart grid, and intelligent transportation [3].”
BackgroundNikou, A., Heshmati-Alamdari, S., Verginis, C. K., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.06070 · Cited by 3
“)k≤Likxi −yik, (4a) kfi(xi,¯xi) −fi(xi,y¯i)k≤L¯ik¯xi −¯yik, (4b) for all xi,yi ∈W,x¯i,¯yi ∈WNi,i∈V. Remark 2. The coupling terms fi(xi,x¯i),i ∈Vare encountered in a large set of multi-agent protocols [39], including consensus, connectivity maintenance, collision avoidance and formation control. In addition, (2) may re…”
BackgroundPequito, S., Kar, S., & Pappas, G. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.02764 · Cited by 3
“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].”
BackgroundProbabilistic Plan Synthesis for Coupled Multi-Agent SystemsPreprint
Nikou, A., Tůmová, J., & Dimarogonas, D. V. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01432 · Cited by 3
“[Mesbahi and Egerstedt, 2010] Let G = ( V , E ) be an undirected graph.”
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip AlgorithmsPreprint
Liu, Y., Wu, J., Manchester, I. R., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.00120 · Cited by 3
A Reinforcement Learning Framework for Sequencing Multi-Robot BehaviorsPreprint
Pierpaoli, P., Doan, T. T., Romberg, J., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.05731 · Cited by 3
“where w : R(2) × R(2) × Θ → R, often referred to as an edge weight function [24], depends on the states of robot i and its neighbors, and the parameter θ ∈ Θ.”
BackgroundSelf-citationControllability and Accessibility on Graphs for Bilinear Systems over Lie GroupsPreprint
Wang, X., Li, B., Li, J.-S., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.11929 · Cited by 3
“In the past decade, a new thriving line of research in control systems has involved the control of multiagent or networked systems, where subsystems are interconnected according to a graph representing the system interaction structure [20], [21], [24], [25].”
BackgroundNedić, A. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_219 · Cited by 3
Controlling Collective Behavior in Complex Systems
di Bernardo, M. (2020) · Encyclopedia of Systems and Control · doi:10.1007/978-1-4471-5102-9_100130-1 · Cited by 3
Averaging Algorithms and Consensus
Ren, W. (2014) · Springer eBooks · doi:10.1007/978-1-4471-5102-9_214-1 · Cited by 3
An interior-point method for topology identification and optimal design of noisy networks.Preprint
Hassan-Moghaddam, S., & Jovanović, M. R. (2015) · arXiv (Cornell University) · Cited by 3
Reaching Quantum Consensus with Directed Links: Missing Symmetry and Switching InteractionsPreprint
Shi, G., Fu, S., & Petersen, I. R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.5924 · Cited by 3
“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 [7]. Excellent results have been derived towards the understandings of how A preliminary version of this work will be p…”
BackgroundLageman, C., Helmke, U., & Anderson, B. D. O. (2018) · Automatica · doi:10.1016/j.automatica.2017.12.060 · Cited by 2
“, Fuhrmann and Helmke (2015) and Mesbahi and Egerstedt (2010). For instance, all eigenvalues of L have nonnegative real part. If Γ ′ is strongly connected and balanced, then the nonzero eigenvalues of L + L are positive and Ker(L + L) = R1. To define velocity consensus we use parallel transport on S1, i.e., the agents…”
BackgroundMethodInfluentialConsensus on Lie Groups for the Riemannian Center of Mass
Kraisler, S., Talebi, S., & Mesbahi, M. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10384031 · Cited by 2
“Next, by computing e ( A ⊗ I n ) t using the Jordan decomposition and taking the limit as t → ∞ we obtain that (see [21, Proposition 3.11] for a similar computation) Therefore, (13) converges as follows where w (0) = 0 Nn and x (0) is the arbitrary starting point.”
MethodInfluentialSelf-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.