Complexity analysis and approximate solutions for two multiple-robot localization problems

We consider the localization problem for a system of mobile robots using inexpensive range sensors. Among many issues for multi-robot systems, two problems are identified and formally defined. The first problem is sensing ranges from all robots as quickly as possible while avoiding sensor cross-talk, and the second problem is to localize a multi-robot system using a minimal number of range sensings. We show that both these problems are NP-complete, and we propose an approximate method for the multi-robot localization problem that takes advantage of the robots pose uncertainty information. Simulation results show the effectiveness of our method for localizing multiple robots.

[1]  Vijay Kumar,et al.  Motion generation for formations of robots: A geometric approach , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[2]  Avrim Blum,et al.  New approximation algorithms for graph coloring , 1994, JACM.

[3]  Wolfram Burgard,et al.  Particle Filters for Mobile Robot Localization , 2001, Sequential Monte Carlo Methods in Practice.

[4]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[5]  K.-W. Jorg,et al.  First results in eliminating crosstalk and noise by applying pseudo-random sequences to mobile robot sonar sensing , 1996, Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96).

[6]  Peter Cheeseman,et al.  On the Representation and Estimation of Spatial Uncertainty , 1986 .

[7]  Uri Zwick,et al.  Coloring k-colorable graphs using smaller palettes , 2001, SODA '01.

[8]  Waleed Meleis,et al.  Lower bounds on precedence-constrained scheduling for parallel processors , 2000, Proceedings 2000 International Conference on Parallel Processing.

[9]  S. Muthukrishnan,et al.  Resource scheduling for parallel database and scientific applications , 1996, SPAA '96.

[10]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[11]  Stergios I. Roumeliotis,et al.  Bayesian estimation and Kalman filtering: a unified framework for mobile robot localization , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  R. Motwani,et al.  Approximate Graph Coloring by Semide nite , 1994 .

[13]  Gregory Dudek,et al.  Multi-robot cooperative localization: a study of trade-offs between efficiency and accuracy , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Wolfram Burgard,et al.  A Probabilistic Approach to Collaborative Multi-Robot Localization , 2000, Auton. Robots.