PLANNING TIME-OPTIMAL ROBOTIC MANIPULATOR MOTIONS AND WORK PLACES FOR POINT-TO-POINT TASKS

被引：31

作者：

DUBOWSKY, S ^{[1
]}

BLUBAUGH, TD ^{[1
]}

机构：

[1] GM CORP,WARREN,MI 48090

来源：

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1989年 / 5卷 / 03期

关键词：

D O I：

10.1109/70.34775

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：377 / 381

页数：5

共 18 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

[2] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

[3]

BLUBAUGH TD, 1985, THESIS MIT CAMBRIDGE

[4]

BOBROW JE, 1985, INT J ROBOTICS RES, V4

[5]

BOBROW JE, 1983, 1983 P AM CONTR C SA

[6]

DUBOWSKY S, 1986, APR P IEEE INT C ROB, P1906

[7]

DUBOWSKY S, 1985, 24TH P IEEE C DEC CO

[8]

DUBOWSKY S, 1985, CISMIFTOMM S THEORY

[9]

Grossman D. D., 1985, Robotics and Computer-Integrated Manufacturing, V2, P135, DOI 10.1016/0736-5845(85)90069-9

[10]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]