Construction of C-space roadmaps from local sensory data. What should the sensors look for?

This paper presents an incremental navigation strategy for general articulated robots:the robot may start with no a priori information about its environment, and is guaranteed either to find the goal if it is reachable or halt. The strategy, termed theincremental roadmap algorithm, constructs a roadmap based on on-line distance data which is encoded as a repulsive potential field. The incremental behavior is achieved with two novel abstract sensors: thecritical-point detector and thepassage-point detector. The detectors provide a complete characterization of what the robot should look for in its configuration space to achieve globally convergent navigation. The approach thus provides a new framework, which will hopefully yield the first navigation algorithm that is both completely general and practical.

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

[2]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[3]  Micha Sharir,et al.  A Survey of Motion Planning and Related Geometric Algorithms , 1988, Artificial Intelligence.

[4]  Jonathan H. Connell,et al.  SSS: a hybrid architecture applied to robot navigation , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[5]  R. Palais,et al.  Critical Point Theory and Submanifold Geometry , 1988 .

[6]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

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

[8]  Chee-Keng Yap,et al.  On-line motion planning: Case of a planar rod , 2015, Annals of Mathematics and Artificial Intelligence.

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

[10]  M. Goresky,et al.  Stratified Morse theory , 1988 .

[11]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[12]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[13]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[14]  Bruce Randall Donald Information invariants in robotics. I. State, communication, and side-effects , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[15]  Louis Nirenberg,et al.  Variational and topological methods in nonlinear problems , 1981 .

[16]  Ming C. Lin,et al.  An opportunistic global path planner , 2005, Algorithmica.

[17]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .