Graph and network methods for automating the design of disassembly processes for complex technical systems. Review

Cover Page

Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription or Fee Access

Abstract

During the operation of a complex machine or device, it is necessary to perform complete or partial disassembly of the product and its individual components and assemblies. Disassembly operations are required for repair, maintenance and disposal of technical system components at the end of their service life. Modern technical systems can consist of several thousand (or more) parts and components. Therefore, it is necessary to use modern computing and design automation tools to plan disassembly processes and operations. The sequence of disassembly and the content of disassembly operations largely depend on the mechanical structure of the product. To model the mechanical structures of complex products in CAD-systems, various graph and network models are mainly used. The paper gives an overview of the most popular models of this type. The main carrier of information about the mechanical structure of a product is the so-called liaison graph. The review considers design procedures for synthesizing disassembly processes using the liaison graph. Procedures of expert ordering and procedures based on cuts in the liaison graph.

About the authors

A. N. Bozhko

Bauman Moscow State University

Author for correspondence.
Email: bozhkoan@bmstu.ru

Dr. of Tec. Sc., Professor of CAD department

Russian Federation, Moscow

R. C. Chernyaev

Bauman Moscow State University

Email: chernyaevrv@student.bmstu.ru

Postgraduate Student of CAD department

Russian Federation, Moscow

References

  1. De Fazio T., Whitney D. Simplified generation of all mechanical assembly sequences, IEEE Journal on Robotics and Automation, 1987, vol. 3, no. 6. pp. 640—658.
  2. De Mello L. S. H., Sanderson A. C. Automatic generation of mechanical assembly sequences, Pittsburgh, Pennsylvania, Carnegie Mellon University, 1988.
  3. Lee D. H., Kang J. G., Xirouchakis P. Disassembly planning and scheduling: review and further research, Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2001, vol. 215, no. 5, pp. 695—709.
  4. Halperin D., Latombe J. C., Wilson R. H. A general framework for assembly planning: The motion space approach, Proceedings of the fourteenth annual symposium on Computational geometry, 1998, pp. 9—18.
  5. De Mello L. S. H., Sanderson A. C. A correct and complete algorithm for the generation of mechanical assembly sequences, IEEE International Conference on Robotics and Automation, IEEE Computer Society, 1989, pp. 56—61.
  6. Baldwin D. F. et al. An integrated computer aid for generating and evaluating assembly sequences for mechanical products, IEEE transactions on robotics and automation, 1991, vol. 7, no. 1, pp. 78—94.
  7. Zussman E., Scholz-Reiter B., Scharke H. Modeling and planning of disassembly processes, Proceedings of the IFIP WG5, 3 international conference on Life-cycle modelling for innovative products and processes, 1996, pp. 221—232.
  8. Ben-Arieh D., Kramer B. Computer-aided process planning for assembly: generation of assembly operations sequence, The international journal of production research, 1994, vol. 32, no. 3, pp. 643—656.
  9. Bourjault A. Methodology of assembly automation: A new approach, R obotics and Factories of the Future’87, Berlin, Heidelberg, Springer Berlin Heidelberg, 1988, pp. 37—45.
  10. Russell S., Norvig P. Artificial Intelligence: A Moder n Approach, University of Michigan Press, 2003
  11. Wilson R. H., Rit J. F. Maintaining geometric dependencies in an assembly planner, Proceedings., IEEE Int ernational Conference on Robotics and Automation, 1990, pp. 890—895.
  12. Woo T. C., Dutta D. Automatic disassembly and total ordering in three dimensions, The journal of engineering for industry, 1991, vol. 113, no. 2, pp. 207—213.
  13. Wilson R. H. Minimizing user queries in interactive assembly planning, IEEE transactions on robotics and automation, 1995, vol. 11, no. 2, pp. 308—312.
  14. Laperriere L., ElMaraghy H. A. Planning of products assembly and disassembly, CIRP annals, 1992, vol. 41, no. 1, pp. 5—9.
  15. Erdos G., Kis T., Xirouchakis P. Modelling and evalua ting product end-of-life options, International Journal of Production Research, 2001, vol. 39, no. 6, pp. 1203—1220.
  16. Dini G., Failli F., Santochi M. A disassembly planning software system for the optimization of recycling processes, Production Planning & Control, 2001, vol. 12, no. 1, pp. 2—12.
  17. Caselli S., Zanichelli F. On assembly sequence planning using Petri nets, Assembly and Task Planning, Proceedings, IEEE International Symposium, 1995.
  18. Zussman E., Zhou M. C., Caudill R. Disassembly Petri net approach to modeling and planning disassembly processes of electronic products, Proceedings of the 1998 IEEE International, 1998
  19. Cao T., Sanderson A. Task sequence planning using fuzzy Petri nets, Systems, Man, and Cybernetics, Decision Aiding for Complex Systems, Conference Proceedings, IEEE International Conference, 1991, vol. 1, pp. 349—354.
  20. Zha X. F., Lim S. Y. E. Assembly/disassembly task planning and simulation using expert Petri nets, International Journal of Production Research, 2000, vol. 38, no. 15, pp. 3639—3676.
  21. Lee S., Yi C., Wang F. C. Force-based reasoning for assembly planning and subassembly stability analysis, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’93), 1993, vol. 3, pp. 1582—1589.
  22. Lee S., Moradi H. Disassembly sequencing and assembly sequence verification using force flow networks, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No. 99CH36288C), 1999, vo l. 4, pp. 2762—2767.
  23. Huang Y. F., Lee C. S. G. Precedence knowl edge in feature mating operation assembly planning, 1989 IEEE Inter national Conference on Robotics and Automation, IEEE Compute r Society, 1989, pp. 216-221.
  24. Lee S., Shin Y. G. Asse mbly planning based on subassembly extraction, Proceedings, IEEE International Conference on Robotics and Automation, 1990, pp. 1606—1611.
  25. Lee S ., Shin Y. G. A cooperative planning s ystem for flexible assembly, 1990 Rensselaer’s Second International Conference on Computer Integrated Manufacturing , IEEE Computer Society, 1990, pp. 306—313.
  26. Chakrabarty S., Wolter J. A structure-oriented approach to assembly sequence planning, IEEE Transactions on Robotics and Automation, 1997, vol. 13, no. 1, pp. 14—29.
  27. Krishnan S. S., Sanderson A. C. Reasoning about geometric constraints for assembly sequence planning, ICRA, 1991, pp. 776—782.
  28. Dutta D., Woo T. C. Algorithm for multiple disassembly and parallel assemblies, The journal of engineering for industry, 1995, vol. 117, no. 1, pp. 102—109.
  29. Srinivasan H., Gadh R. Complexity reduction in geometric selective disassembly using the wave propagation abstraction, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No. 98CH36146), 1998, vol. 2, pp. 1478—1483.
  30. Srinivasan H., Gadh R. Efficient geometric disassembly of multiple components from an assembly using wave propagation, J. Mech. Des, 2000, vol. 122, no. 2, pp. 179—184.
  31. Srinivasan H., Gadh R. A non-interfering selective disassembly sequence for components with geometric constraints, IIE transactions, 2002, vol. 34, no. 4, pp. 349-361.
  32. Gould R. Graph theory, Courier Corporation, 2012.

Supplementary files

Supplementary Files
Action
1. JATS XML
Download

Copyright (c) 2026 Informacionnye Tehnologii


СМИ зарегистрировано Федеральной службой по надзору в сфере связи, информационных технологий и массовых коммуникаций (Роскомнадзор).
Регистрационный номер и дата принятия решения о регистрации СМИ: серия ПИ № 77 - 15565 от 02 июня 2003 г.