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 2,601–2,700 of 2,960
Cooperative Dynamic Domain Reduction
Ma, A., Ouimet, M., & Cortés, J. (2019) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-05816-6_35
Continuous-Time Opinion Dynamics with Interdependent Topics
Ye, M. (2019) · Springer theses · doi:10.1007/978-3-030-10606-5_9
Dynamic Social Networks: Exponential Forgetting of Perceived Social Power
Ye, M. (2019) · Springer theses · doi:10.1007/978-3-030-10606-5_6
Secure distributed filtering for unstable dynamics under compromised observationsPreprint
He, X., Ren, X., Sandberg, H., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07345
Liu, Z., Saberi, A., Stoorvogel, A. A., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.05794
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [1, 7, 9, 11, 13, 17, 24] and references therein).”
BackgroundMethod of agents’ state estimation in multiresolution multiagent simulation
Pierzchała, D., & Czuba, P. (2019) · Computer Science and Mathematical Modelling · doi:10.5604/01.3001.0013.1460
“If a topology was dynamic, a set of neighbors would be dependent on time [16].”
BackgroundInfluentialGlobal Synchronization of Clocks in Directed Rooted Acyclic Graphs: A Hybrid Systems ApproachPreprint
Javed, M. U., Poveda, J. I., & Chen, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.03566
“Multi-agent networked systems have also been analyzed using graph-theoretic methods in [8], and geometric approaches in [9], [10].”
MethodStoorvogel, A. A., Saberi, A., Liu, Z., et al. (2019) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4563
“This communication topology of the network can be described by a weighted graph associated with (2), with the ai j being the coefficients of the weighting matrix .”
BackgroundHuntsman, S. (2021) · Studies in computational intelligence · doi:10.1007/978-3-030-65351-4_34
“re path planning and mobile ad hoc networks (MANETs) [28]. While networks are inevitably analyzed from the perspective of graph theory [3], path planning may be considered in either graph-theoretical [31] or continuous settings. Meanwhile, because geometrical considerations such as distance and motion strongly in uenc…”
Consensus Control for Leader-follower Multi-agent Systems under Prescribed Performance GuaranteesPreprint
Chen, F., & Dimarogonas, D. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.12771
“The graph Laplacian of G is L = ∆− A.”
BackgroundInfluentialTraffic Signal Consensus Control
Lafferriere, G. (2019) · doi:10.15760/trec.213
“…sensor networks (Das & Mesbahi, 2009) (Ren, Beard, & Atkins, 2007); and vulnerability of networked synchronization processes (Dhal, Lafferriere, & Caughman, 2016)(see also the books (Mesbahi & Egerstedt, 2010), (Bullo, Cortés, & Martínez, 2009), and (Ren & Beard, 2008) for many other references).”
Accelerated Distributed Primal-Dual Dynamics using Adaptive SynchronizationPreprint
Bansode, P., Kosaraju, K. C., Wagh, S. R., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.00837
An Hourglass-Shaped Architecture for Model-Based Development of Networked Cyber-Physical Systems
Tariq, M. U., & Wolf, M. C. (2019) · Springer eBooks · doi:10.1007/978-3-030-13050-3_3
Ribosome Flow Model on a RingPreprint
Raveh, A., Zarai, Y., Margaliot, M., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1508.03796
“Remark 1 It is possible also to give a simple and selfcontained proof of Corollary 1 using standard tools from the literature on consensus networks [30].”
BackgroundMethodDiffusion and consensus on weakly connected directed graphsPreprint
Veerman, J. J. P., & Kummel, E. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.09846
Broadcast Gossip Algorithms for Consensus on Strongly Connected DigraphsPreprint
Shaochuan, W., & Rabbat, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.4895
“G OSSIP algorithms are an attractive solution for information processing in applications such as distributed signal processing [1], networked control [2], and multi-robot systems [3].”
BackgroundContainment Control for a Social Network with State-Dependent ConnectivityPreprint
Kan, Z., Klotz, J. R., Pasiliao, E. L., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.5644
“P [26] and [27]) is widely used to represent a networked system.”
Static consensus in passifiable linear networksPreprint
Junussov, I. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.7274
“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].”
BackgroundRobotic Swarm Control from Spatio-Temporal SpecificationsPreprint
Haghighi, I. M., Sadraddini, S., & Belta, C. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.06283
“resembles given spatio-temporal behaviors. An illustrative case study is included. I. INTRODUCTION Robotic swarms have received a lot of attention from the robotics research community in recent years [1]. Large teams of robots are suitable for a broad range of applications such as distributed task allocation [2], area…”
BackgroundOn the Dynamics of Deterministic Epidemic Propagation over NetworksPreprint
Mei, W., Mohagheghi, S., Zampieri, S., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03137
“In [15], the stability of equilibria for the SEIR model is reviewed through Lyapunov and graph theory.”
MethodReaching Agreement in Quantum Hybrid NetworksPreprint
Shi, G., Li, B., Miao, Z., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.02824
“From the computational side, solving the Bellman equation (1) relies on recursively along the equation (1) computing C(x, t) (and therefore obtain the optimal σ⁎ x ( ) t ) from C(x, t + 1) for all = − .”
BackgroundMethodInfluentialFailure Detection and Isolation in Integrator NetworksPreprint
Rahimian, M. A., & Preciado, V. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.5401
“Multi-agent network systems have found promising applications in areas such as motion coordination of robots [1].”
BackgroundResilient Consensus of Second-Order Agent Networks: Asynchronous Update Rules with DelaysPreprint
Dibaji, S. M., & Ishii, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03430
“In particular, we follow the approach generally assumed in asynchronous consensus for the case without malicious agents; see, e.g., (Mesbahi and Egerstedt 2010, Su et al. 1998, Xiao and Wang 2006) for single-integrator networks and (Lin and Jia 2009, Liu and Liu 2012, Qin and Gao 2012, Qin et al.…”
BackgroundInfluentialOptimal k-Leader Selection for Coherence and Convergence Rate in One-Dimensional NetworksPreprint
Patterson, S., McGlohon, N., & Dyagilev, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.07094
“Since G is connected, Lff is positive definite [26].”
BackgroundOutput Average Consensus Over Heterogeneous Multi-Agent Systems via Two-Level ApproachPreprint
Tang, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.00528
“Associated with these multi-agent systems, a digraph G = {V , E , A} is defined with node set N = { 1 , ..., N } to describe the communication topology (see [11] for details).”
Visibility maintenance via controlled invariance for leader-follower Dubins-like vehiclesPreprint
Morbidi, F., Bullo, F., & Prattichizzo, D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.6127
“…of connectivity maintenance in multiagent networks, the literature has experienced a recent spurt of growth (we refer to (Bullo et al., 2009; Mesbahi and Egerstedt, 2010) for recent surveys on this topic): two typical multi-agent tasks requiring network connectivity are “consensus” (Moreau,…”
Comparison of the approximation methods for time-delay systems: application to multi-agent systems
Fehér, Á., & Márton, L. (2019) · Hungarian Journal of Industry and Chemistry · doi:10.33927/hjic-2019-11
(2019) · Hungarian Journal of Industry and Chemistry · doi:10.33927/854
Connectivity-Preserving Swarm Teleoperation Over A Tree Network With Time-Varying DelaysPreprint
Yang, Y., Shi, Y., & Constantinescu, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.07668
“where x = (x1 · · · xN−1) = (WD ⊗ In)x with xk = ∇iψ(‖xij‖) for ek = (i, j), k = 1, · · · , N − 1, stacks the weighted displacements between all pairs of adjacent slaves (i, j) ∈ E(0) [48].”
InfluentialPerformance Improvement via Iterative Connection of Passive Systems
Urata, K., Inoue, M., Ishizaki, T., et al. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2930806
An Iterative Distributed Approach for Optimal Power Dispatch in a Smart Grid Environment
Naina, P. M., & Swarup, K. S. (2018) · National Power Systems Conference · doi:10.1109/npsc.2018.8771839
“The adjacency matrix [10] of a graph has all the same information that contained in the graph.”
BackgroundReachability analysis and optimal control for epidemic spreading model on multiplex network
Prakash, M. V. S., Mahindrakar, A. D., & Pasumarthy, R. (2019) · Indian Control Conference · doi:10.1109/indiancc.2019.8715623
Control de formaciones sobre regiones objetivo de sistemas multi-agente lagrangianos con retardo
Aranda‐Escolástico, E., Guinaldo, M., Colombo, L. J., & Dormido, S. (2019) · Jornadas de Automática · doi:10.17979/spudc.9788497497169.655
“El interés por el control distribuido para múltiples veh́ıculos y dispositivos robóticos ha ido creciendo en las últimas décadas en las comunidades de control y robótica [4, 12, 16, 17].”
BackgroundFormation Control for Multi-agent Systems by Using Self-equilibrium Condition
MASUDA, Y., & NAGASE, K. (2015) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.51.744
Distributed Control of Multiagent Systems with Heterogeneity in Synchronization Roles
Sarsılmaz, S. B., Yucelen, T., & Oswald, T. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814743
“We now concisely state the graph theoretical notation used throughout this paper, which is based on [10] and [11].”
MethodOn the Trade-Off Between Communication and Execution Overhead for Control of Multi-Agent Systems
Li, A., & Egerstedt, M. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814318
“First, it is an important proxy for a large number of commonly studied multi-agent problems such as formation controls and distributed estimation [10].”
BackgroundMethodInfluentialSelf-citationStoorvogel, A. A., Saberi, A., Liu, Z., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814978
“The objective of synchronization is to secure asymptotic agreement on a common state or output trajectory through decentralized control protocols (see [2], [11], [17], [20] and references therein).”
BackgroundKhamvilai, T., Sutter, L., Féron, É., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.06313
“The considered parallel computing platform is represented by a directed simple graph G = (V,E), where V is the set of vertices and E ⊆ { (x, y) ∈ V 2 | x 6= y } is the set of edges [13].”
MethodDistributed Control for Group Assignment of Multi-agent Systems
Sakurama, K., & Ahn, H. (2019) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2019.8859894
“Actually, distributed controllers have been designed for various multi-agent tasks, including consensus [1, 2], formation [3, 4], flocking [5], coverage [6], pursuit [7], and so on [8, 9].”
BackgroundDistributed PI Control of Active-Passive Networked Linear Multi-agent Systems
Wu, Z., Xiong, Y., & Li, Z. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865314
“Lemma 1 ([17]) The spectrum of Laplacian matrix L of an undirected and connected graph G can be ordered as 0 = λ1(L) < λ2(L) ≤ · · · ≤ λN (L).”
A Multi-robot Cooperative Control Strategy for Non-linear Entrapment Problems
Sebastián, E., & Montijano, E. (2019) · IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) · doi:10.1109/etfa.2019.8869099
“Due to the strong mathematical component of this problem, geometric tools, distributed control and graph theory are the base of the solutions [11].”
BackgroundControllability of discrete-time heterogeneous multi-agent systems with time-delay
Li, C., Ping, Y., Liu, B., et al. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865419
Distributed Fixed-Time Economic Dispatch under Time-Varying Topology and Uncertain Information.Preprint
Baranwal, M., Garg, K., Panagou, D., et al. (2019) · arXiv (Cornell University)
Wang, L., Zou, Y., & Meng, Z. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8900000
“Motivated by [12], matrices M1 and M2 are positive definite provided that graph G is connected.”
BackgroundInfluentialProbabilistic Connectivity of Random Graphs and Their UnionsPreprint
Bjorkman, B., Hale, M., Lamkin, T. D., et al. (2019) · arXiv (Cornell University)
Leader-following Discrete-time Bipartite Consensus on Signed Networks
Pan, L., Shao, H., Xi, Y., et al. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899929
“The consensus problem has been extensively examined by assuming that agents in the network intend to cooperate with their neighboring agents, namely, only positively weighted edges are allowed in the network [2], [17], [13], [4].”
BackgroundClustering as a means of leader selection in consensus networksPreprint
Basimova, N., & Chebotarev, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.00437
“gents often need to move to a landmark or target point while maintaining the shape of their formation. The leader-follower approach is one of the ways to solve this type of formation control problems [3]. Recently, several methods of solving the problems of choosing leaders in networked multi-agent systems have been s…”
BackgroundGraph-Theoretic Analyses of MIMO Channels in Diffusive Networks
Koorehdavoudi, K., & Roy, S. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919659
“In the literature, the graph-theoretic analysis of network dynamics has largely focused on internal modal behaviors (including stability and stabilization notions) [10]–[13], input-to-state properties such as controllability [10], [14], and state-to-output properties such as observability [10],”
BackgroundMinimum Laplacian controllability of graphs based on interconnecting two classes of threshold graphs
Yang, P., Hsu, S., & Tsai, C.-H. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919877
“Significant work has been done to leverage the simple and scalable systems to solve the problems in a complicated network composed of computers, vehicles, robots, power generators, and so on [3].”
BackgroundBhowmick, S., Halo, B., & Panja, S. (2019) · IEEE Region 10 Conference (TENCON) · doi:10.1109/tencon.2019.8929278
“Regular unsigned graphs [3] can suitably represent the agents and their interactions in such cases.”
BackgroundAdaptive Stepsize Rule for Consensus Optimization by Supervisory Control Architecture
Kusunoki, Y., Hayashi, N., Hatanaka, T., & Tatsumi, K. (2019) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.32.338
On the Controllability of Matrix-weighted NetworksPreprint
Pan, L., Shao, H., Mesbahi, M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.04035
“Consensus protocol plays a vital role in cooperative control of multi-agent networks, ensuring asymptotic alignment on the states of the agents required for accomplishing a global task via local interactions [32], [33], [34], [35].”
BackgroundSelf-citationIto, H., & Miyagi, Y. (2019) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas47443.2019.8971714
Mechanical Acoustic Signal Assisted Translational Model for Industrial Human-Machine Interaction
Ji, Z., Chen, C., He, J., & Guan, X. (2019) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip45357.2019.8969468
Sato, H., & Sato, K. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9030228
“Systems that are described by (1) are practically important research objects because they include, for example, electrical networks [3], [17], [19], multi-agent networks [11], [12], and temperature dynamics in buildings [5], [10].”
BackgroundNetworked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems
Pallottino, L. (2020) · Springer eBooks · doi:10.1007/978-3-030-35032-1_3
Passivity-based Pose Synchronization under Disturbances in Three Dimensions
Yamauchi, J., Doi, M., Ibuki, T., et al. (2019) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.55.808
Coupled Control Systems: Periodic Orbit Generation with Application to Quadrupedal LocomotionPreprint
Ma, W.-L., Csomay-Shanklin, N., & Ames, A. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.08507
Multi-agent Payload Manipulation and Transportation\\ using Small Scale Quadrotor Platforms
Miesen, T. J. (2019) · ResearchWorks at the University of Washington (University of Washington)
Guided Policy Improvement for Satisfying STL Tasks using Funnel AdaptationPreprint
Várnai, P., & Dimarogonas, D. V. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.05653
“(53) The matrix L is the so-called Laplacian of the graph describing agent connections within the consensus protocol [Mesbahi and Egerstedt, 2010]; assuming a complete graph it takes the form: L =”
BackgroundOn the Optimal Interaction Range for Multi-Agent Systems Under Adversarial AttackPreprint
Saleh, S. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.06562
Dyshlovoi, I. N. (2020) · Drukerovskij vestnik · doi:10.17213/2312-6469-2020-1-341-352
Nojavanzadeh, D., Liu, Z., Saberi, A., et al. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9188478
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory by local interaction among agents (see [1, 18, 33, 44] and references therein).”
BackgroundWan, W., Kim, H., Cheng, Y., et al. (2020) · AIAA AVIATION Forum · doi:10.2514/6.2020-2621
RetractedA dynamical approach to efficient eigenvalue estimation in general multiagent networks
Hayhoe, M., Barreras, F., & Preciado, V. M. (2022) · Automatica · doi:10.1016/j.automatica.2022.110234
“…a network of interacting dynamical agents provides a wealth of global information about the network structure and function; see, e.g., Fiedler (1973); Mohar et al. (1991); Merris (1994); Chung and Graham (1997); Preciado (2008); Mesbahi and Egerstedt (2010); Bullo (2019), and references therein.”
BackgroundHaddad, W. M., & Chahine, M. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147540
“Consensus control protocols over static and dynamic information exchange topologies involve neighbor-to-neighbor interactions, wherein agents update their information state based on the information states of the neighboring agents, and have predominately relied on algebraic graph theory [8], [9].”
BackgroundControl Allocation Consensus among onboard Actuators with a Directed/Undirected Graph Topology
Mark, A., Xu, Y., & Dickinson, B. T. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147672
“, i i D L i r is positive semi-definite [15].”
BackgroundNonasymptotic Connectivity of Random Graphs and Their Unions
Bjorkman, B., Hale, M., Lamkin, T. D., Robinson, B. D., & Thompson, C. A. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3013715
“We utilize the first order statistic of the set of nontrivial eigenvalues to bound the expected value of the Laplacian’s second-smallest eigenvalue, called the algebraic connectivity [16] of the underlying union graph.”
BackgroundMethodInfluentialNon-Asymptotic Connectivity of Random Graphs and Their UnionsPreprint
Bjorkman, B., Hale, M., Lamkin, T. D., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.05606
“A broad survey of graph-theoretic results for control can be found in [23], and well-known graph-theoretic results in optimization include [2], [26], [40].”
BackgroundMethodInfluentialDistributed Observer Approach for Scalable Formation Control of Multi-Agent Network
Djamari, D. W., & Fikri, M. R. (2020) · International Seminar on Intelligent Technology and Its Applications · doi:10.1109/isitia49792.2020.9163689
“The convergence of the above dynamics is well-known, see for example Theorem 3.12 in [24].”
BackgroundInfluentialMaximizing the algebraic connectivity in multilayer networks with arbitrary interconnectionsPreprint
Tavasoli, A., Ardjmand, E., & Shakeri, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.13036 · Cited by 4
“, 2011), engineering (Buldyrev et al., 2010; Mesbahi and Egerstedt, 2010), and sport game (Buldú et al.”
BackgroundGeneric Controllability of Undirected Networks of Relative Coupling Identical Systems
Zhang, Y., Xia, Y., & Gao, H. C. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9188764
“Related research topics on relative coupling networks include synchronization, consensus, stability, as well as controllability and observability [2–5].”
BackgroundDistribution of Control Effort in Multi-Agent Systems : Autonomous systems of the world, unite!
Axelson-Fisk, M. (2020) · Uppsala University Publications (Uppsala University)
On Distributed Control of Multiagent Systems under Adverse Conditions
Yildirim, E. (2019) · Digital Commons - University of South Florida (University of South Florida)
Microgrid State Estimation and IoT: Modelling Concepts and Design AlgorithmPreprint
Alavi, S. A., Javadipour, M., & Mehran, K. (2020) · doi:10.36227/techrxiv.13138991.v1
Consensus-Based Set-Theoretic Control in Inverter-Dominated Power SystemsPreprint
Tabas, D., & Zhang, B. (2020) · arXiv (Cornell University)
Consensus-Based Set-Theoretic Control in Power SystemsPreprint
Tabas, D., & Zhang, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04361
“The algorithm can be interpreted as a consensus routine where each bus iteratively compares information with its neighbors to reach an agreement on the state coupling disturbance sets at time t = −k− 1 [16].”
MethodDistributed Fault Detection in Formation of Multi-Agent Systems with Attack Impact Analysis
Biyooki, A. A. (2019) · Spectrum Research Repository (Concordia University)
Classifying Malware Using Function Representations in a Static Call Graph
Dalton, T., Schmidtler, M., & Khodabakhshi, A. H. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-66046-8_20
“Graphs have been successfully utilized in analyzing data from a wide variety of domains including social network link prediction [11], protein-protein interactions [1], and communication networks [12].”
MethodControlling symmetries and clustered dynamics of complex networksPreprint
Gambuzza, L. V., Frasca, M., Sorrentino, F., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.11122
“CONTROL of complex networks is a challenging problem in many applications such as transport networks, power grids, wireless sensor networks, multi-robot teams, epidemics, social and biological systems [1], [2].”
BackgroundResilient Self/Event-Triggered Consensus Based on Ternary ControlPreprint
Matsume, H., Wang, Y., & Ishii, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.13158
“In such systems, a number of agents form a network over which they communicate with each other using wired or wireless channels and individually make decisions to achieve their global objectives [1].”
BackgroundNojavanzadeh, D., Liu, Z., Saberi, A., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.14032
“The objective of synchronization is to secure an asymptotic agreement on a common state or output trajectory by local interaction among agents (see [1], [10], [19], [24] and references therein).”
BackgroundDistributed Control of Mobile LTI and LPV Agents Using Induced L2 to L∞ Norms
Hespe, C., Datar, A., & Werner, H. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9303864
Network Lyapunov Functions for Epidemic Models
Newton, M., & Papachristodoulou, A. (2020) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc42340.2020.9304021
“In this paper, the type of compartmental model used is the Susceptible-Exposed-Infected-Recovered (SEIR) model, with notation taken from [9].”
BackgroundMethodInfluentialPrimal-dual $\varepsilon$-Subgradient Method for Distributed OptimizationPreprint
Zhu, K., & Tang, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.02880
“Note that L is symmetric and positive semi-definite with its ordered eigenvalues as 0 = λ 1 λ 2 ≤ . . . λ N under Assumption 2 by Theorem 2.8 in [17].”
BackgroundInfluentialImmunity-based Consensus Algorithm for Increased Resilience in Multiagent Missions
Diana, F., & Moncayo, H. (2021) · AIAA SciTech Forum · doi:10.2514/6.2021-0398
Analysis of Structural Properties of Complex and Networked Systems
Jia, J. (2020) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.33612/diss.136303707
Consensus on state-dependent fuzzy graphs
Mahmoud, M. S., Oyedeji, M. O., & Xia, Y. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821186-1.00014-3
Cyber-Attack Detection in Discrete Nonlinear Multi-Agent Systems Using Neural NetworksPreprint
Mousavi, A., Aryankia, K., & Šelmić, R. R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.01166
“Multi-agent systems can be modelled with a weighted directed graph [24].”
BackgroundDistributed consensus on state-dependent evolutionary graphs
Mahmoud, M. S., Oyedeji, M. O., & Xia, Y. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821186-1.00015-5
Control óptimo distribuido para un sistema de microrredes
Quiroga, O., & Melissa, C. (2020)
Delay resilient networked control with application to microgrids
Alavi, S. A., Li, X., & Mehran, K. (2021) · Elsevier eBooks · doi:10.1016/b978-0-32-385347-7.00007-9
Vlahakis, E. E., & Halikias, G. D. (2021) · International Journal of Control · doi:10.1080/00207179.2021.1893822
“Many significant results in this direction have made use of systems and control theory along with algebraic tools from graph theory (Mesbahi & Egerstedt, 2010).”
BackgroundRelaxed bearing rigidity and bearing formation control under persistence of excitationPreprint
Tang, Z., Cunha, R., Hamel, T., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.06024
“…problem involving relative position measurements, the graph Laplacian matrix L := H̄>H̄, with H̄ = H ⊗ Id (3) is adopted in any distributed control law design aiming to drive the configuration p to the desired one up to translation Euclidean vector (Mesbahi & Egerstedt (2010), Oh et al. (2015)).”
BackgroundProbabilistic Stabilizability Certificates for a Class of Black-Box Linear Systems
Fabiani, F., Margellos, K., & Goulart, P. J. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3083962
“…col ( D F , D I ) , with D F ∈ R n F ×| E | and D I ∈ R m ×| E | , thus leading to the following (possibly constrained) DT LTI dynamics characterizing the floating node states x F : = col (( x i ) i ∈ N F ) ∈ X F [20] x F where and ¯ w ∈ W is the vector of nominal weights associated with the links.”
BackgroundNeural-Network-Based Collaborative Control for Continuous Unknown Nonlinear Systems
Gao, S., & Wang, X. (2021) · Discrete Dynamics in Nature and Society · doi:10.1155/2021/5535971
Coordinated Decentralized Estimation Over Random Networks
Nabi-Abdolyousefi, M. (2014) · Springer theses · doi:10.1007/978-3-319-02429-5_9
“More details on this section are presented in [9], [16].”
BackgroundAccessibility of Bilinear Interconnected Systems
Rüppel, F. (2014)
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.