SavedAdd your journal

Journals / Politeknik Dergisi / 2001 / Cilt: 4 - Sayı: 1

Directed graph representations of assembly sequence planning and a case study

Bilgisayar destekli montaj sırası planlamada yön graf temsili ve bir örnek çalışma

Hüseyin R. BÖRKLÜ
CEM SİNANOĞLU
Pages
1–11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Seven assembly plans are obtained for this sample assembly.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:An ordered and sequenced connection process of various components existing in a system is known as assembly.
📊
Key Findings & Data:Components can be put together many different forms depending on the complexity level of system.
💡
Conclusion & Impact:Seven assembly plans are obtained for this sample assembly.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

An ordered and sequenced connection process of various components existing in a system is known as assembly. Components can be put together many different forms depending on the complexity level of system. Assembly sequence planning is the choice of the most suitable and optimum one. This paper describes a graph based approach that provides an efficient method for the assembly sequence planning. Components existed in the assembly and the relationships between them are represented by assembly connection graph and possible assembly sequence plans are represented by the use of a directed graph. Within this approach, each assembly state is represented by the decomposition of component sets. Constraints, including sub-assembly, stability, suitability of geometric and mechanic, are used for the establishment of component subsets that do not represent an assembly state. The hierarchical levels are used for the representations of directed graphs of feasible assembly sequences. It is also shown that how to approach can be used for the generation of assembly sequence plans of a device consisting of four components. Seven assembly plans are obtained for this sample assembly.

Özet

Bir sistemde yer alan çeşitli parçaların belirli bir sıra ve düzen içinde birleştirilme işlemine montaj denir. Sistemin karmaşıklık düzeyine bağlı olarak parçaların birleştirilme sırası birçok ve farklı şekillerde yapılabilir. Bu sıralardan en uygun ve optimumunun seçimine montaj sırası planlama denmektedir. Bu makalede graf temelli metodlar kullanılarak montaj sırası planlamaya etkin çözümler sağlayacak bir yöntem araştırılmıştır. Montajı oluşturan parçalar ve parçalar arası ilişkiler, montaj bağlantı grafı ve montaj sıraları ise, yön grafı kullanılarak temsil edilmiştir. Her bir montaj durumu, parça küme ayrışmaları ile gösterilmektedir. Birleştirilemeyecek parça alt kümeleri; alt-montaj, stabilite, geömetrik ve mekanik uygunluk sınırlayıcıları kullanılarak belirlenmektedir. Uygun montaj sıralamalarının yön graf temsilini oluşturmada, hiyerarşik seviyeler dikkate alınmıştır. Yaklaşımın dört parçadan oluşan bir pense montaj sıralarını belirlemede nasıl kullanılacağı da gösterilmiştir. Bu örnek montaj için yedi adet uygun montaj sırası elde edilmiştir.

🔖

Cite This Article

BÖRKLÜ, H. R., SİNANOĞLU, C. (2001). Directed graph representations of assembly sequence planning and a case study. Politeknik Dergisi, Cilt: 4 - Sayı: 1, 1–11. https://ajindex.com/articles/306954

References (17)

  1. Pahl, G. and Beitz, W., Engineering Design, The Design Council, Springer- Verlag, London, 1988
  2. Singh, N., Systems Approach to Computer Integrated Design and Manufacturing, John Wiley & Sons, Inc., International Ed., 1997
  3. Boothroyd, G., Product design for manufacture and assembly, CAD, 26, 7, 505-509, 1994
  4. O'Grady, P. vd., A review of approaches for assembly, Concurent Engineering, 1,3, 5-11, 1991
  5. Laperriere, L. and ElMarghy, A., Assembly sequence planning for simultaneous engineering, Int. J. Adv. Manuf. Technoloy, Springer - Verlag London Limited, 9: 231-244, 1994
  6. Lin, A. C. and Chang, T. C., A framework for automated mechanical assembly planning, J. of Mech. Working Technology, 20, 237-248, 1989
  7. Seow, K. T. and Devanathon, R., Temporal logic programming for assembly sequence planning, AI in Engineering, 1994 Elsevier Science Lim., 8, 253-263, 1993
  8. Kandi, S. and Makino, H., ASPEN: Computeraided assembly sequence planning and evaluation system based on predetermined time standard, Annals of the CIRP, 45, 1, 35-39, 1996
  9. Garrod, W. and Everett, L. J., A.S.A.P.: Automated sequential assembly planner, Comp. in Eng., ASME, Ed. G. L. Kinzel Smrophe, 1, 139-150, 1990
  10. Thomas J.P., vd., Computer Aided Mechanical Assembly Planning, Kulwer Academic Publishers, 1991
  11. De Fazio, T.L. and Whitney, D. E., Simplified generation of all mechanical assembly sequences, IEEE Trans, on Robotics and Automation, 3, 6, 640-658, 1987
  12. Homem de Mello, L. S. and Sanderson, A. C., A correct and complete algorithm for the generation of mechanical assembly sequences, IEEE Trans. On Robotics and Automation, 7, 2, 228-240, 1991. 13.Homem de Mello, L.S. and Lee, S., Computeraided mechanical assembly planning, Kulwer Academic Publishers, Massachusetts, 1991
  13. Homem de Mello, L.S. and Arthur, C.D., AND/OR graph representation of assembly plans, IEEE Trans. On Robotics and Automation, 6, 2, 188-199, 1990
  14. Zhang, W., Representation of assembly and automatic robot planning by Petri Net, IEEE Trans. On Systems, Man, and, Cybernetics, 19,2, 418-422, March 1989
  15. Cao, T. and Sanderson, A.C., Task sequence planning in a robot workcell using AND/OR Nets, IEEE Int. Symp. On Intelligent Control, Arlington, VA, August 1991
  16. Suzuki, T., Kanehara, T., Inaba, A. and Okuma, S., On algebraic and graph structural properties of assembly Petri Nets, IEEE Int. Conf. on Robotics and Automation, Atlanta, GA, 507-514, May 1993
  17. Lee, S. and Shin, Y.G.