Capture of homotopy classes with probabilistic road map

Feasibility tests in virtual reality for nuclear power plant maintenance or dismantling operations are a source of problems for motion planning because finding a way in a cluttered environment is not easy for the bulky loads, mobile devices and robots used in such operations. Standard probabilistic roadmap methods (PRM) have been successfully used to answer such feasibility problems. These methods provide, at the most a single solution but do not provide a complete overview of the possible motions which have to be evaluated in a complete engineering task. We focus here on the open question of building probabilistic roadmaps which can provide an exhaustive list of all the solutions which can not be distorted from one to another while staying collision free. We call such roadmaps homotopy preserving probabilistic roadmap (HPPR). We propose a new algorithm for creating HPPR.

[1]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[2]  Thierry Siméon,et al.  A manipulation planner for pick and place operations under continuous grasps and placements , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[3]  Alexander Russell,et al.  Computational topology: ambient isotopic approximation of 2-manifolds , 2003, Theor. Comput. Sci..

[4]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[5]  Jérôme Barraquand,et al.  A method of progressive constraints for manipulation planning , 1997, IEEE Trans. Robotics Autom..

[6]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

[7]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[8]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[9]  Dima Grigoriev,et al.  Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane , 1997, AAECC.

[10]  Thomas Martinetz,et al.  Topology representing networks , 1994, Neural Networks.

[11]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[12]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  V. Kumar,et al.  A variational calculus framework for motion planning , 1997, 1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97.