By Topic

A General Alignment Repulsion Algorithm for Flocking of Multi-Agent Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hai-Tao Zhang ; Dept. of Control Sci. & Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Chao Zhai ; Zhiyong Chen

A novel individual-based alignment/repulsion algorithm is proposed in this note for a flock of multiple agents. With this algorithm, each individual repels its sufficiently close neighbors and aligns to the average velocity of its neighbors with moderate distances. In both mathematical analysis and numerical simulation, we prove that the algorithm guarantees an uncrowded flocking behavior with asymptotic velocity synchronization when sufficiently intensive communication exists within the agents. Moreover, we provide the conditions for collision avoidance along the whole transient procedure. The proposed flocking model has its references in natural collective behaviors like escaping panic and traffic jam motions.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 2 )