By Topic

A connectivity-preserving flocking algorithm for multi-agent dynamical systems with bounded potential function

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 $31
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

5 Author(s)
Wen, G. ; State Key Lab. for Turbulence & Complex Syst., Peking Univ., Beijing, China ; Duan, Z. ; Su, H. ; Chen, G.
more authors

Without assuming that the communication topology can remain its connectivity frequently enough and the potential function can provide an infinite force during the evolution of agents, the flocking problem of multi-agent systems with second-order non-linear dynamics is investigated in this study. By combining the ideas of collective potential functions and velocity consensus, a connectivity-preserving flocking algorithm with bounded potential function is proposed. Using tools from the algebraic graph theory and matrix analysis, it is proved that the designed algorithm can guarantee the group of multiple agents to asymptotically move with the same velocity while preserving the network connectivity if the coupling strength of the velocity consensus term is larger than a threshold value. Furthermore, the flocking algorithm is extended to solve the flocking problem of multi-agent systems with a dynamical virtual leader by adding a navigation feedback term. In this case, each informed agent only has partial velocity information about the leader, yet the present algorithm not only can guarantee the velocity of the whole group to track that of the leader asymptotically, and also can preserve the network connectivity. Finally, some numerical simulations are provided to illustrate the theoretical results.

Published in:

Control Theory & Applications, IET  (Volume:6 ,  Issue: 6 )