Critical point sensing in unknown environments

Many motion planning algorithms use Morse functions to characterize the free space. Specifically, these algorithms look at the critical points of a Morse function to denote the topological changes in the free space. This paper introduces methods to sense critical points and ensure all critical points are "seen" by a coverage algorithm. Experimental results performed on a mobile robot are also presented.

[1]  Howie Choset,et al.  Exact cellular decompositions in terms of critical points of Morse functions , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[2]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[3]  R. Courant,et al.  What Is Mathematics , 1943 .

[4]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot Robotics and Autonomous Systems 14 (1995) 199-212 , 1995, Robotics Auton. Syst..

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

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

[7]  Keiji Nagatani,et al.  The arc-transversal median algorithm: an approach to increasing ultrasonic sensor accuracy , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[8]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[9]  Ernest L. Hall,et al.  Region filling operations with random obstacle avoidance for mobile robots , 1988, J. Field Robotics.

[10]  Vladimir J. Lumelsky,et al.  Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..

[11]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[12]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[13]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.