Disassembly sequencing using a motion planning approach

Our motion planning based approach treats the parts in the assembly as robots and operates in the composite configuration space of the parts' individual configuration spaces. Randomized techniques inspired by recent motion planning methods are used to sample configurations in this space. Since typical assemblies consist of many parts, the corresponding composite C-spaces have high dimensionality. Also, since many important configurations for the disassembly sequence will involve closely packed parts, the disassembly problem suffers from the so-called narrow passage problem. We bias the sampling by computing potential movement directions based on the geometric characteristics of configurations known to be reachable from the assembled configuration. We construct a disassembly tree which is rooted at the starting assembled configuration. Our experimental results with several non-trivial puzzle-like assemblies show the potential of this approach.

[1]  Esther M. Arkin,et al.  On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.

[2]  Jan Wolter,et al.  Mating constraint languages for assembly sequence planning , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[3]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

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

[5]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[6]  R.H. Wilson,et al.  On constraints in assembly planning , 1998, IEEE Trans. Robotics Autom..

[7]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[8]  Jean-Claude Latombe,et al.  A general framework for assembly planning: the motion space approach , 1998, SCG '98.

[9]  Richard Hoffman,et al.  Automated assembly in a CSG domain , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[11]  Lydia E. Kavraki,et al.  Towards planning for elastic objects , 1998 .

[12]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[13]  Jan D. Wolter.  A combinatorial analysis of enumerative data structures for assembly planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[14]  Patrick G. Xavier,et al.  Fast swept-volume distance for robust collision detection , 1997, Proceedings of International Conference on Robotics and Automation.

[15]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

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

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

[20]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[21]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[22]  Lydia E. Kavraki,et al.  Deformable volumes in path planning applications , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[23]  Rajit Gadh,et al.  Virtual disassembly-a software tool for developing product dismantling and maintenance systems , 1998, Annual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity.

[24]  Nancy M. Amato,et al.  Using motion planning to study protein folding pathways , 2001, J. Comput. Biol..

[25]  Lydia E. Kavraki,et al.  Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques , 1998, IPPS/SPDP Workshops.

[26]  Jean-Claude Latombe,et al.  A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.

[27]  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).

[28]  P. G. Xavier,et al.  A configuration space toolkit for automated spatial reasoning: Technical results and LDRD project final report , 1997 .

[29]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[30]  Nancy M. Amato,et al.  A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems , 2001 .

[31]  S. N. Gottschlich,et al.  AMP-CAD: an assembly motion planning system , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.