Robust Multitask Formation Control via Parametric Lyapunov-Like Barrier Functions

被引:32
作者
Han, Dongkun [1 ,2 ]
Panagou, Dimitra [1 ]
机构
[1] Univ Michigan, Dept Aerosp Engn, Ann Arbor, MI 48109 USA
[2] Chinese Univ Hong Kong, Dept Mech & Automat Engn, Shatin, Hong Kong, Peoples R China
基金
美国国家航空航天局;
关键词
Uncertainty; Multi-agent systems; Sensors; Measurement uncertainty; Collision avoidance; Maintenance engineering; Lyapunov methods; Cooperative control; lyapunov methods; multi-agent systems; multitast formation; robust control; DISTRIBUTED COORDINATION CONTROL; MULTIAGENT SYSTEMS; CONNECTIVITY CONTROL; RENDEZVOUS PROBLEM; CONSENSUS; STABILIZATION; TRACKING; SYNCHRONIZATION; POLYNOMIALS; MAINTENANCE;
D O I
10.1109/TAC.2019.2894587
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An essential problem in the coordination of multiple agents is formation control. Significant challenges to the theoretical design may arise when the multiagent system is subject to uncertainty. This paper considers the robust multitask formation control problem for multiple agents, whose communication and measurements are disturbed by uncertain parameters. The control objectives include achieving the desired configuration, avoiding collisions, and preserving the connectivity of the uncertain topology. To achieve these objectives, we first provide conditions in terms of linear matrix inequalities for checking the connectivity of uncertain topologies. Then, we propose a new type of Lyapunov-like barrier function, called parametric Lyapunov-like barrier function, that is applicable to multiagent systems with uncertainties in communication and measurements. It is shown that this new type of Lyapunov-like barrier function guarantees the robust multitask formation and displays advantages over parameter-independent Lyapunov-like barrier functions. The efficacy of the proposed method is demonstrated via simulation results.
引用
收藏
页码:4439 / 4453
页数:15
相关论文
共 57 条
[41]  
Panagou D, 2011, IEEE DECIS CONTR P, P2831, DOI 10.1109/CDC.2011.6160922
[42]  
Prajna S, 2004, LECT NOTES COMPUT SC, V2993, P477
[43]   POSITIVE POLYNOMIALS ON COMPACT SEMI-ALGEBRAIC SETS [J].
PUTINAR, M .
INDIANA UNIVERSITY MATHEMATICS JOURNAL, 1993, 42 (03) :969-984
[44]   Consensus seeking in multiagent systems under dynamically changing interaction topologies [J].
Ren, W ;
Beard, RW .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50 (05) :655-661
[45]   Decentralized connectivity maintenance for cooperative control of mobile robotic systems [J].
Sabattini, Lorenzo ;
Chopra, Nikhil ;
Secchi, Cristian .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2013, 32 (12) :1411-1423
[46]   ROBUST CONSENSUS FOR CONTINUOUS-TIME MULTIAGENT DYNAMICS [J].
Shi, Guodong ;
Johansson, Karl Henrik .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2013, 51 (05) :3673-3691
[47]   Connectivity management in mobile robot teams [J].
Stump, Ethan ;
Jadbabaie, Ali ;
Kumar, Vijay .
2008 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-9, 2008, :1525-1530
[48]   Rendezvous of multiple mobile agents with preserved network connectivity [J].
Su, Housheng ;
Wang, Xiaofan ;
Chen, Guanrong .
SYSTEMS & CONTROL LETTERS, 2010, 59 (05) :313-322
[49]   Flocking in fixed and switching networks [J].
Tanner, Herbert G. ;
Jadbabaie, Ali ;
Pappas, George J. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (05) :863-868
[50]   Robust consensus of multi-agent systems with diverse input delays and asymmetric interconnection perturbations [J].
Tian, Yu-Ping ;
Liu, Cheng-Lin .
AUTOMATICA, 2009, 45 (05) :1347-1353