TY - GEN
T1 - Decentralized Formation Control with Prescribed Distance Constraints and Shape Uniqueness
AU - Pan, Yuqi
AU - He, Binglin
AU - Geng, Junyi
AU - Wang, Yang
N1 - Publisher Copyright:
© 2023 American Automatic Control Council.
PY - 2023
Y1 - 2023
N2 - For Multi-Agent Systems (MAS) formation problem, this paper presents a novel decentralized control protocol that can guarantee the uniqueness of formation shape and restrain the distance between neighboring agents within a prescribed range. The proposed control law is decentralized, in the sense that each agent merely employs local relative information regarding its neighbors to obtain the control input. Using a delicately designed gain matrix, we avoid the problem of non-uniqueness of shape that is existed in the majority of the decentralized formation methods, especially the distance-based methods. Meanwhile, the distance constraints, like connectivity maintenance and collision avoidance, required in many practical scenarios are also addressed. Furthermore, the convergence of formation is rigorously proved under a less restrictive assumption on the communication graph. Finally, a comparative simulation verifies the effectiveness and superiority of proposed approach.
AB - For Multi-Agent Systems (MAS) formation problem, this paper presents a novel decentralized control protocol that can guarantee the uniqueness of formation shape and restrain the distance between neighboring agents within a prescribed range. The proposed control law is decentralized, in the sense that each agent merely employs local relative information regarding its neighbors to obtain the control input. Using a delicately designed gain matrix, we avoid the problem of non-uniqueness of shape that is existed in the majority of the decentralized formation methods, especially the distance-based methods. Meanwhile, the distance constraints, like connectivity maintenance and collision avoidance, required in many practical scenarios are also addressed. Furthermore, the convergence of formation is rigorously proved under a less restrictive assumption on the communication graph. Finally, a comparative simulation verifies the effectiveness and superiority of proposed approach.
UR - http://www.scopus.com/inward/record.url?scp=85167804075&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85167804075&partnerID=8YFLogxK
U2 - 10.23919/ACC55779.2023.10156390
DO - 10.23919/ACC55779.2023.10156390
M3 - Conference contribution
AN - SCOPUS:85167804075
T3 - Proceedings of the American Control Conference
SP - 1345
EP - 1352
BT - 2023 American Control Conference, ACC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 American Control Conference, ACC 2023
Y2 - 31 May 2023 through 2 June 2023
ER -