Almost-Sensorless Localization

We present a localization method for robots equipped with only a compass, a contact sensor and a map of the environment. In this framework, a localization strategy can be described as a sequence of directions in which the robot moves maximally. We show that a localizing sequence exists for any simply connected polygonal environment by presenting an algorithm for computing such a sequence. We have implemented the algorithm and we present several computed examples. We also show that the sensing model is minimal by showing that replacement of the compass by an angular odometer precludes the possibility of performing localization.

[1]  David D. Grossman,et al.  Orienting Mechanical Parts by Computer-Controlled Manipulator , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[3]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

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

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

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

[9]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[10]  N. Linial,et al.  On the cover time of random walks on graphs , 1989 .

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

[12]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[13]  R. Hinkel,et al.  ENVIRONMENT PERCEPTION WITH A LASER RADAR IN A FAST MOVING ROBOT , 1989 .

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

[15]  Kenneth Basye,et al.  Map Learning with Indistinguishable Locations , 1989, UAI.

[16]  Allan Borodin,et al.  Lower bounds on the length of universal traversal sequences , 1989, STOC '89.

[17]  Hiroshi Imai,et al.  Locating a Robot with Angle Mathematics , 1990, J. Symb. Comput..

[18]  Kenneth Y. Goldberg,et al.  Bayesian grasping , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[19]  David Eppstein,et al.  Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[20]  Noga Alon,et al.  Universal sequences for complete graphs , 1990, Discret. Appl. Math..

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

[22]  Martin Tompa Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs , 1992, SIAM J. Comput..

[23]  Ingemar J. Cox,et al.  Dynamic Map Building for an Autonomous Mobile Robot , 1992 .

[24]  Vladimir J. Lumelsky,et al.  Vision-guided exploration: a step toward general motion planning in three dimensions , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[25]  Wolfgang D. Rencken,et al.  Concurrent localisation and map building for mobile robots using ultrasonic sensors , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[26]  Vladimir J. Lumelsky,et al.  Provable strategies for vision-guided exploration in three dimensions , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[27]  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.

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

[29]  Ewald von Puttkamer,et al.  Keeping track of position and orientation of moving indoor systems by correlation of range-finder scans , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[30]  Ken Goldberg,et al.  Optimal Curved Fences for Part Alignment on a Belt , 1995 .

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

[32]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[33]  Sven Schuierer,et al.  Optimal robot localization in trees , 1996, SCG '96.

[34]  Kevin M. Lynch Sensorless parts feeding with a one joint robot , 1996 .

[35]  Gregory Dudek,et al.  Vision-based robot localization without explicit object models , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[36]  Ken Goldberg,et al.  A complete algorithm for designing passive fences to orient parts , 1997 .

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

[38]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[39]  Matthew T. Mason,et al.  Posing Polygonal Objects in the Plane by Pushing , 1998, Int. J. Robotics Res..

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

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

[42]  Mark H. Overmars,et al.  Geometry and Part Feeding , 2000, Sensor Based Intelligent Robots.

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

[44]  Sebastian Thrun,et al.  Probabilistic Algorithms in Robotics , 2000, AI Mag..

[45]  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).

[46]  Howie Choset,et al.  Robust sensor-based coverage of unstructured environments , 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).

[47]  Mark H. Overmars,et al.  Trap Design for Vibratory Bowl Feeders , 2001 .

[48]  Pankaj K. Agarwal,et al.  Minimal trap design , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[50]  Steven M. LaValle,et al.  Locally-optimal navigation in multiply-connected environments without geometric maps , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[51]  Wolfram Burgard,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Machine Learning.

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

[53]  Kostas E. Bekris,et al.  On the feasibility of using wireless ethernet for indoor localization , 2004, IEEE Transactions on Robotics and Automation.

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

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

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