This paper deals with a refined analysis and modification of existing results on the flocking algorithms proposed for the second order dynamic agents. In the present work, the limiting condition of ever connectivity is removed and it is proved that the flocking can be reached if only the union of the network proximity graphs during nonoverlapping time intervals becomes connected frequently enough. Also, it is proved that including a static virtual leader cannot model the group objective of achieving the desired velocity and it will stop eventually at a predefined point in the space. The convergence rate to this fixed point is determined too. The last contribution of this paper is definition of group configuration when only a fraction of agents are informed about the virtual leader.
Theoretical Analysis of Flocking Algorithms in Networks of Second Order Dynamic Agents With Switching Topologies
Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received November 9, 2012; final manuscript received September 11, 2013; published online October 10, 2013. Assoc. Editor: Prashant Mehta.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Atrianfar, H., and Haeri, M. (October 10, 2013). "Theoretical Analysis of Flocking Algorithms in Networks of Second Order Dynamic Agents With Switching Topologies." ASME. J. Dyn. Sys., Meas., Control. January 2014; 136(1): 011013. https://doi.org/10.1115/1.4025456
Download citation file:
- Ris (Zotero)
- Reference Manager