A two level fuzzy PRM for manipulation planning

This paper presents an algorithm which extends the probabilistic roadmap (PRM) framework to handle manipulation planning. This is done by using a two level approach, a PRM of PRMs. The first level builds a manipulation graph, whose nodes represent stable placements of the manipulated objects while the edges represent transfer and transit actions. The actual motion planning for the transfer and transit paths is done by PRM planners at the second level. The approach is made possible by the introduction of a new kind of roadmap, called the fuzzy roadmap. The fuzzy roadmap contains edges which are not verified by a local planner during construction. Instead, each edge is assigned a number which represents the probability that it is feasible. Later, if the edge is part of a solution path, the edge is checked for collisions. The overall effect is that our roadmaps evolve iteratively until they contain a solution. The use of fuzzy roadmaps in both levels of our manipulation planner offers many advantages. At the first level, a fuzzy roadmap represents the manipulation graph and addresses the problem of having probabilistically complete planners at the second level. At the second level, fuzzy roadmaps drastically reduce the number of collision checks. The paper contains experimental results demonstrating the feasibility and efficiency of our scheme.

[1]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[2]  Kamal K. Gupta,et al.  The kinematic roadmap: a motion planning based global approach for inverse kinematics of redundant robots , 1999, IEEE Trans. Robotics Autom..

[3]  Jean-Claude Latombe,et al.  Experiments in dual-arm manipulation planning , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[4]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

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

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

[7]  Kamal K. Gupta,et al.  Manipulation Planning for Redundant Robots: A Practical Approach , 1998, Int. J. Robotics Res..

[8]  Jérôme Barraquand,et al.  A penalty function method for constrained motion planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[9]  Rachid Alami,et al.  Two manipulation planning algorithms , 1995 .

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