Localization With Limited Sensing

Localization is a fundamental problem for many kinds of mobile robots. Sensor systems of varying ability have been proposed and successfully used to solve the problem. This paper probes the lower limits of this range by describing three extremely simple robot models and addresses the active localization problem for each. The robot, whose configuration is composed of its position and orientation, moves in a fully-known, simply connected polygonal environment. We pose the localization task as a planning problem in the robot's information space, which encapsulates the uncertainty in the robot's configuration. We consider robots equipped with: 1) angular and linear odometers; 2) a compass and contact sensor and; 3) an angular odometer and contact sensor. We present localization algorithms for models 1 and 2 and show that no algorithm exists for model 3. An implementation with simulation examples is presented.

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

[2]  Wolfram Burgard,et al.  Monte Carlo localization for mobile robots , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[3]  Gregory Dudek,et al.  Localizing a robot with minimum travel , 1995, SODA '95.

[4]  Steven M. LaValle,et al.  Gap Navigation Trees: Minimal Representation for Visibility-based Tasks , 2004, WAFR.

[5]  Joseph S. B. Mitchell,et al.  Minimum-link paths among obstacles in the plane , 1990, SCG '90.

[6]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[8]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[9]  Kokichi Sughiara.  Some location problems for robot navigation using a single camera , 1988 .

[10]  Leonidas J. Guibas,et al.  The robot localization problem in two dimensions , 1992, SODA '92.

[11]  Kevin M. Lynch,et al.  Parts Feeding on a Conveyor with a One Joint Robot , 2000, Algorithmica.

[12]  Patric Jensfelt,et al.  Active global localization for a mobile robot using multiple hypothesis tracking , 2001, IEEE Trans. Robotics Autom..

[13]  Ehud Rivlin,et al.  Sensory-based motion planning with global proofs , 1997, IEEE Trans. Robotics Autom..

[14]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.

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

[16]  Jason M. O'Kane,et al.  Comparing the Power of Robots , 2008, Int. J. Robotics Res..

[17]  Erik D. Demaine,et al.  Robot Localization without Depth Perception , 2002, SWAT.

[18]  Jon M. Kleinberg,et al.  The localization problem for mobile robots , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[19]  Sven Koenig,et al.  A near-tight approximation lower bound and algorithm for the kidnapped robot problem , 2006, SODA '06.

[20]  Howie Choset,et al.  Complete sensor-based coverage with extended-range detectors: a hierarchical decomposition in terms of critical points and Voronoi diagrams , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[21]  Wolfram Burgard,et al.  Active Markov localization for mobile robots , 1998, Robotics Auton. Syst..

[22]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[23]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[24]  William B. Thompson,et al.  Inexact navigation , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[25]  Leonidas J. Guibas,et al.  Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..

[26]  Daniel E. Whitney,et al.  Real robots don't need jigs , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[27]  Sven Koenig,et al.  An Approximation Algorithm for the Robot Localization Problem , 2004 .

[28]  Jason M. O'Kane,et al.  Almost-Sensorless Localization , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[29]  Howie Choset,et al.  Sensor Based Planing, Part II: Incremental COnstruction of the Generalized Voronoi Graph , 1995, ICRA.

[30]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[31]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

[32]  Jason M. O'Kane,et al.  Global localization using odometry , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[33]  Richard A. Volz,et al.  Optimal algorithms for symmetry detection in two and three dimensions , 1985, The Visual Computer.

[34]  Ingemar J. Cox,et al.  Blanche-an experiment in guidance and navigation of an autonomous robot vehicle , 1991, IEEE Trans. Robotics Autom..

[35]  Vladimir J. Lumelsky,et al.  An algorithm for maze searching with azimuth input , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[36]  Leslie Pack Kaelbling,et al.  Learning Topological Maps with Weak Local Odometric Information , 1997, IJCAI.

[37]  John Hershberger,et al.  A New Data Structure for Shortest Path Queries in a Simple Polygon , 1991, Inf. Process. Lett..

[38]  Gregory Dudek,et al.  Randomized Algorithms for Minimum Distance Localization , 2007, Int. J. Robotics Res..

[39]  Kokichi Sugihara,et al.  Some location problems for robot navigation using a single camera , 1988, Computer Vision Graphics and Image Processing.