Team Localization: A Maximum Likelihood Approach

This paper describes a method for localizing the members of a mobile robot team by using only the robots themselves as landmarks. That is, we describe a method whereby each robot can determine the relative range, bear- ing and orientation of every other robot in the team, without the use of GPS, external landmarks, or instrumentation of the environment. We assume that robots are equipped with proprioceptive motion sensor (such as odometry or inertial measurement units) and some form of sensor that will al- low them to make occasional measurements of the relative pose and identity of nearby robots (such sensors can be con- structed using cameras or scanning laser range-nders). By employing a combination of maximum likelihood estimation and numerical optimization, we can subsequently infer the relative pose of every robot in the team at any given point in time. This paper describes the basic formalism, its practical im- plementation, and presents experimental results obtained using both real and simulated robots in both static and dy- namic environments.

[1]  Ryo Kurazume,et al.  An Experimental Study of a Cooperative Positioning System , 2000, Auton. Robots.

[2]  Matteo Golfarelli,et al.  Elastic correction of dead-reckoning errors in map building , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[3]  William H. Press,et al.  Numerical recipes , 1990 .

[4]  Sebastian Thrun,et al.  A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots , 2001, Int. J. Robotics Res..

[5]  BurgardWolfram,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998 .

[6]  Stergios I. Roumeliotis,et al.  Collective localization: a distributed Kalman filter approach to localization of groups of mobile robots , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[7]  Alan C. Schultz,et al.  Mobile robot exploration and map-building with continuous localization , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[8]  Stephen R. Marsland,et al.  Learning globally consistent maps by relaxation , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[9]  Evangelos E. Milios,et al.  Globally Consistent Range Scan Alignment for Environment Mapping , 1997, Auton. Robots.

[10]  Reid G. Simmons,et al.  Probabilistic Robot Navigation in Partially Observable Environments , 1995, IJCAI.

[11]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[12]  Les Kitchen,et al.  Cooperative Localisation and Mapping , 1999 .

[13]  W. Burgard,et al.  Markov Localization for Mobile Robots in Dynamic Environments , 1999, J. Artif. Intell. Res..

[14]  R. Simmons,et al.  Probabilistic Navigation in Partially Observable Environments , 1995 .

[15]  William H. Press,et al.  Numerical recipes in C , 2002 .

[16]  Hugh F. Durrant-Whyte,et al.  A solution to the simultaneous localization and map building (SLAM) problem , 2001, IEEE Trans. Robotics Autom..

[17]  Gregory Dudek,et al.  Multi-Robot Exploration of an Unknown Environment, Efficiently Reducing the Odometry Error , 1997, IJCAI.

[18]  Stergios I. Roumeliotis,et al.  Distributed Multi-Robot Localization , 2000, DARS.

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

[20]  Hugh F. Durrant-Whyte,et al.  Mobile robot localization by tracking geometric beacons , 1991, IEEE Trans. Robotics Autom..