This paper formulates and solves a version of the widely studied Vicsek consensus problem in which each member of a group of n>1 agents independently updates its heading at times determined by its own clock. It is not assumed that the agents' clocks are synchronized or that the "event"times between which any one agent updates its heading are evenly spaced. Nor is it assumed that heading updates must occur instantaneously. Using the concept of "analytic synchronization" together with several key...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Automatic Control|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.