By Topic

Multirobot Rendezvous With Visibility Sensors in Nonconvex Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ganguli, A. ; UtopiaCompression Corp., Los Angeles, CA ; Cortes, J. ; Bullo, F.

This paper presents a coordination algorithm for mobile autonomous robots. Relying on distributed sensing, the robots achieve rendezvous, i.e., they move to a common location. Each robot is a point mass moving in a simply connected, nonconvex, unknown environment according to an omnidirectional kinematic model. It is equipped with line-of-sight limited-range sensors, i.e., it can measure the relative position of any object (robots or environment boundary) if and only if the object is within a given distance and there are no obstacles in between. The perimeter minimizing algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. The algorithm provably achieves rendezvous if the interagent sensing graph is connected at any time during the evolution of the group. Simulations illustrate the theoretical results and the performance of the proposed algorithm in asynchronous setups and with measurement errors, control errors, and nonzero robot size. Simulations to illustrate the importance of visibility constraints and comparisons with the optimal centralized algorithm are also included.

Published in:

Robotics, IEEE Transactions on  (Volume:25 ,  Issue: 2 )