Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
