Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
696656 | Automatica | 2011 | 6 Pages |
Abstract
In this paper, we investigate the coordination problem of multiple robots with limited communication ranges and communication failures. A novel rendezvous algorithm via proximity graph is developed so that the robot group can achieve rendezvous when the communication links satisfy an ergodic assumption. The convergence proof of the algorithm is established based on the tools from rooted graph theory. The effectiveness of the algorithm is illustrated by numerical examples in a 3D space.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Yuan Fan, Gang Feng, Yong Wang, Jianbin Qiu,