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 2,401–2,500 of 2,960
Topology Design and Identification for Dynamic Networks
Sun, C., & Dai, R. (2017) · doi:10.1002/9781119266235.ch8 · Cited by 1
Approximating Constrained Minimum Input Selection for State Space Structural ControllabilityPreprint
Moothedath, S., Chaporkar, P., & Belur, M. N. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.04608 · Cited by 1
“The costs associated with inputs play a vital role in selection preferences of various applications like (a) leader selection where certain agents are preferred over others for performing some specific task [2] or (b) optimal selection of key players in a social network for circulating information where the preference…”
BackgroundCombinations of adaptive filters.
Chamon, L. F. O. (2016) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2016.tde-14072016-143633 · Cited by 1
Model Predictive Control of Highway Emergency Maneuvering and Collision Avoidance
Jalalmaab, M. (2017) · UWSpace (University of Waterloo) · Cited by 4
Balanced Truncation of Networked Linear Passive SystemsPreprint
Cheng, X., Scherpen, J. M. A., & Besselink, B. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.03455 · Cited by 1
“, [17,23] for an overview).”
Laplacian Controllability of Threshold GraphsPreprint
Hsu, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.10667 · Cited by 1
“An immediate question is how the system leverages the network connectivity to ensure effective and efficient information propagation and complete assigned jobs? To set up a platform for the analysis, a frequently utilized measure is to consider the network from the perspective of a connected graph [8], namely, using t…”
BackgroundOptimal leader selection and demotion in leader-follower multi-agent systemsPreprint
Sato, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06479 · Cited by 1
“LEADER selection is an important issue in leader-follower multi-agent systems [1]–[4], which include, for example, vehicle formation control [5] and sensor networks [6].”
BackgroundConnectivity-Preserving Coordination Control of Multi-Agent Systems with Time-Varying DelaysPreprint
Yang, Y., Shi, Y., & Constantinescu, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.08152 · Cited by 2
“…matrix D N × M = [ δ hk ] of the graph is defined by δ hk = 1 if agent h is the head of e k , δ hk = − 1 if agent h is the tail of e k , and δ hk = 0 otherwise. graph The Laplacian and the incidence matrix obey [31]: L = DWD T , where W is a M × M diagonal matrix with w ( e k ) on its diagonal.”
BackgroundFormation control with binary informationPreprint
Jafarian, M., & Persis, C. D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.4893 · Cited by 1
“We refer to this agent as the leader ([29], [24]).”
Data Rates for Network Linear EquationsPreprint
Lei, J., Yi, P., Shi, G., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.03203 · Cited by 1
“Simultaneously, control theory has embraced to a much greater degree than previously graph theory, communication theory, and complexity analysis, leading to many celebrated results for both theories and applications [5].”
BackgroundScaling Submodular Optimization Approaches for Control Applications in Networked SystemsPreprint
Sathanur, A. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.02837 · Cited by 1
“Such systems consist of interacting entities that can be represented in general by a weighted graph [10].”
BackgroundDistributed L1-state-and-fault estimation for Multi-agent systemsPreprint
Hashimoto, K., Chong, M. S., & Dimarogonas, D. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.08756 · Cited by 1
“INTRODUCTION The problem of controlling multi-agent systems arises in many practical applications, such as vehicle platooning, formation control of autonomous vehicles and satellites, cooperative control of robots, power networks, to name a few [1].”
BackgroundTwo Models of Latent Consensus in Multi-Agent SystemsPreprint
Agaev, R., & Chebotarev, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.10430 · Cited by 1
“Every protocol (3) is obtained from (2) by adding an (n+ 1)st agent that influences the n agents of the system with intensity δ and is subjected to their influences whose intensities are given by the vector v.”
BackgroundConnectivity-Preserving Swarm Teleoperation With A Tree NetworkPreprint
Yang, Y., Constantinescu, D., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.08267 · Cited by 1
“The follows lemmas [51] will be used to verify connectivity preservation in Section III: Lemma 1.”
MethodLi, Q., Gao, W., Cheng, L., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.01128 · Cited by 1
“In addition, the equation (7d) represents the distributed estimation with least square method [10, 14].”
MethodDistributed Parameter Estimation Under Event-triggered CommunicationsPreprint
He, X., Liu, Q., Wu, J., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00048 · Cited by 1
Yi, X., Zhang, S., Yang, T., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.07022 · Cited by 1
“2 PRELIMINARIES In this section, we present some definitions in algebraic graph theory [20] and the considered multi-agent system.”
BackgroundRiemannian optimal identification method for linear systems with symmetric positive-definite matrixPreprint
Sato, K., Sato, H., & Damm, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.10379 · Cited by 1
“INTRODUCTION MANY important systems such as electrical network systems [1], multi-agent network systems [2], [3], and temperature dynamics in buildings [4], [5] can be expressed as { ̇̂ x(t) = Fx̂(t) +Gû(t), ŷ(t) = Cx̂(t), (1)”
BackgroundSubmodularity in Systems with Higher Order Consensus with Absolute InformationPreprint
Mackin, E., & Patterson, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.09156 · Cited by 1
“Since QS is symmetric positive definite for any S 6= ∅ and any values κi > 0 [28], it can be diagonalized by a unitary matrix U whose columns are the eigenvectors of QS .”
Generalizing Laplacian Controllability of PathsPreprint
Hsu, S., & Yang, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05671 · Cited by 1
“The Laplacian controllability problem of linear systems has been an active research topic in the past decade due to its important application in multiagent networks [11].”
BackgroundDistributed Convergence to Nash Equilibria in Two-Network Zero-Sum Games
Gharesifard, B., & Cortés, J. (2013) · Defense Technical Information Center (DTIC) · doi:10.21236/ada579430 · Cited by 2
Prescribed Performance Control for Signal Temporal Logic SpecificationsPreprint
Lindemann, L., Verginis, C. K., & Dimarogonas, D. V. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.07094 · Cited by 1
“:= min(r 1,...,rN) <ρθ(x,t) < ρmax:= min(ρ 1,max,...,ρN,max). VI. SIMULATIONS We consider a multi-agent system with single integrator dynamics in R2 and deploy the well known consensus protocol [21] with additional free inputs. The consensus protocol can be seen as the desire of the group to stay close to each o…”
MethodDeploying robots with two sensors in $K_{1,6}$-free graphsPreprint
Abbas, W., Egerstedt, M., Liu, C., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5450 · Cited by 1
“If G is a graph, f : V (G) → [5](2), and v ∈ V (G), then we say that v is satisfied with respect to f if ⋃ u∈N [v] f(u) = {1, 2, 3, 4, 5}.”
BackgroundMethodInfluentialSelf-citationH2 Optimal Coordination of Homogeneous Agents Subject to Limited Information ExchangePreprint
Madjidian, D., Mirkin, L., & Rantzer, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.05050 · Cited by 1
Clark, A., Alomair, B., Bushnell, L. G., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.4949 · Cited by 1
“Surveys of recent results can be found in [18] and [19].”
Efficient PageRank Computation via Distributed Algorithms with Web ClusteringPreprint
Suzuki, A., & Ishii, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09979 · Cited by 1
“In [16], [17], it was pointed out that the problem shares similarities with the multi-agent consensus problem [6], [24], and randomized distributed algorithms were developed.”
BackgroundTarget Locating in Unknown Environments Using Distributed Autonomous Coordination of Aerial Vehicles
Mohr, H. D. (2019) · VTechWorks (Virginia Tech) · Cited by 1
On Epidemic Spreading under Mobility on NetworksPreprint
Abhishek, V., & Srivastava, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.02647 · Cited by 1
“the network graph [9, 10, 10–12]. Authors in [13, 14] study network epidemic dynamics in discrete time setting. Several generalizations of the SIR/SIS models have been proposed including, SIER model [9, 15], where an additional classification “exposed” is introduced, SIRS [3, 14], where individuals get temporary immuni…”
MethodRLC Circuits based Distributed Mirror Descent MethodPreprint
Yu, Y., & Acikmese, B. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.06273 · Cited by 1
“If graph G is connected, the nullspace of E(G) is spanned by 1|V | [26].”
BackgroundGrand Challenges in Resilience: Autonomous System Resilience through Design and Runtime MeasuresPreprint
Bagchi, S., Aggarwal, V., Chaterji, S., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.11598 · Cited by 1
“Consensus is the basis of many distributed algorithms for computations [76, 117, 118], optimization [92, 23, 16], control [41, 36, 70] in multi-agent networks.”
BackgroundDistributed Algorithms that Solve Boolean Equation SystemsPreprint
Qi, H., Li, B., Jing, R.-J., et al. (2020) · arXiv (Cornell University) · Cited by 1
Lasso formulation of the shortest path problemPreprint
Dong, A., Taghvaei, A., & Georgiou, T. T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.09152 · Cited by 1
“, paths that begin and end at the same node, form a basis for the null space of the incidence matrix of the graph [14], [15].”
BackgroundMulti-agent formation control for target tracking and circumnavigation missions
Boccia, A. (2017) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 1
Initial-Value Privacy of Linear Dynamical SystemsPreprint
Wang, L., Manchester, I. R., Trumpf, J., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.10193 · Cited by 1
“, [24].”
Consensus of Multi-agent System via Constrained Invariant Set of a class of Unstable SystemPreprint
Ong, C. J., & Hou, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.06236 · Cited by 1
“See for example (Mesbahi and Egerstedt, 2010; Lin and Ren, 2014; Nedić et al., 2010; Scardovi and Sepulchre, 2009; Ren, 2008; Wieland et al., 2011) and references therein.”
BackgroundLiu, C., Liao, Z., & Ferrari, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.06021 · Cited by 1
“ctical applications, sensors form local groups where sensors within the same group can communicate with each other via single or multiple hops, i.e., the communication network forms a connected graph [27]. RESIN is run within each group. As it will become clear in later sections, RESIN can well handle the dynamic chan…”
BackgroundMinimal controllability problems on linear structural descriptor systemsPreprint
Terasaki, S., & Sato, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04159 · Cited by 1
“ctural controllability, large-scale system, descriptor system, DM decomposition I. INTRODUCTION Controllability, which was introduced by [1], for network dynamical systems such as multi-agent systems [2], brain networks [3], and power networks [4] has received considerable research attention. In the simplest case, sys…”
BackgroundA Probabilistic Guidance Approach to Swarm-to-Swarm Engagement ProblemPreprint
Uzun, S., & Üre, N. K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.01928 · Cited by 1
“3) Transition Constraints: The transition between two bins is represented by an edge of a directed graph, where the adjacency matrix of the directed graph is defined similar to the second section of [22].”
BackgroundDecentralized State-Dependent Markov Chain Synthesis with an Application to Swarm GuidancePreprint
Uzun, S., Üre, N. K., & Acikmese, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.02303 · Cited by 1
“Consensus protocols, in contrast to Markov chains, operate without the limitations of nonnegative valued nodes and edge weights or the requirement for the sum of the values of the nodes is equal to one [18].”
BackgroundDistributed Algorithms that Solve Boolean Equations with Local and Differential PrivaciesPreprint
Qi, H., Li, B., Jing, R.-J., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.08064 · Cited by 1
“is a standard average consensus algorithm [29].”
Fully Distributed Optimization based CAV Platooning Control under Linear Vehicle DynamicsPreprint
Shen, J., Kammara, E. K. H., & Du, L. (2021) · arXiv (Cornell University) · doi:10.13016/m29fwp-jwcg · Cited by 1
“By leveraging portable computing capability of each vehicle, distributed computing is a favorable option because it has potentials to be more adaptive to different platoon network topologies, be more robust to network malfunctions, and accommodate for communication delays effectively [12, 21].”
Distributed Neighbor Selection in Multi-agent NetworksPreprint
Shao, H., Pan, L., Mesbahi, M., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.12022 · Cited by 1
“A common assumption in this line of work is that each agent interacts with all its neighbors; however, there may exist interactions that degrade the overall convergence rate, i.e., the responsiveness of the multi-agent network [1], [2], [3], [29].”
BackgroundSelf-citationStructural Controllability on Graphs for Drifted Bilinear Systems over Lie GroupsPreprint
Wang, X., Li, B., Li, J.-S., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.12915 · Cited by 1
“The past decade has witnessed an important line of research for multi-agent systems where agents, representing subsystems with distributed sensing and control units, are dynamically interconnected over an underlying network in order to achieve collective goals such as consensus, formation, coverage, and controllabilit…”
BackgroundCoordination on Time-Varying Antagonistic NetworksPreprint
Zhang, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.03854 · Cited by 2
“, [1,2]) cannot be immediately applicable to setup (2.”
BackgroundEvent-Triggered Control for Weight-Unbalanced Directed NetworksPreprint
Pabon, J. D., Cardona, G. A., Ospina, N. I., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.09609 · Cited by 1
“According to [19, Theorem 2.12], if we choose the connections among the reference robot and other robots such that in the directed graph D formed by all robots, including the reference robot, this robot is chosen as the root of D .”
BackgroundInfluentialFrom data and structure to models and controllers
van Waarde, H. J. (2020) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.33612/diss.144254461 · Cited by 3
Garg, K., Baranwal, M., Hero, A. O., & Panagou, D. (2019) · arXiv (Cornell University) · Cited by 2
Modal Strong Structural Controllability for Networks with Dynamical NodesPreprint
Mousavi, S. S., Kouvelas, A., & Johansson, K. H. (2021) · arXiv (Cornell University) · doi:10.3929/ethz-b-000504151 · Cited by 4
“In the two last decades, a surge of interest in studying networks of dynamical systems has arisen in both the control and network communities [1].”
BackgroundGraph type expressivity and transformations.Preprint
Thomas, J. M., Beddar-Wiesing, S., Moallemy-Oureh, A., & Nather, R. (2021) · arXiv (Cornell University) · Cited by 3
Event-triggered Consensus of Matrix-weighted Networks Subject to Actuator SaturationPreprint
Pan, L., Shao, H., Li, Y., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.13356 · Cited by 1
“INTRODUCTION C ONSENSUS problem on matrix-weighted networks is becoming a recent concern since, as an immediate generalization of scalar-weighted networks, they naturally captures interdependencies among higher-dimensional states of neighboring agents in a multi-agent network [1], [2], [3], [4], [5], [6].”
BackgroundJovanović, M. R. (2014) · Encyclopedia of Systems and Control · doi:10.1007/978-1-4471-5102-9_221-1 · Cited by 1
Cortés, J. (2020) · Springer eBooks · doi:10.1007/978-1-4471-5102-9_211-2 · Cited by 1
Traffic Signal Consensus Control
Lafferriere, G. (2019) · doi:10.15760/trec.221 · Cited by 1
Swarm Shedding in Networks of Self-propelled AgentsPreprint
Hindes, J., Edwards, V., Kasraie, K. S., et al. (2021) · Research Square · doi:10.21203/rs.3.rs-199565/v1 · Cited by 1
Dynamic Graphs, Connectivity of
Kantaros, Y., Zavlanos, M. M., & Pappas, G. J. (2020) · Encyclopedia of Systems and Control · doi:10.1007/978-1-4471-5102-9_213-2 · Cited by 1
Differentially Private Distributed Inference for Multicenter Clinical StudiesPreprint
Papachristou, M., & Rahimian, M. A. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4726578 · Cited by 1
Consensus for Linear Time-Varying Multi-agent Systems via Event-Triggered CommunicationPreprint
Chi, W., Zhang, X., Wang, H., et al. (2024) · Preprints.org · doi:10.20944/preprints202407.0331.v1 · Cited by 1
On the dynamics of linear functional differential equations with asymptotically constant solutions
Somarakis, C., Baras, J. S., & Paraskevas, E. (2014) · University Libraries (University of Maryland) · doi:10.13016/m2cc7h · Cited by 1
“Systems of the type of (1.10) are known from the control community as linear distributed agreement (consensus) dynamics and in the un-delayed case (τ = 0) are treated with Algebraic Graph Theory methods [23] and form the core of Networked Control Theory [24].”
MethodInfluentialVision-based control of unmanned aerial vehicles
Tang, Z. (2021) · doi:10.70675/f90d5cf8z75e6z4b6fzbc4bz8589cda08298 · Cited by 1
Collaborative source-seeking control
Fabbiano, R. (2015) · theses.fr (ABES) · doi:10.70675/75d9ace5zca6dz4568z9605z6d79e061bc41 · Cited by 1
“agent systems and distributed control in general; we do not aim to give here an exhaustive overview of the main contributions, and we refer to the seminal books [5, 13, 32, 48, 63].”
A travelling wave approach to a multi-agent system with a path-graph topologyPreprint
Martinec, D., Herman, I., & Šebek, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.0474 · Cited by 1
“A popular tool for the convergence analysis of multi-agent systems comes from the algebraic graph theory, for instance, the spectral properties of the Laplacian matrix, see [20], [25] and [27] for a thorough overview.”
Collective Transport via Sequential Caging
Varadharajan, V. S., Soma, K., & Beltrame, G. (2022) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-92790-5_27 · Cited by 4
“This formulation is inspired from the commonly used edge potential to preserve a lattice structure among the robots [12].”
MethodChapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_2
Control Strategies for Guided Collective Motion
Ghose, D. (2015) · Defense Technical Information Center (DTIC) · doi:10.21236/ada617908
Failure Analysis in Multi-Agent Networks: A Graph-Theoretic Approach
Rahimian, M. A. (2012) · Spectrum Research Repository (Concordia University)
Controllability and Observability of Circulant Networks
Nabi-Abdolyousefi, M. (2014) · Springer theses · doi:10.1007/978-3-319-02429-5_5
Approximate feedback solutions for differential games. Theory and applications
Mylvaganam, T. (2014) · Spiral (Imperial College London) · doi:10.25560/24975 · Cited by 2
Controllability Gramian, Symmetry Structures, and Application of Circulant Networks
Nabi-Abdolyousefi, M. (2014) · Springer theses · doi:10.1007/978-3-319-02429-5_6
Consensus with reduced communication links via relative neighboring velocity information
Torre, G. D. L., & Yucelen, T. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171859
“In this section, we recall some of the basic notions from graph theory and networked multiagent systems (refer to [5], [15] for additional details), and introduce terminology used throughout the paper.”
BackgroundA feedback control method for the stabilization of a nonlinear diffusion system on a graph
Yu, X. G., Xu, C., & Lin, Q. (2014) · Chinese Physics B · doi:10.1088/1674-1056/23/8/080206
“In addition, in the system control and control community, the multi-agent system is now a quite popular research topic to study a group of smart agents which have protocols to its neighbors in the sense of connectivity.[4,5] Collective behaviors, such as consensus and flocking, can be explained using the theoretical r…”
BackgroundDominating neighbourhood observers for fault reconstruction
Menon, P. P., & Edwards, C. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170845
“Applications involving multiple, mostly identical dynamical systems, often connected over an information network, are reported in [14], [6], [10].”
BackgroundA Nonlinear Consensus Algorithm Derived from Statistical PhysicsPreprint
Margaliot, M., Raveh, A., & Zarai, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.7248
“This seems to be motivated both by the theoretica l challenges in analyzing systems with limited and time-vary ing communication between the agents, and numerous applicatio ns including mobile sensor networks and distributed aerospac e systems [16].”
BackgroundDistributed consensus networks of neutral type
Somarakis, C., & Baras, J. S. (2015) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2015.7158893
“Due to its applicability in diverse fields of the control and the applied science communities, this algorithm has been extensively studied under numerous significant variations.”
BackgroundInfluentialExploitation of Heterogeneity in Distributed SensingPreprint
Peterson, J., Yucelen, T., Chowdhary, G. V., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.05298
“We first recall some of the basic notions from graph theory and refer to [3], [22] for further details.”
BackgroundForwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree GraphsPreprint
Gripon, V., Skachek, V., & Rabbat, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.2936
“These include efficient broadcast of code updates in networks of embedded wireless sensing and/or control devices [12, 13] and content dissemination in mobile social networks [9].”
BackgroundAverage consensus in symmetric nonlinearly coupled delayed networks
Proskurnikov, A. V. (2013) · European Control Conference (ECC) · doi:10.23919/ecc.2013.6669171
“The right-hand side of this inequality exceeds that of (7) since π/2 > 1 and λmax < 2 ∑N k=1 ajk by the Gershgorin theorem [8].”
BackgroundStatic Consensus in Passifiable Linear Networks
Junussov, I. (2016) · International Journal of Differential Equations · doi:10.1155/2016/9192127
“Control of multi-agent systems has attracted significant interest in last decade since it has a great technical importance [6, 21, 22, 23] and relates to biological systems [24].”
BackgroundReaching Market Equilibrium Merely by Bilateral BartersPreprint
Flåm, S. D. (2013) · SSRN Electronic Journal · doi:10.2139/ssrn.2371222
Convergence Tools for Consensus in Multi-Agent Systems with Switching TopologiesPreprint
Thunberg, J., & Xiaoming Hu, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.5220
“The field of networked and multi-agent systems has received growing interest from researchers within robotics and control theory during the last decade [16].”
Consensus and Formation Control on SE(3) for Switching TopologiesPreprint
Thunberg, J., Goncalves, J., & Hu, X. (2015) · arXiv (Cornell University) · doi:10.17863/cam.16969
The Evolution of Network Entropy in Classical and Quantum Consensus DynamicsPreprint
Fu, S., Shi, G., Petersen, I. R., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.07621
“…of a group of interconnected nodes can asymptotically reach the average value of their initial states via neighboring node interactions and simple distributed control rule [3, 2, 4], which forms a foundational block for the further development in the broad range of control of network systems [5].”
InfluentialYong, W., Guiming, L., & Hu, H. (2015) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2015.7260782
Kashima, K., Takahashi, Y., & Imura, J. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.05.057
A cluster control of nonlinear network systems with external inputs
Ryono, K., & Oguchi, T. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130904-3-fr-2041.00208
Aggregation and rendezvous in an unbounded domain without a shared coordinate system
Rogers, B. W., Fricke, G. K., & Garg, D. P. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161458
“Proof: It suffices to show that two agents in intersecting regions will sense each other in finite time.”
BackgroundDecentralized Finite-Time Stabilizing Feedback Network Control
Zhao, Y. (2012) · doi:10.1115/dscc2012-movic2012-8553
“This property can be used for checking the stability of certain nonlinear systems, and designing novel network control protocols based on homogeneous system theory.”
BackgroundZelazo, D., & Allgöwer, F. (2012) · doi:10.1109/cdc.2012.6425921
“The authors are with the Institute for Systems Theory and Automatic Control, University of Stuttgart, Pfaffenwaldring 9, 70550 Stuttgart, Germany, {daniel.zelazo, frank.allgower}@ist.uni-stuttgart.de. protocol [4].”
BackgroundMethodConstrained agreement protocols for tree graph topologies
Chipalkatty, R., & Egerstedt, M. (2012) · International Journal of Control · doi:10.1080/00207179.2012.656288
“…in embedded physical systems like mobile robots or UAVs, to distributed computer networks, e.g. Tanner, Jadbabaie, and Pappas (2000), Ren and Beard (2004), Dimarogonas and Kyriakopoulos (2007), Olfati-Saber and Murray (2003), Jadbabaie, Lin, and Morse (2003) and Mesbahi and Egerstedt (2010).”
BackgroundInfluentialSelf-citationDiscussion on: “Control and navigation in manoeuvres of formations of unmanned mobile vehicles”
Mylvaganam, T. (2013) · European Journal of Control · doi:10.1016/j.ejcon.2013.03.007
Cosby, J. A., Shtessel, Y. B., & Bordetsky, A. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580250
“The adjacency matrix, A(G), of graph G is a symmetric matrix containing the adjacency relationships of each node in graph G [6] ,[7].”
BackgroundDynamic graph-based search in unknown environments
Haynes, P. S., Alboul, L., & Penders, J. (2011) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2011.06.004
Robust Synchronization of Nonlinear Agents over Directed Communication Graph
Takaba, K. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120620-3-dk-2025.00167
Establishing connectivity in proximity networks
Dai, R., Maximoff, J., & Mesbahi, M. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315299
Self-citationDistributed estimation for spatial rigid motion based on dual quaternions
Zu, Y., Sun, C., & Dai, R. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039403
Multiscale Dynamics and Thermodynamics in Spaces Equipped with Contact Structure
Grmela, M. (2013) · IFAC Proceedings Volumes · doi:10.3182/20130714-3-fr-4040.00004
Analysis on consensus-like protocol for multi-agent system
Ibrahim, A. R., Adiprawita, W., & Trilaksono, B. R. (2013) · International Conference on Robotics, Biomimetics, Intelligent Computational Systems (ROBIONETICS) · doi:10.1109/robionetics.2013.6743583
Minimum-energy distributed consensus of uncertain agents
Zamani, M., Shames, I., & Ugrinovskii, V. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039608
“see [5], [9], [11] and the references there-in), the problem of reaching consensus in the presence of disturbances is not fully addressed.”
On the internal dynamics of formations of unicycle robots
Consolini, L., Morbidi, F., Prattichizzo, D., et al. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5717188
“Over the past few years multi-agent systems and cooperative control have been the subject of vigorous research in the robotics and control communities [1], [2].”
BackgroundAdaptive distributed Kalman filters for a class of continuous time finite dimensional linear systems
Heydari, M., & Demetriou, M. A. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7331106
“Additionally, we let L = D−A be the Laplacian matrix of G, where D is the degree matrix and A is the adjacency matrix [6], [12] .”
Bayesian hybrid estimation of LTI networked systems using finite set statistics
Hussein, I. I., Sorrentino, F., & Erwin, R. S. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6579869
“For basics of networked systems and graph theory, please refer to [30], [31].”
Background
Metadata
- Authors
- Mesbahi, M., & Egerstedt, M.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 2010-12-31
- OpenAlex
- W613360614
- Cited by
- 2,897
- References
- 0
- Citations by year
- 2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
- FWCI
- 74.30
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Princeton University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.