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,501–2,600 of 2,960
Coordinated Control for Multiple Autonomous Underwater Vehicles
Hertzberg, N. A. (2014)
Further results on a class of nonlinear protocols in networked systems
Emadi, H., Srivastava, V., Vaidya, U., et al. (2014) · Australian Control Conference · doi:10.1109/aucc.2014.7358702
Forgetting in the Synchronization of Quantum NetworksPreprint
Fu, S., Shi, G., & Petersen, I. R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.03322
“The analysis of quantum consensus seeking was further developed using the graphical methods for studying classical network systems [4], and it was shown that the vectorized density operator evolving along quantum consensus dynamics is equivalent to a number of parallel classical consensus dynamics ∗S.”
MethodResilient Coordination of Networked Multiagent Systems Based on Distributed State EmulatorsPreprint
Yucelen, T., & Torre, G. D. L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.3967
“We next recall some of the basic notions from graph theory and networked multiagent systems [10,11].”
BackgroundControl Problems Involving Mixed-Integer Decision Making
Prodan, I., Stoican, F., Olaru, S., & Niculescu, S. (2015) · Springer briefs in electrical and computer engineering · doi:10.1007/978-3-319-26995-5_4
Control of Multiagent FormationsPreprint
Tran, D. M., & Yucelen, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.05219
“1 INTRODUCTION Current distributed control methods (see, for example, [1, 2, 3] and references therein) have a lack of information exchange infrastructure to enable spatially evolving multiagent form ations.”
BackgroundMethod3D coordinated path following with disturbance rejection for formations of under-actuated agents
Belleter, D. J. W., & Pettersen, K. Y. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402009
“Graph theory [20] is used to model the communication.”
BackgroundMethodPorting Code Across Simple Mobile RobotsPreprint
Lin, Y., Mitra, S., & Li, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.00619
“1for making a collection of robots form a regular polygon. The design goal for this language is to make robot programming faster, more abstract, cleaner, and closer to high-level textbook pseudo-code [21,8]. The result would be programs that are also easier to debug and verify. Two key features of StarL are a distribu…”
BackgroundOn the construction of local interaction rules that perform global linear computation
Costello, Z., Ruths, J., & Egerstedt, M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402606
Self-citationDistributedconvergencetoNashequilibriain two-networkzero-sumgames ⋆
Gharesifard, B., & Cortés, J. (2012)
Distributed Line Search for Multiagent Convex Optimization
Cortés, J., & Martínez, S. (2015) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-20988-3_6
“Building on consensus-based coordination rules [2, 14, 13, 10], the aforementioned efforts lead to discrete-time schemes employing function subgradients.”
BackgroundSwitching Between Linear Consensus~Protocols: A Variational ApproachPreprint
Ron, O., Margaliot, M., & Branicky, M. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.2399
“I NTRODUCTION There is an increasing interest in distributed control and coordination of networks consisting of multiple autonomou s agents [2].”
BackgroundLow-dimensional Functional Observer Design for Large-scale Linear Systems
Sadamoto, T., Ishizaki, T., & Imura, J. (2014) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.50.478
Knock-out Structure Identification of Linear Networks
Suzuki, M., Takatsuki, N., Imura, J., & Aihara, K. (2014) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.50.118
de, M. M., & Rossi, L. F. (2014) · Conference on Artificial Life (ALIFE) · doi:10.1162/978-0-262-32621-6-ch152
Model Reduction of Dynamical Networks Based on Cluster Controllability
Ishizaki, T., Kashima, K., Imura, J., et al. (2012) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.48.589
Hierarchical Decentralized Observer Design and Application to Power Networks
Koike, M., Ishizaki, T., Sadamoto, T., et al. (2014) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.27.353
Consensus Protocols in Networked Multiagent Systems for Cluttered and Hostile Environments
Torre, G. D. L., Yucelen, T., & Johnson, E. N. (2013) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2013-4801
OPTIMAL LEADER-FOLLOWER FORMATION CONTROL USING DYNAMIC GAMES
Shahraki, O. D. (2015)
Nagarji, J., & Arya, H. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.03.160
Saturation-tolerant average consensus with controllable rates of convergence
Kia, S. S., Cortés, J., & Martı́nez, S. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973273.17
“The literature is by now vast and populated with works that explore a wide variety of aspects of the algorithm, both in continuous and discrete time, see [12, 5, 1] and references therein.”
BackgroundA Self-stabilizing Cellular Automata Model For Pulse-coupled Biological Oscillators.Preprint
Lyu, H. (2014)
Discrete-time distributed state feedback control for multi-robot systems
Marino, A., & Pierri, F. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487746
“However, in the presence of limited communication capabilities, for example in the case of vehicles with a short communication range, a decentralized strategy is a desirable feature and, sometime, the only possible [3].”
BackgroundObtaining consensus of singular multi-agent linear dynamic systems
Planas, G., & Isabel, M. (2016) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Distributed formation for large swarm of agents
Reza, H. (2013) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/54754
“It has been shown [124],[142], that the blanched and strong connectivity are necessary and sufficient conditions for reaching the average consensus in networks with directed topology.”
BackgroundBackground on Control 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_4
Proskurnikov, A. V. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.09.221
“This motivated further refinements of this criterion, among which the Popov stability criterion (Popov [1973], Gelig et al.”
MethodRobust consensus of discrete-time linear agents over deterministic uncertain channels
Li, Z., & Chen, J. (2016) · International Conference on Control and Automation · doi:10.1109/icca.2016.7505393
“The incidence matrix, denoted by D = [dij ] ∈ RN×M , is defined as dij = −1 if vi is the tail of (i, j), dij = −1 if i is the head of (i, j), and dij = 0 otherwise [24].”
BackgroundAnalyzing network dynamics through graph partitioning
Shuo, Z. (2014) · University of Groningen research database (University of Groningen / Centre for Information Technology)
A decentralized consensus algorithm for distributed state observers with robustness guarantees
Li, Y., & Sanfelice, R. G. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525192
“Static consensus, which corresponds to the agreement on the initial conditions of the agents, modeled via a directed graph, are reported in [8], [9], [10].”
BackgroundPerformance Study of Fuzzy Based Networked Control System
Kumar, D., Singh, Y., & Kaur, G. (2011)
A hierarchical control approach for average consensus over heterogeneous multi-agent systems
Yutao, T. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554565
“, n} and the edge set E (without self-loops) ([22]).”
BackgroundSynchronization of networked Euler-Lagrange systems via set-ISS: A separation approach
Zhang, F., Guo, H., Zhang, S., et al. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554564
“Indeed, distributed coordination problems, for example consensus/synchronization and formation control, have been extensively studied, see [4, 5] and the references therein.”
BackgroundFinite-time distributed observers for position and velocity estimation in vehicle formations
Zhao, Y., Pang, B., Ye, F., & Zhang, W. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554561
“A induced subgraph [15] of G is given by GS = (S, ES), where S ⊆ V , ES = {(vi, vj) ∈ E|vi, vj ∈ S}.”
BackgroundDOCTEUR DE L'UNIVERSITÉ DE GRENOBLE
Tran, T.-M.-D. (2015)
Graph-Theoretic Algorithms for Monitoring and Control of Large Networked Dynamic Systems.
Nudell, T. R. (2014) · NCSU Libraries Repository (North Carolina State University Libraries)
Control of Multi-Agent Networks: From Network Design to Decentralized Coordination
Twu, P. (2012) · SMARTech Repository (Georgia Institute of Technology)
The problem of almost global consensus on the n-spherePreprint
Markdahl, J., Thunberg, J., & Gonçalves, J. M. (2016) · arXiv (Cornell University)
Synchronization Patterns in Networks of Nonlinear Systems with Time-delayed Couplings
Oooka, K., & Oguchi, T. (2016) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.52.376
Minimum sensitivity realizations of networks of linear systems
Helmke, U., & Schnlein, M. (2016) · Numerical Algebra Control and Optimization · doi:10.3934/naco.2016010
Rendezvous Control of a Mobile Robot System with Quantized Sensing
Inoue, D., Azuma, S., & Sugie, T. (2016) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.29.311
“ま た ui(k)∈Rは各ロボットの入力であり, u1(k)=f1(Q(x2(k)−x1(k))) u2(k)=f2(Q(x1(k)−x2(k))) (6)”
InfluentialA Matrix Inequality Concerning Weakly Connected and
Shang, Y. (2015)
Alpcan, T. (2015)
Pattern control for networks of Ginzburg-Landau oscillators via Markov Decision Processes
Chapman, A., Schoof, E., & Mesbahi, M. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798534
“Multiple balanced states have been characterized for cycles of oscillators, or more generally for circulant networks running the Kuramoto dynamics [7], [8].”
BackgroundSelf-citationZhang, H., Wei, J., Yi, P., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.07475
Bio-inspired Cooperative Optimal Trajectory Planning For Autonomous Vehicles
Remeikas, C. (2013) · Journal of International Crisis and Risk Communication Research
Somarakis, C., Paraskevas, E., Baras, J. S., et al. (2016)
Sparsity-promoting optimal control of power networks
Wu, X. (2016) · University of Minnesota Digital Conservancy (University of Minnesota)
Consensus analysis of systems with time-varying interactions : An event-triggered approachPreprint
Kumar, S., Chowdhury, N. R., Srikant, S., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.00537
“The augmented dynamics of the system can be written in terms of the state vectors (5) Taking cue from Zelazo and Mesbahi (2011), Mesbahi and Egerstedt, 2010, p. 77-81 we transform the consensus problem of equation (5) into a stabilization problem by considering the edge states instead of node…”
InfluentialEdge deletion algorithm for minimally rigid graph using consensus protocols
Bae, Y., Lim, Y., & Ahn, H. (2017) · IEEE International Conference on Industrial Technology (ICIT) · doi:10.1109/icit.2017.7915458
Distributed Finite Time Termination of Consensus in the Presence of DelaysPreprint
Prakash, M., Talukdar, S., Attree, S., Yadav, V. K., & Salapaka, M. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.00021 · Cited by 1
“Increasingly in applications, the size of the system imposes severe restrictions on resources that include computational capacity as well as communication bandwidth [3].”
BackgroundTop-Down Synthesis of Multi-Agent Formation Control: An Eigenstructure Assignment based ApproachPreprint
Motoyama, T., & Cai, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.04851
“Cooperative control of multi-agent systems has been an active research area in the systems control community [1], [2], [3].”
BackgroundOn the stability and convergence of a class of consensus systems with a nonlinear inputPreprint
Liu, M., Wirth, F. R., Corless, M., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.01430
“For a discussion of conditions used in this area we refer the reader to [1,14,15].”
An Overview of Recent Progress in the Study of
Cao, Y., Yu, W., Ren, W., et al. (2012)
The gap between necessity and sufficiency for stability of sparse matrix systems: simulation studies
Yang, T. (2015) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Distributed optimal steady-state regulation in linear multi-agent systems
Tang, Y. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028709
“The following lemma is well-known [20].”
Asynchronous edge-event-triggered synchronization of coupled harmonic oscillators with quantization
Dai, M., Xiao, F., & Wei, B. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028692
“The edge Laplacian matrix is denoted by LE = DD [34].”
Yamauchi, J., Kizaki, K., Ibuki, T., et al. (2017) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2017.8062487
“INTRODUCTION Cooperative control in multi-agent systems gains huge interests in these decades [1], [2], [3], thanks to technological innovation and information technology such as small, cheap mobile robots or sensors, and low computational costs.”
BackgroundEdge potential residuals in low-complexity aggregation behaviors
Pierpaoli, P., Vu, T. T., & Rahmani, A. (2017) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2017.8062678
“Proof: [4] The centeroid of the swarm is defined as x̂ = 1/n ∑n i=1 xi, its velocity: 1 n 1 T ẋ = − 1 n 1 T DW (x)D x.”
BackgroundInfluentialQureshi, M. U., & Grijalva, S. (2017) · International Conference on Intelligent System Application to Power Systems (ISAP) · doi:10.1109/isap.2017.8071412
“One of the properties of graph Laplacian L is to preserve the inherent network topology, and henceforth, the required information exchange within a network [14].”
BackgroundMethodAggregate State Control of Large-Scale Systems via Networked Controllers
Sakurama, K. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.445
Controllable Graphs with Small Sums of Diameters and Maximum Vertex Degrees
Hsu, S. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.062
Adaptive control for multi-agent systems with vanishing coupling gains
Wei, B., Xiao, F., & Dai, M. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.413 · Cited by 1
Iterative Learning Control of Multi-agent Systems
Владимирович, П. П., & Emelianova, J. (2017) · International Workshop on Multidimensional (nD) Systems (nDS) · doi:10.1109/nds.2017.8070624
“See [4], [5], [15] for more details.”
Sakurama, K. (2017) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2017.8105540
“From (2), (4), (5), and (10), the first term of (13) is derived as E[(ȳ(t))(2)] = E[(1 x̄(t))(2)] ≤ α1(E[(y(0))(2)] + (σ∗)2)(max{|ω1|2, |ω2|(2)}) (14) where x̄(t) = E[x(t)|x̄∗, S∗].”
Formation Control for Mobile Robots with Saturated Driving
Ichihara, H., & Nakano, K. (2017) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.30.395
H∞ & H2 almost state synchronization with full-state coupling for homogeneous multi-agent systems
Stoorvogel, A. A., Saberi, A., Zhang, M., et al. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264568
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1], [4], [11], [22] and references therein).”
BackgroundDesign Theory of Distributed Controllers via Gradient-Flow Approach
Sakurama, K., Azuma, S.-I., & Sugie, T. (2018) · Lecture notes in control and information sciences - proceedings · doi:10.1007/978-3-319-67068-3_23
Optimal Graph LaplacianPreprint
Sato, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06482
“1) where x(t) 2Rn and L 2R n denote the state and graph Laplacian, respectively; e.g., system (1) includes biochemical systems [1, 2, 3, 4], synchronization systems [5, 6, 7], and multi-agent systems [8, 9, 10]. The graph Laplacian L is determined by the connection relationship of edges of a given graph (i.e., the net…”
BackgroundAll Graphs are S^n-Synchronizing; What About St(p, n)?Preprint
Markdahl, J., Thunberg, J., & Gonçalves, J. M. (2018) · arXiv (Cornell University)
Quantitative analysis of passive systems interconnected on graphs
Inoue, M., & Urata, K. (2018) · Nonlinear Theory and Its Applications IEICE · doi:10.1587/nolta.9.185
“We further suppose that L = Lg is a Laplacian matrix that is associated with a strongly connected undirected graph [14].”
BackgroundBounded Connectivity-Preserving Coordination of Networked Euler-Lagrange SystemsPreprint
Yang, Y., Constantinescu, D., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.00333
“The communications of the Euler-Lagrange network are described by its communication graph [22]: D.”
BackgroundTime-constrained multi-agent task scheduling based on prescribed performance controlPreprint
Yu, P., & Dimarogonas, D. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.10018
“This level of centralized knowledge can be attained offline and is typical in many multi-agent approaches for less complex problems than the one in hand [20].”
BackgroundRiemannian optimal system identification method of linear continuous-time systems with symmetryPreprint
Sato, K., Sato, H., & Damm, T. (2018) · arXiv (Cornell University)
Sun, Z., & Sugie, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.02832
“Another important matrix representation of a graph G is the Laplacian matrix L(G) [17].”
BackgroundLearning and Decision Making in Groups.
Rahimian, M. A. (2017) · ScholarlyCommons (University of Pennsylvania)
Control over networks with fading communication channels
Xu, L. J. (2018) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/73184
“For detailed reference to graph theory, please refer to [118, 119].”
BackgroundRobust Pinning Synchronization of Complex Network with Non-linear Coupling using Switching Control
Mishra, J. P., Jalili, M., & Yu, X. (2018) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2018.8351137
“G(G ) is a rank deficient matrix and positive semi-definite always [27].”
BackgroundNonovershooting Cooperative Output Regulation for Linear Multi-Agent SystemsPreprint
Schmid, R., & Aghbolagh, H. D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.02340
“Graph theory [22] has been widely used to describe the topology of networked systems by means of vertices and edges.”
MethodZhai, S., & Zheng, W. X. (2018) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2018.8351498
Synchronization over stochastically switching networks with imperfect prior information
Takaba, K. (2014) · Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications · doi:10.5687/sss.2014.246
“For the last several years, multi-agent coordinations have been attracting a great attention in the area of systems and control, since such phenomena can be encountered in many applications in physics, biology, robotics, computer science, etc (see e.g. [1],[2] and the references therein).”
BackgroundDistributed Hybrid Control Synthesis for Multi-Agent Systems from High-Level Specifications
Guo, M., Boskos, D., Tůmová, J., et al. (2018) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-78449-6_12
A Graph-Theoretic Analysis of Distributed Replicator DynamicPreprint
Bansode, P., Deshpande, A., & Singh, N. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.07369
“Hence the fitness dynamic (8) resembles an agreement protocol [24].”
BackgroundChapman, A. (2015) · Springer theses · doi:10.1007/978-3-319-15010-9_3
Liu, Z., Zhang, M., Saberi, A., et al. (2018) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2018.8407937
Foight, D. R., Narang-Siddarth, A., & Mesbahi, M. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430945
“In §IV, the method is applied to model the dynamics of a non-homogeneous satellite constellation being controlled though a leader-follower control scheme [14].”
MethodSelf-citationLiu, Z., Zhang, M., Saberi, A., et al. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430841
Zhang, M., Saberi, A., & Stoorvogel, A. A. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431706
Dynamical Tuning for Multi-objective MPC Controllers
Barreiro‐Gomez, J. (2018) · Springer theses · doi:10.1007/978-3-319-92204-1_3
Approximation-based Transient Behavior Analysis of Multi-Agent Systems with Delay
Fehér, Á., & Márton, L. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.07.216
Global Network Prediction from Local Node DynamicsPreprint
O'Clery, N., Yuan, Y., Stan, G.-B. V., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.00409
“Such analysis is critical in the field of distributed and cooperative robotics, where teams of autonomous robots or vehicles must co-ordinate their movement, and respond to external stimuli (10).”
BackgroundConvergence Analysis of Signed Nonlinear NetworksPreprint
Chen, H., Zelazo, D., Wang, X., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.11274
“network model captures the celebrated consensus, or Laplacian, dynamics over graphs [24].”
BackgroundDistributed economic control of dynamically coupled networksPreprint
Lu, Y., & Zhu, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.06583
“The entities of CPSs are spatially distributed and thus distributed coordination becomes necessary to achieve network-wide goals [7, 29, 50].”
BackgroundA resource sharing model in a power packet distribution network
Ando, H., Takahashi, R., Azuma, S., et al. (2018) · International Power Electronics Conference (IPEC) · doi:10.23919/ipec.2018.8507603
Hybrid Planning and Control for Multiple Fixed-Wing Aircraft under Input Constraints
Garg, K., & Panagou, D. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-0655
Moothedath, S., Chaporkar, P., & Belur, M. N. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550254
“Selection preferences are important in many applications, like leader selection where certain agents are preferred over others for performing some specific tasks [7] and this can be captured as cost associated with the input.”
BackgroundRobust synchronization of linear multi-agent systems with additive uncertainty
Trentelman, H. L., & Takaba, K. (2012) · University of Groningen research database (University of Groningen / Centre for Information Technology)
Esmaeilpour, M. (2018) · Spectrum Research Repository (Concordia University)
Consensus-based Moment Allocator for Distributed Nonlinear Actuators onboard a Conceptual SUAS
Mark, A., Xu, Y., & Dickinson, B. T. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-1160
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.