I-Bug: An intensity-based bug algorithm

This paper introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access precise information regarding position coordinates, angular coordinates, time, or odometry, but is nevertheless able to navigate itself to a goal among unknown piecewise-analytic obstacles in the plane. The only sensor providing real values is an intensity sensor, which measures the signal strength emanating from the goal. The signal intensity function may or may not be symmetric; the main requirement is that the level sets are concentric images of simple closed curves, i.e. topological circles. Convergence analysis and distance bounds are established for the presented approach.

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

[2]  Vladimir J. Lumelsky,et al.  Sensing, intelligence, motion - how robots and humans move in an unstructured world , 2005 .

[3]  Andrzej Pelc,et al.  Graph exploration by a finite automaton , 2005, Theor. Comput. Sci..

[4]  Ademar Ferreira.  Vladimir J. Lumelsky, Sensing, Intelligence, Motion: How Robots and Humans Move in an Unstructured World , 2007 .

[5]  Joel W. Burdick,et al.  An autonomous sensor-based path-planner for planetary microrovers , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[7]  Howie Choset,et al.  Sensor-Based Exploration: Incremental Construction of the Hierarchical Generalized Voronoi Graph , 2000, Int. J. Robotics Res..

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

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

[10]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[11]  Steven M. LaValle,et al.  A pursuit-evasion BUG algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[12]  Vladimir J. Lumelsky,et al.  A paradigm for incorporating vision in the robot navigation function , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[13]  Joel W. Burdick,et al.  RoverBug: Long Range Navigation for Mars Rovers , 1999, ISER.

[14]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[15]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[16]  Joel W. Burdick,et al.  Practical autonomous path planner for turn-of-the-century planetary microrovers , 1999, Other Conferences.

[17]  Subhash Suri,et al.  Counting Targets with Mobile Sensors in an Unknown Environment , 2007, ALGOSENSORS.