Delay-induced discrete-time consensus
From MaRDI portal
Publication:1679876
DOI10.1016/j.automatica.2017.07.059zbMath1375.93004OpenAlexW2754589503MaRDI QIDQ1679876
Publication date: 22 November 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.07.059
Related Items
A new method for generating chaotic system with arbitrary shaped distributed attractors ⋮ Synchronization of fractional chaotic complex networks with delays
Cites Work
- Consensus networks with switching topology and time-delays over finite fields
- Distributed consensus-based estimation considering network induced delays and dropouts
- Multi-agent consensus with diverse time-delays and jointly-connected topologies
- Distributed consensus for multi-agent systems with delays and noises in transmission channels
- On the cluster consensus of discrete-time multi-agent systems
- Delay robustness in consensus problems
- Leader-following consensus of second-order agents with multiple time-varying delays
- Stochastic consensus seeking with communication delays
- Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
- Forced consensus in networks of double integrator systems with delayed input
- Consensus protocols for discrete-time multi-agent systems with time-varying delays
- Consensus conditions for general second-order multi-agent systems with communication delay
- Non-negative matrices and Markov chains.
- Computing a graph's period quadratically by node condensation
- Global consensus for discrete-time multi-agent systems with input saturation constraints
- Average consensus in networks with nonlinearly delayed couplings and switching topology
- Consensus in the network with uniform constant communication delay
- Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
- Distributed Optimization Over Time-Varying Directed Graphs
- Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Reaching a Consensus
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Structural Balance and Opinion Separation in Trust–Mistrust Social Networks
- State consensus for multi-agent systems with switching topologies and time-varying delays