Samenvatting
Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multi-agent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.
| Originele taal-2 | Engels |
|---|---|
| Titel | Proceedings of the IEEE International Conference on Automation and Logistics 2009 (ICAL '09), 5-7 August 2009, Shenyang, China |
| Plaats van productie | China, Shenyang |
| Pagina's | 955-960 |
| Status | Gepubliceerd - 2009 |