Montaj sırası planlama yaklaşımları - I: Graf temelli, algoritmik ve elle yapılan montaj metodları

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 seviyesine 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. Montaj sırası planlama: (a) elle veya (b) bilgisayar destekli yapılabilir. Elle yapılacak montaj sırası planlama; zor, zaman alıcı ve oldukça uzmanlık gerektirmektedir. Bilgisayar destekli montaj sırası planlama ise; BDT modelini kullanarak yarı otomatik (kullanıcı katkısı gerekli) veya tam otomatik (kullanıcı katkısı gerekmeyen) olabilmektedir. Bu makalede montaj sıra planlaması konusunda yapılan bir kaynak araştırma çalışmasının ilk kısmı tanıtılmaktadır. Bu kısım kapsamında graf temelli, elle ve algoritmik yaklaşımlar ele alınmıştır. Graf temelli yaklaşımlar; AND/OR grafı, yön grafı, temas grafları, yönsüz bloklama grafları, petri ağları ve öncelik grafları şeklinde tasnif edilmiştir. Elle veya algoritmik yaklaşımlar ise, öncelik diyagramı ve bağlantı sıralama metodunu içermektedir. Bu yaklaşımların öz bir inceleme, değerlendirme ve karşılaştırmaları da makale kapsamında verilmektedir.

A Review of assembly sequence planning approaches - I: Graph - based, manual and algoritmic methods

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 the system. Assembly sequence planning is the choice of the most suitable and optimum one. It can be conducted by: (a) manually or (b) computer aided. Computer aided assembly sequence planning can be performed by the use of CAD model either semi-automatic (requiring user interference) or full automatic (without user interference). This paper describes the first part of a literature review conducted on the assembly sequence planning. Within the context of this part, the approaches of graph - based and manual or algorithmic are examined. Graph - based approaches include: AND/OR graph, directed graph, contact graphs, undirected blocking graphs, petri nets and precedence graphs. Manual or algorithmic approaches include: precedence diagrams and the method of liaison -sequence. A brief examination and evaluation of these approaches are also given in the paper.

___

  • 1. Nalbant, M., Bilgisayar Bütünleşik Tasarım ve İmalat, Beta Basım Yayım Dağıtım A. Ş., İstanbul, 1997.
  • 2. Whitney, D.E., Mantripragada, R., Adams, J.D. and Rhee, S.J, Designing Assemblies, Research in Engineering Design, 11: 229253, 1999.
  • 3. Homem de Mello, L.S. and Sanderson, A.C., AND/OR graph Representation of Assembly Plans, IEEE Transactions on Robotics and Automation, 6, 2, 188-199, April 1990.
  • 4. Homem de Mello, L.S. and Lee, S., Computer Aided Mechanical Assembly Planning, by Kluwer Academic Publishers, 130-162, 1991.
  • 5. Jentsch, F. K., Automatic generation of Assembly Sequences, Art. Int. and Inf. Control Systems of Robots, Tchecoslovaquie, 197-200, 1984.
  • 6. Wolter, J., On the Automatic Generation of Plans for Mechanical Assembly, PhD Thesis, University of Michigan, Dept. Of Computer, Information and Control Engineering, USA, September 1988.
  • 7. Homem De Mello, L. S. and Sanderson, A. C., A correct and complete algorithm for the generation of mechanical assembly sequences, Proceedings IEEE International Conference on Robotics and Automation, 1,56-61, 1989.
  • 8. Homem de Mello, L. S., Task Sequence planning for Robotic Assembly, PhD Thesis, Carneige Mellon University, USA, May 1989.
  • 9. Lin, T., and Chang, C., 3D: Maps, Three Dimensional Mechanical Assembly Planning System, Journal of Manufacturing Systems, 12, 437-456, 1993.
  • 10. Miller, Hoffman, R.L., Automatic Assembly Planning with Fasteners, Proceedings, IEEE International Conference on Robotics and Automation, 1, 69-74, 1989.
  • 11. Hoffman, R.L., Automated Assembly Planning for B-rep products, Proceedings 2nd. IEEE International Conference on Systems Engineering, 391-394, 1990.
  • 12. Lee, S. and Shin, Y.G., Assembly Planning Based on Geometric Reasoning, Computers and Graphics, 1, 12, 2, 237-250, 1990.
  • 13. Subramani, A.K. and Dewhurst, P., Automatic Generation of Product Disassembly Sequences, Manufacturing Technology CIRP Annals, 40, 1,115-118,1991.
  • 14. Goldwasser, M., An Implementation for maintains ingarrangements of polygons, Communications in Proceedings, 11 th Annual ACM Symposium on Computational Geometry, 235-244, 1995.
  • 15. Ramkumar, G.D., Efficient Algorithms to compute convolutions of non-convex polyhedra, Manuscript, Department of Computer Science, Stanford University, Stanford, C.A., USA, 22-37,1994.
  • 16. Romney, B., Godard, C., Goldwasser, M. and Ramkumar, G., An Efficient System for Geometric Assembly Sequence Generation and Evaluation, Proc. International Computers in Engineering Conf, Computer Science Department Stanford University, C.A., USA,699-712, 1995.
  • 17. Wilson, R., On Geometric Assembly Planning, PhD. Thesis, Stanford University, Stanford C.A., USA, 1992.
  • 18. Thomas, J.P, Constructing Assembly Plans, IEEE Int. Conf. on Robotics and Automation, Atlanta, G.A., USA, 515-420, May 1993.
  • 19. 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.
  • 20. 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, 239-244, August 1991.
  • 21. 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.
  • 22. Thomas, J.P., A Petri Net Framework for Representing Mechanical Assembly Sequences, IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, Raleigh, NC, 2116-2121, July 1992.
  • 23. Groppetti, R., Santucci, A. and Senin, N., On the Application of Coloured Petri Nets to Computer Aided Assembly Planning, IEEE Symp. On Emerging Technologies&Factory Automation, Tokyo, Japan, 381-387,November 1994.
  • 24. Lee, S., Backward Assembly Planning with Assembly Cost Analysis, IEEE Int. Conf. on Robotics and Automation, Nice, France, 2382-2391, May 1992.
  • 25. Zeid, I., CAD/CAM Theory and Practice, McGraw-Hill, Inc., Press, New York, 1991.
  • 26. Xia, X. and Bekey, G.A., SROMA: An adeptive schedular for robotic assembly systems, in IEEE Int. Conf. On Robotics and Automation, 1802-1810, 1988.
  • 27. Fazio, D. and Whitney, D.E., Simplified generation of all mechanical assembly sequences, IEEE J. Robotics and Automation, R.A.3, 640-658, December 1987.
  • 28. Sekigushi, H. et. al., Study on Automatic Determination of Assembly sequences, Annals of the CIRP, 32, 1, 371-374, 1983
  • 29. Jones, R.E., Wilson, R.H. and Calton, T.L., Contraint-Based Interactive Assembly Planning, Intelligent Systems and Robotics Center Sandia National Laboratories, Albuquerque,NM, 1995.
  • 30. Sinanoğlu, C. ve Börklü, H.R., Montaj Sırası Planlama Yaklaşımlar II: BDT Verisi Kullanan, Yapay Zeka, Unsur Tabanlı, Özel Veri Yapıları Kullanan, Dil Temsil ve Sıralı Liste Metotları (G.Ü.Teknik Eğitim Fakültesi Politeknik Dergisi tarafından 2001 yılında yayınlanmak üzere kabul edildi).