Mobility analysis for feasibility studies in CAD models of industrial environments

Presents a variant of a probabilistic approach to motion planning. The objective is to face large, complex industrial environments for maintenance purpose. The contribution is based on a structuring of the workspace into boxes that limits the size of the graph to be searched. The algorithm was integrated in a commercial CAD system and real-size experiments are presented.

[1]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[2]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Pierre Ferbach,et al.  Planning nonholonomic motions for manipulated objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

[5]  J. Latombe,et al.  Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .

[6]  Pierre Ferbach,et al.  A method of progressive constraints for nonholonomic motion planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[7]  Alistair McLean,et al.  Incremental roadmaps and global path planning in evolving industrial environments , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

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

[10]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .