CautiousBug: a competitive algorithm for sensory-based robot navigation

Bug algorithms are a class of popular algorithms for autonomous robot navigation in unknown environments with local information. Very natural, with low memory requirements, Bug strategies do not yet allow any competitive analysis. The bound on the robot's path changes from scene to scene depending on the obstacles, even though a new obstacle may not alter the length of the shortest path. We propose a new competitive algorithm, CautiousBug, whose competitive factor has an order of O(d/sup m-1/), where d is the length of the optimal path from starting point S to a target point T. m = 2/sup #Min-1/ and #Min denote the number of the distance function isolated local minima points in the given environment. Simulations were performed to study the average competitive factor of the algorithm.

[1]  Vladimir J. Lumelsky,et al.  Incorporating range sensing in the robot navigation function , 1990, IEEE Trans. Syst. Man Cybern..

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

[3]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[4]  Rolf Klein,et al.  Competitive Strategies for Autonomous Systems , 1994, Modelling and Planning for Sensor Based Intelligent Robot Systems.

[5]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[6]  Amitava Datta,et al.  Motion planning in an unknown polygonal environment with sounded performance guarantee , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  H. Noborio,et al.  On the sensor-based navigation by changing a direction to follow an encountered obstacle , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[8]  Rolf Klein,et al.  On the Competitive Complexity of Navigation Tasks , 2000, Sensor Based Intelligent Robots.

[9]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

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

[11]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[12]  Hiroshi Noborio,et al.  On the average path lengths of typical sensor-based path-planning algorithms by uncertain random mazes , 2003, Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694).

[13]  Mathukumalli Vidyasagar,et al.  Path planning for moving a point object amidst unknown obstacles in a plane: the universal lower bound on the worst path lengths and a classification of algorithms , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[14]  Hiroshi Noborio,et al.  Evaluation of path length made in sensor-based path-planning with the alternative following , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[15]  Hiroshi Noborio.  A sufficient condition for designing a family of sensor-based deadlock-free path-planning algorithms , 1992, Adv. Robotics.