Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms
From MaRDI portal
Publication:1679085
DOI10.1016/j.automatica.2017.06.021zbMath1373.93038OpenAlexW2733650984MaRDI QIDQ1679085
Karl Henrik Johansson, Weiguo Xia, Zi Yang Meng, Guo-Dong Shi
Publication date: 8 November 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.06.021
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Robust consensus of multi-agent systems with diverse input delays and asymmetric interconnection perturbations
- Synchronization in networks of identical linear systems
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Fast linear iterations for distributed averaging
- Consensus in networked multi-agent systems with adversaries
- SLOWER IS FASTER: FOSTERING CONSENSUS FORMATION BY HETEROGENEOUS INERTIA
- Matrix Analysis
- The Byzantine Generals Problem
- Optimization and Analysis of Distributed Averaging With Short Node Memory
- Consensus and Cooperation in Networked Multi-Agent Systems
- On topology and dynamics of consensus among linear high-order agents
- Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays
- 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
- Flocking in Fixed and Switching Networks
- Distributed multi‐vehicle coordinated control via local information exchange
- State Agreement for Continuous‐Time Coupled Nonlinear Systems
- State consensus for multi-agent systems with switching topologies and time-varying delays
This page was built for publication: Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms
