This study proposes a method for automating the determination of assembly order by automating the derivation of the necessary connection relationships between the parts. The proposed method minimizes the information required for the initial conditions and automatically determines the feasible assembly orders. As a general rule, based on the assumption that the assembly order for a product is the reverse of the disassembly order, once the disassembly order is derived based on the 3D CAD model and the connection relationships between the parts, the assembly order can be determined. Until now, however, the relationships between the parts are decided manually by the attendant engineers, thus, hindering the full automation of the determination of the assembly order. To achieve full automation realistically, the connection relationships between the parts should be derived automatically from the 3D CAD model, for which this study proposes an efficient method. The components were extracted from the 3D CAD model, and the bolts were identified. The connection relationships between the parts were derived from the interference conditions determined while moving each part minutely. An association chart diagram was created from the obtained connection relationships, from which multiple assembly order candidates could be derived.

1. [1] A. J. D. Lambert, “Linear programming in disassembly/clustering sequence generation,” Computer & Industrial Engineering, Vol.36, No.4, pp. 723-738, 1999.
2. [2] A. J. D. Lambert, “Determining optimum disassembly sequence in electronic equipment,” Computer & Industrial Engineering, Vol.43, No.3, pp. 553-575, 2002.
3. [3] C. Sinanoglu, “Design of an artificial neural network for assembly sequence planning system,” Int. J. of Industrial. Eng., Vol.15, No.1, pp. 92-103, 2008.
4. [4] Y. Wang and J. H. Liu, “Chaotic particle swarm optimization for assembly sequence planning,” Robotics and Computer-Integrated Manufacturing, Vol.26, No.2, pp. 212-222, 2010.
5. [5] Q. Guan, J. H. Liu, and Y. F. Zhong, “A concurrent hierarchical evolution approach to assembly process planning,” Int. J. of Production Research, Vol.40, No.14, pp. 3357-3374, 2002.
6. [6] C. Zeng, T. Gu, L. Chang, and F. Li, “A novel multi-agent evolutionary algorithm for assembly sequence planning,” J. of Software, Vol.8, No.6, pp. 1518-1525, 2013.
7. [7] S. Imamura, “Machine Assembly/Disassembly Planning by Cooperative Agents,” The Japan Society of Mechanical Engineers: Series C, Vol.63, No.612, pp. 2951-2957, 1997 (in Japanese).
8. [8] K. Watanabe, K. Arai, and S. Inada, “A Method for Searching Assembly Orders by Utilizing Reinforcement Learning,” J. of Japan Industrial Management Association, Vol.69, No.3, pp. 121-130, 2018 (in Japanese).
9. [9] C. Kardos and J. Vancza, “Mixed-initiative assembly planning combining geometric reasoning and constrained optimization,” CIRP Annals – Manufacturing Technology, Vol.67, No.1, pp. 463-466, 2018.
10. [10] Y. Hashimoto, O. Ichikizaki, and S. Shinoda, “A Fundamental Study on an Exhaustive Assembly Sequences Generation Method Using the Positional Relations Matrix,” J. of Japan Industrial Management Association, Vol.67, No.2, pp. 83-91, 2016 (in Japanese).
11. [11] T. Fazio and D. Whitney, “Simplified generation of all mechanical assembly sequences,” IEEE J. of Robotics and Automation, Vol.3, No.6, pp. 640-658, 1987.
12. [12] L. S. Homem de Mello and A. C. Sanderson, “Representations of mechanical assembly sequences,” IEEE Trans. on Robotics and Automation, Vol.7, No.2, pp. 211-227, 1991.
13. [13] L. S. Homem de Mello and A. C. Sanderson, “A correct and complete algorithm for the generation of mechanical assembly sequences,” IEEE Trans. on Robotics and Automation, Vol.7, No.2, pp. 228-240, 1991.
14. [14] V. N. Rajan and S. Y. Nof, “Minimal precedence constraints for integrated assembly and execution planning,” IEEE Trans. on Robotics and Automation, Vol.12, No.2, pp. 175-186, 1996.
15. [15] X. Niu, H. Ding, and Y. Xiong, “A hierarchical approach to generating precedence graphs for assembly planning,” Int. J. of Machine Tools and Manufacture, Vol.43, No.14, pp. 1473-1486, 2003.
16. [16] M. Tanaka, T. Kaneeda, K. Iwama, and T. Watanabe, “A Method of Generating Optimal Subassemblies from Assembly Drawings by Disassembly Equations,” Trans. of the Japan Society of Mechanical Engineers: Series C, Vol.65, No.635, pp. 2965-2972, 1999 (in Japanese).
17. [17] A. Tanba, S. Shinoda, and T. Kawase, “A basic research on methodology for verifying properties of all the partly-finished products and the assembly tasks before the final generation of all the assembly sequences: for single-axis structure product assembly,” J. of the Society of Plant Engineers Japan, Vol.20, No.3, pp. 57-64, 2008 (in Japanese).
18. [18] A. Enomoto, N. Yamamoto, Y. Yamamura, and Y. Sugawara, “Process Knowledge Integrated Assembly Sequence Planning for Control Panel,” Int. J. Automation Technol., Vol.14, No.1, pp. 6-17, 2020.
19. [19] A. Enomoto, Y. Aoyama, Y. Yamauchi, and N. Yamamoto, “Near optimal assembly sequence generation,” Proc. of Int. Symp. on System and Integration (SII), pp. 95-101, 2016
20. [20] D. Kajita, A. Enomoto, D. Tsutsumi, and N. Moronuki, “Assembly motion automatic planning technology using geometric constraint conditions (Calculation of start, end and via point for parts assembly task using 3D CAD data),” Trans. of the JSME, Vol.85, No.875, 18-00491, 2019 (in Japanese). https://doi.org/10.1299/transjsme.18-00491