MULTIRESOLUTION PATH PLANNING FOR MOBILE ROBOTS

被引：180

作者：

KAMBHAMPATI, S ^{[1
]}

DAVIS, LS

机构：

[1] UNIV MARYLAND, CTR AUTOMAT RES, COMP VIS LAB, COLLEGE PK, MD 20742 USA

[2] UNIV MARYLAND, INST ADV COMP STUDIES, COLLEGE PK, MD 20742 USA

来源：

IEEE JOURNAL OF ROBOTICS AND AUTOMATION | 1986年 / 2卷 / 03期

关键词：

D O I：

10.1109/JRA.1986.1087051

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：135 / 145

页数：11

共 21 条

[1] SOLVING THE FIND-PATH PROBLEM BY GOOD REPRESENTATION OF FREE SPACE
BROOKS, RA
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1983, 13 (02): : 190 - 197
[2] BROOKS RA, 1983, 8TH P INT JOINT C AR
[3] DAVIS LS, 1985, MAR P IEEE INT C ROB
[4] FAVERJON B, 1984, MAR P IEEE INT C ROB
[5] HOROWITZ E, 1982, FUNDAMENTALS DATA ST, pCH6
[6] KAMBHAMPATI S, 1985, THESIS U MARYLAND CO
[7] AUTOMATIC PLANNING OF MANIPULATOR TRANSFER MOVEMENTS
LOZANOPEREZ, T
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1981, 11 (10): : 681 - 698
[8] ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES
LOZANOPEREZ, T
WESLEY, MA
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (10) : 560 - 570
[9] MORAVEC HP, 1981, 7TH P INT JOINT C AR
[10] NILSSON NJ, 1980, PRINCIPLES ARTIFICIA, pCH2