Assembly sequencing with toleranced parts

The goal of assembly sequencing is to plan a feasible series of operations to construct a product from its individual parts. Previous research has thoroughly investigated assembly sequencing under the assumption that parts have nominal geometry. This paper considers the case where parts have toleranced geometry. Its main contribution is an efficient procedure that decides if a product admits an assembly sequence with infinite translations that is feasible for all possible instances of the components within the specified tolerances. If the product admits one such sequence, the procedure can also generate it. For the cases where there exists no such assembly sequence, another procedure is proposed which generates assembly sequences that are feasible only for some values of the toleranced dimensions. If this procedure produces no such sequence, then no instance of the product is assemblable. Finally, this paper analyzes the relation between assembly and disassembly sequences in the presence of toleranced parts. This work assumes a simple, but non-trivial tolerance language that falls short of capturing all imperfections of a manufacturing process. Hence, it is only one step toward assembly sequencing with toleranced parts.

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

[2]  Randall H. Wilson,et al.  On geometric assembly planning , 1992 .

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

[4]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[5]  Jorge Stolfi,et al.  Objects that cannot be taken apart with two hands , 1993, SCG '93.

[6]  Sukhan Lee,et al.  Assembly planning based on geometric reasoning , 1990, Comput. Graph..

[7]  Richard Hoffman.  A common sense approach to assembly sequence planning , 1991 .

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

[9]  Richard A. Volz,et al.  On the automatic generation of plans for mechanical assembly , 1988 .

[10]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[11]  Sukhan Lee,et al.  Computer-Aided Mechanical Assembly Planning , 1991 .

[12]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[13]  Randall H. Wilson,et al.  Assembly partitioning along simple paths: the case of multiple translations , 1996, Adv. Robotics.

[14]  Daniel Flanagan Baldwin.  Algorithmic methods and software tools for the generation of mechanical assembly sequences , 1990 .

[15]  Rajeev Motwani,et al.  On certificates and lookahead in dynamic graph problems , 1996, SODA 1996.

[16]  Jean-Claude Latombe,et al.  Assembly sequencing with toleranced parts , 1995 .

[17]  Balas K. Natarajan,et al.  On planning assemblies , 1988, SCG '88.

[18]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[19]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..

[20]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[21]  Lydia E. Kavraki,et al.  Two-Handed Assembly Sequencing , 1995, Int. J. Robotics Res..

[22]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[23]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[24]  Bernard Chazelle,et al.  The Complexity and Decidability of Separation , 1984, ICALP.

[25]  Randall H. Wilson,et al.  Maintaining geometric dependencies in an assembly planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[26]  Lydia E. Kavraki,et al.  On the Complexity of Assembly Partitioning , 1993, CCCG.

[27]  Leonid Frants.  Tolerance analysis in mechanical design , 1995 .

[28]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

[29]  J. Latombe,et al.  A Simple and E cient Procedure for Polyhedral Assembly Partitioning under In nitesimal Motions , 1995 .

[30]  Alan Duncan Fleming,et al.  Analysis of uncertainties and geometric tolerances in assemblies of parts , 1987 .

[31]  Lydia E. Kavraki,et al.  Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete , 1995, Inf. Process. Lett..

[32]  Aristides A. G. Requicha,et al.  Representation of Tolerances in Solid Modeling: Issues and Alternative Approaches , 1984 .