Infinitesimal Shape-Similarity for Characterization and Control of Bearing-Only Multirobot Formations

被引:14
作者
Buckley, Ian [1 ]
Egerstedt, Magnus [1 ]
机构
[1] Georgia Inst Technol, Inst Robot & Intelligent Machines, Atlanta, GA 30332 USA
关键词
Robot sensing systems; Shape; Robot kinematics; Network topology; Tools; Rigidity; Transmission line matrix methods; Distributed robot systems; formation control; multirobot systems; networked robots; RIGIDITY; CONSENSUS; GRAPHS; COORDINATION;
D O I
10.1109/TRO.2021.3072549
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
When organizing robots into formations, the interplay between the underlying network topology of the team and the sensing and communication modalities available to the individual robots has a fundamental effect on what types of formations are possible. The purpose of this article is to characterize the available motions of formations in which relative angles between robots equipped with bearing-only sensors are maintained. First, infinitesimal shape-similarity, a property of frameworks for which maintaining certain angles between robots ensures that the formation is invariant to translation, rotation, and uniform scaling, is examined; the shape-similarity matrix is redeveloped, and results on its nullspace are presented. Second, triangulations, a class of frameworks, are shown to be infinitesimally shape-similar. Finally, the coupling between network topology and robot capabilities is examined through the design of a decentralized heterogeneous formation-control strategy for a class of triangulations in which all robots are equipped with bearing-only sensors and a single robot can measure distances; the formation-control strategy is demonstrated on a team of differential-drive robots.
引用
收藏
页码:1921 / 1935
页数:15
相关论文
共 51 条
[1]   Rigid Graph Control Architectures for Autonomous Formations APPLYING CLASSICAL GRAPH THEORY TO THE CONTROL OF MULTIAGENT SYSTEMS [J].
Anderson, Brian D. O. ;
Yu, Changbin ;
Fidan, Bari ;
Hendrickx, Julien M. .
IEEE CONTROL SYSTEMS MAGAZINE, 2008, 28 (06) :48-63
[2]  
[Anonymous], 1994, Convexity
[3]   RIGIDITY OF GRAPHS .2. [J].
ASIMOW, L ;
ROTH, B .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1979, 68 (01) :171-190
[4]   RIGIDITY OF GRAPHS [J].
ASIMOW, L ;
ROTH, B .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1978, 245 (NOV) :279-289
[5]   On triangulating k-outerplanar graphs [J].
Biedl, Therese .
DISCRETE APPLIED MATHEMATICS, 2015, 181 :275-279
[6]  
Bondy J., 2008, GTM, V244
[7]  
Buckley I, 2019, IEEE INT CONF ROBOT, P2004, DOI [10.1109/icra.2019.8793514, 10.1109/ICRA.2019.8793514]
[8]  
Buckley I, 2018, IEEE INT C INT ROBOT, P3751, DOI 10.1109/IROS.2018.8594381
[9]  
Buckley I, 2017, IEEE INT C INT ROBOT, P1077, DOI 10.1109/IROS.2017.8202277
[10]  
Bullo F, 2009, PRINC SER APPL MATH, P1