Abstract
This chapter presents an algorithm for the generation of mechanical assembly sequences that is correct and complete. The algorithm takes a description of the assembly and returns the AND/OR graph representation of assembly sequences[10]. It is assumed that exactly two parts or subassemblies are joined at each time, and that after parts have been put together they remain together. It is also assumed that whenever parts are joined forming a subassembly, all contacts between the parts in that subassembly are established. Furthermore, it is assumed that the feasibility of joining two subassemblies is independent of how those subassemblies were built. These assumptions are consistent with the trend towards product designs that are suitable for automatic assembly[1,3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. M. Andreasen et al. Design for Assembly. Springer Verlag, 1983.
D. F. Baldwin et al. An Integrated Computer Aid for Generating and Evaluating Assembly Sequences for Mechanical Products. IEEE Trans. Robotics Automat., RA-7(1):78–94, Feb. 1991.
G. Boothroyd et al. Automatic Assembly. Marcel Dekker, Inc., New York, 1982.
A. Bourjault. Contribution a une Approche Méthodologique de L’Assemblage Automatisé: Elaboration Automatique des Séquences Opératoires. Thèse d’état, Université de Franche-Comté, Besançon, France, November 1984.
T. L. De Fazio and D. E. Whitney. Simplified Generation of All Mechanical Assembly Sequences. IEEE J. Robotics Automat., RA-3(6):640–658, December 1987. Corrections ibid RA-4(6):705–708, December 1988.
N. Deo. Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, 1974.
A. J. Goldman and A. W. Tucker. Polyhedral convex cones. In Linear Inequalities and Related Systems, pages 19–40. Princeton University Press, 1956.
J. M. Henrioud. Contribution a la Conceptualisation de l’Assemblage Automatisé: Nouvelle Approche en vue de Détermination des Processus d’Assemblage. Thèse d’état, Université de Franche-Comté, Besançon, France, December 1989.
L. S. Homem de Mello and A. C. Sanderson. Task Sequence Planning for Assembly. In 12th World Congress on Scientific Computation, volume 3, pages 390–392. IMACS — International Association for Mathematics and Computers in Simulation, July 1988.
L. S. Homem de Mello and A. C. Sanderson. AND/OR Graph Representation of Assembly Plans. IEEE Trans. Robotics Automat., 6(2):188–199, April 1990.
L. S. Homem de Mello and A. C. Sanderson. Evaluation and Selection of Assembly Plans. In 1990 IEEE International Conference on Robotics and Automation, pages 1588–1593. IEEE Computer Society Press, May 1990.
C. L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968.
A. C. Sanderson and L. S. Homem de Mello. Planning Assembly/Disassembly Operations for Space Telerobotics. In W. C. Chiou, editor, Space Station Automation III, volume 851 of SPIE Proceedings Series, pages 109–115. SPIE — The International Society for Optical Engineering, November 1987.
M. A. Wesley et al. A geometric modeling system for automated mechanical assembly. IBM J. Res. Develop., 24(1):64–74, January 1980.
R. Wilson and J. F. Rit. Maintaining Geometric Dependencies in an Assembly Planner. In IEEE Int. Conf. Robotics Automat., pages 890–895. IEEE Computer Society Press, May 1990.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Homem de Mello, L.S., Sanderson, A.C. (1991). A basic algorithm for the generation of mechanical assembly sequences. In: Homem de Mello, L.S., Lee, S. (eds) Computer-Aided Mechanical Assembly Planning. The Springer International Series in Engineering and Computer Science, vol 148. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4038-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4038-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6806-9
Online ISBN: 978-1-4615-4038-0
eBook Packages: Springer Book Archive