Bayesian Rendezvous for Distributed Robotic Systems

In this paper, we state, using thorough mathe- matical analysis, sufficient conditions to perform a rendezvous maneuver with a group of differential-wheeled robots endowed with an on-board, noisy, local positioning system. In particular, we extend the existing framework of noise-free, graph-based distributed control with a layer of Bayesian reasoning allowing to solve the rendezvous problem more efficiently in presence of uncertainties and in a probabilistically sound way. Finally we perform extensive experiments with a team of four real robots, and simulation with their corresponding simulated counterpart, to confirm the benefits of our Bayesian approach.


Published in:
Proceedings of the IEEE/RSJ 2011 International Conference on Intelligent Robots and Systems
Presented at:
IEEE/RSJ 2011 International Conference on Intelligent Robots and Systems, San Fransisco, CA, USA, September 25-30, 2011
Year:
2011
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
Keywords:
Laboratories:




 Record created 2011-08-22, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)