Premium
Bounded Connectivity‐Preserving Leader‐Follower Flocking Algorithms Without Acceleration Measurements
Author(s) -
Mao Yutian,
Dou Lihua,
Fang Hao,
Chen Jie
Publication year - 2015
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.852
Subject(s) - flocking (texture) , bounded function , control theory (sociology) , acceleration , computer science , collision avoidance , collision , distributed computing , mathematics , control (management) , artificial intelligence , physics , mathematical analysis , computer security , classical mechanics , quantum mechanics
The problem of distributed connectivity‐preserving leader‐follower flocking of multiple autonomous agents with second‐order dynamics is investigated. First, a new class of bounded artificial potential fields is carefully designed which could guarantee connectivity preservation, distance stabilization and collision avoidance simultaneously as the system evolves. Furthermore, in the absence of acceleration measurements of the dynamic leader, a set of distributed and bounded leader‐follower flocking control protocols is derived for each follower with the aid of the combination of potential based gradient descent methods and the sliding mode control paradigms. It is shown that all followers achieve velocity consensus and collision avoidance with the dynamic leader, the underlying network remains connected for all time, and the desired stable flocking behavior is asymptotically achieved on the condition that the initial network is connected. Finally, nontrivial simulations and experiments are worked out to verify the effectiveness of the proposed control algorithms.