SOME HEURISTICS FOR THE NAVIGATION OF A ROBOT

被引:25
作者
CHATTERGY, R
机构
关键词
D O I
10.1177/027836498500400105
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
引用
收藏
页码:59 / 66
页数:8
相关论文
共 12 条
[1]  
ABELSON H, 1981, TURTLE GEOMETRY COMP
[2]   SOLVING THE FIND-PATH PROBLEM BY GOOD REPRESENTATION OF FREE SPACE [J].
BROOKS, RA .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1983, 13 (02) :190-197
[3]  
GIRALT G, 1979, 6TH P INT JOINT C AR, P335
[4]  
HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136
[5]  
Hollis R., 1977, BYTE, V2, P30
[6]   ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES [J].
LOZANOPEREZ, T ;
WESLEY, MA .
COMMUNICATIONS OF THE ACM, 1979, 22 (10) :560-570
[7]   SPATIAL PLANNING - A CONFIGURATION SPACE APPROACH [J].
LOZANOPEREZ, T .
IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (02) :108-120
[8]  
MORAVEC H, 1981, ROBOT ROVER VISUAL N
[9]  
MORAVEC HP, 1979, 6TH P INT JOINT C AR, P598
[10]  
MORAVEC HP, 1981, 7TH P INT JOINT C AI, P758