A new condition for asymptotic consensus over switching graphs
DOI10.1016/j.automatica.2018.07.018zbMath1406.93018OpenAlexW2887056865WikidataQ129383584 ScholiaQ129383584MaRDI QIDQ1716493
Debasish Chatterjee, Nilanjan Roy Chowdhury, Srikant Sukumar
Publication date: 5 February 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.07.018
Linear systems in control theory (93C05) Decentralized systems (93A14) Control/observation systems governed by ordinary differential equations (93C15) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Agent technology and artificial intelligence (68T42)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
- Necessary and sufficient conditions for consensus in nonlinear monotone networks with unilateral interactions
- An internal model principle is necessary and sufficient for linear output synchronization
- Synchronization in networks of identical linear systems
- Stabilizing switching signals: a transition from point-wise to asymptotic conditions
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Consensus of output-coupled high-order linear multi-agent systems under deterministic and Markovian switching networks
- Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
- Distributed consensus of multi-agent systems with general linear node dynamics and intermittent communications
- Continuous-Time Consensus Under Non-Instantaneous Reciprocity
- Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
- Stabilizing Switching Signals for Switched Systems
- Robust Output Synchronization of a Network of Heterogeneous Nonlinear Agents Via Nonlinear Regulation Theory
- Distributed reliable H ∞ consensus control for a class of multi-agent systems under switching networks: A topology-based average dwell time approach
- Necessary and Sufficient Consensus Conditions of Descriptor Multi-agent Systems
- A note on basic consensus problems in multi-agent systems with switching interconnection graphs
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Optimal Design for Synchronization of Cooperative Systems: State Feedback, Observer and Output Feedback
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
This page was built for publication: A new condition for asymptotic consensus over switching graphs