DYNAMIC PATH PLANNING FOR A MOBILE AUTOMATON WITH LIMITED INFORMATION ON THE ENVIRONMENT

被引:180
作者
LUMELSKY, VJ [1 ]
STEPANOV, AA [1 ]
机构
[1] POLYTECH UNIV,BROOKLYN,NY 11201
关键词
COMPUTER PROGRAMMING - Algorithms - CONTROL SYSTEMS;
D O I
10.1109/TAC.1986.1104175
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of path planning is studied for the case of a mobile robot moving in an environment filled with obstacles whose shape and positions are not known. Under the accepted model, the automaton knows its own and the target coordinates, and has a 'sensory' feedback which provides it with local information on its immediate surroundings. This information is shown to be sufficient to guarantee reaching a global objective (the target), while generating reasonable (if not optimal) paths. A lower bound on the length of paths generated by any algorithm operating with uncertainty is formulated, and two nonheuristic path planning algorithms are described. In the algorithms, motion planning is done continuously (dynamically), based on the automaton's current position and on its feedback. The effect of additional sources of information (e. g. , from a vision sensor) on the outlined approach is discussed.
引用
收藏
页码:1058 / 1063
页数:6
相关论文
共 14 条
[1]  
Abelson H, 1980, TURTLE GEOMETRY
[2]  
BROOKS RA, 1982, MIT AI674 ART INT LA
[3]  
BULLOCK B, 1983, 1983 P IEEE COMP SOC
[4]  
HOPCROFT J, 1982, NOV P IEEE F COMP SC
[5]  
LOZANOPEREZ T, 1983, IEEE T COMPUT, V10
[6]  
LUMELSKY V, 1984, 84CRD070 GEN EL CORP
[7]  
LUMELSKY VJ, 1986, ADAPTIVE LEARNING SY
[8]  
LUMELSKY VJ, 1985, 8504 YAL U CTR SYST
[9]  
LUMELSKY VJ, 1986, APR P IEEE INT C ROB
[10]  
MASON MT, 1982, ROBOT MOTION