OPTIMAL PIECEWISE LINEAR MOTION OF AN OBJECT AMONG OBSTACLES

被引:9
作者
PAPADIMITRIOU, CH
SILVERBERG, EB
机构
关键词
D O I
10.1007/BF01840372
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:523 / 539
页数:17
相关论文
共 22 条
[1]  
Asano T., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P155, DOI 10.1109/SFCS.1985.65
[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]  
Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390
[4]  
FREDMAN ML, 1984, 25TH P IEEE S F COMP
[5]   FINDING MINIMUM RECTILINEAR DISTANCE PATHS IN THE PRESENCE OF BARRIERS [J].
LARSON, RC ;
LI, VOK .
NETWORKS, 1981, 11 (03) :285-304
[6]  
LEVEN D, 1984, EFFICIENT SIMPLE MOT
[7]   ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES [J].
LOZANOPEREZ, T ;
WESLEY, MA .
COMMUNICATIONS OF THE ACM, 1979, 22 (10) :560-570
[8]  
MITCHELL JSB, 1986, SHORTEST RECTILINEAR
[9]  
MITCHELL JSB, 1985, UNPUB DISCRETE GEODE
[10]  
MITCHELL JSB, 1986, THESIS STANFORD U