CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm

This paper is concerned with online navigation of a size D mobile robot in an unknown planar environment. A formal means for assessing algorithms for online tasks is competitiveness. For the navigation task, competitiveness measures the algorithm's path length relative to the optimal offline path length. While competitiveness usually means constant relative performance, it is measured in this paper in terms of a quadratic relationship between online performance and optimal offline solution. An online navigation algorithm for a size D robot called CBUG is described. The competitiveness of CBUG is analyzed and shown to be quadratic in the length of the shortest offline path. Moreover, it is shown that, in general, quadratic competitiveness is the best achievable performance over all online navigation algorithms. Thus, up to constants, CBUG achieves optimal competitiveness. The algorithm is improved with some practical speedups, and the usefulness of its competitiveness in terms of path stability is illustrated in office-like environments.

[1]  Elon Rimon,et al.  Competitive on-line coverage of grid environments by a mobile robot , 2003, Comput. Geom..

[2]  Joachim Hertzberg,et al.  Keep It Simple, Hybrid! A Case Study in Autonomous Office Courier Robot Control , 2001 .

[3]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2004, ESA.

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

[5]  Elon Rimon,et al.  Competitive Disconnection Detection in On-Line Mobile Robot Navigation , 2006, WAFR.

[6]  Elon Rimon,et al.  Competitive Complexity of Mobile Robot On Line Motion Planning Problems , 2004, WAFR.

[7]  Rolf Klein,et al.  An Optimal Competitive Strategy for Walking in Streets , 2004, SIAM J. Comput..

[8]  Howie Choset,et al.  Sensor based planning. II. Incremental construction of the generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[9]  Amos Fiat,et al.  Randomized robot navigation algorithms , 1996, SODA '96.

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

[11]  Ehud Rivlin,et al.  TangentBug: A Range-Sensor-Based Navigation Algorithm , 1998, Int. J. Robotics Res..

[12]  John M. Evans,et al.  HelpMate: an autonomous mobile robot courier for hospitals , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

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

[14]  Michael Farber,et al.  Instabilities of Robot Motion , 2002, ArXiv.

[15]  Howie Choset,et al.  Sensor based planning and nonsmooth analysis , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[16]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[17]  Rinaldo C. Michelini,et al.  Mobile robots in greenhouse cultivation: inspection and treatment of plants , 2003 .

[18]  Steven M. LaValle,et al.  Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances , 2007, IEEE Transactions on Robotics.

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

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

[21]  Terrance L. Huntsberger,et al.  Closed loop control for autonomous approach and placement of science instruments by planetary rovers , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[23]  Amitava Datta,et al.  Competitive searching in a generalized street , 1994, SCG '94.

[24]  Larry H. Matthies,et al.  An autonomous path planner implemented on the Rocky 7 prototype microrover , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[25]  Steven M. LaValle,et al.  Optimal navigation and object finding without geometric maps or localization , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[26]  Hiroshi Noborio,et al.  An on-line and deadlock-free path-planning algorithm based on world topology , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

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

[28]  Susanne Albers,et al.  Exploring Unknown Environments with Obstacles , 1999, SODA '99.

[29]  M. Vidyasagar,et al.  Path planning for moving a point object amidst unknown obstacles in a plane: a new algorithm and a general theory for algorithm development , 1990, 29th IEEE Conference on Decision and Control.

[30]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[31]  Viktor Hamburger,et al.  Book Reviews: Die Optik in der Feinmesstechnik , 1949 .