Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction
By Yongcan Cao, Wei Ren. 2010
158 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Control and Systems Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Control and Systems Engineering
Citations in the corpus
- An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, methodology): “Various approaches, including Lyapunov functions [130], [134], matrix theory [118], [135], [138], [139], stochastic matrices [136], and linear matrix inequalities [133], [134], have been adopted, and some necessary and/or sufficient conditions have been derived for guaranteeing sampled-data consensu”
- Consensus of multi‐agent systems with nonlinear dynamics and sampled‐data information: a delayed‐input approach (2013, methodology): “Some sufficient conditions were derived on the interaction graph, the damping gain, and the sampling period to guarantee coordination by using some properties of infinite products of stochastic matrices [21].”
- Consensus of multi-agent systems with intrinsic nonlinear dynamics and sampled-data information (2011, methodology): “In [18], two sampled-data-based coordination algorithms were proposed and analyzed for multi-vehicle systems with linear second-order dynamics under dynamic directed interaction.”