Abstract:
All agents being informed and the virtual leader traveling at a constant velocity are the two critical assumptions seen in the recent literature on flocking in multi-agen...Show MoreMetadata
Abstract:
All agents being informed and the virtual leader traveling at a constant velocity are the two critical assumptions seen in the recent literature on flocking in multi-agent systems. Under these assumptions, Olfati-Saber in a recent IEEE Transactions on Automatic Control paper proposed a flocking algorithm which by incorporating a navigational feedback enables a group of agents to track a virtual leader. This paper revisits the problem of multi-agent flocking in the absence of the above two assumptions. In an earlier part, Part I, of this paper, we showed that, even when only a fraction of agents are informed, the Olfati-Saber flocking algorithm still enables all the informed agents to move with the desired constant velocity, and an uninformed agent to also move with the same desired velocity if it can be directly or indirectly influenced by the informed agents during the evolution. This part, Part II, of the paper considers the situation where the virtual leader travels with a varying velocity. In particular, we propose modification to the Olfati-Saber algorithm and show that the resulting algorithm enables the asymptotic tracking of the virtual leader. That is, the position and velocity of the center of mass of all agents will converge exponentially to those of the virtual leader. The convergent rate is also given.
Published in: 2007 46th IEEE Conference on Decision and Control
Date of Conference: 12-14 December 2007
Date Added to IEEE Xplore: 21 January 2008
ISBN Information:
Print ISSN: 0191-2216