Name
Abstract | ||
|---|---|---|
A recent paper by some of the authors introduced several self-triggered coordination algorithms for first-order continuous-time systems. The extension of these algorithms to second-order agents is relevant in many practical applications but presents some challenges that are tackled in this contribution and that require to depart from the analysis that was carried out before. We design a self-triggered gossiping coordination algorithm that induces a time-varying communication graph, which is enough connected to guarantee useful convergence properties, and allows us to achieve the desired coordination task in a formation of double-integrator agents that (i) establish pair-wise communication at suitably designed times and (ii) exchange relative measurements while reducing the sensing and communication effort. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/CDC.2013.6761064 | Decision and Control |
Keywords | Field | DocType |
continuous time systems,convergence,graph theory,multi-robot systems,time-varying systems,convergence properties,coordination task,double-integrator agent formation,first-order continuous-time systems,gossiping second-order agents,pair-wise communication,relative measurement exchange,self-triggered gossiping coordination algorithm,self-triggered rendezvous,time-varying communication graph | Convergence (routing),Graph theory,Graph,Control theory,Computer science,Gossip,Rendezvous,Distributed computing | Conference |
ISSN | ISBN | Citations |
0743-1546 | 978-1-4673-5714-2 | 4 |
PageRank | References | Authors |
0.48 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| De Persis, C. | 1 | 114 | 10.52 |
| Paolo Frasca | 2 | 408 | 35.99 |
| Julien M. Hendrickx | 3 | 772 | 77.11 |