THE APPLICATION OF INVERSE KINEMATICS IN THE OPTIMUM SEQUENCING OF ROBOT TASKS

被引:22
作者
ABDELMALEK, LL
LI, ZM
机构
[1] Division of Industrial and Management Engineering, New Jersey Institute of Technology, Newark, NJ
[2] Department of Industrial Mechanics, Wuhan Institute of Technology, Wuhan, PR
关键词
D O I
10.1080/00207549008942685
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses one of the operational problems associated with the application of robots to industrial systems: the optimum sequencing of robotic task performance. The application of inverse kinematics in determining the sequence that minimizes the cycle time in a robot cell is described. An extension of the Travelling Salesman Algorithm is found to be suitable for obtaining the optimum sequence and cycle time. © 1990 Taylor & Francis Group, LLC.
引用
收藏
页码:75 / 90
页数:16
相关论文
共 20 条
  • [1] Abdel-Malek L., A framework for the robotic assembly of parts with general geometry, International Journal of Production Research, 25, 5, pp. 1025-1041, (1986)
  • [2] Abdel-M Alek L., Li Z., Robot location for minimum cycle time, Working Seminar on Production Economics, pp. 15-25, (1989)
  • [3] Baker K., Introduction to Sequencing and Scheduling, (1974)
  • [4] Drezner Z., Nof S., On optimum bin picking and insertion plans for assembly robots, HE Transactions, 16, 3, pp. 262-270, (1984)
  • [5] Dubowsky S., Blubaugh T., Time optimal robotic manipulator motions and work places for point to point tasks, Proceedings of the 24Th Conference, pp. 1533-1538, (1985)
  • [6] French S., Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop, (1982)
  • [7] Gavish B., Sfikauth K., An optimum solution method for large scale Traveling Salesman problem, Operations Research, 34, 5, pp. 698-717, (1986)
  • [8] Graves S., Lamar B., An integer programming procedure for assembly system design problems, Operations Research, 31, 3, pp. 522-545, (1983)
  • [9] Groover M., Weiss M., Nagel R., Odery N., Industrial Robotics, (1986)
  • [10] Held M., Karp R., The Traveling Salesman problem and minimum spanning trees, Operations Research, 18, 6, pp. 1126-1138, (1970)