Improving LRTA*(k) by Eacapsing from the Trap of h-surface
LRTA* is a real time heuristic search algorithm widely used for agent find path on unknown maps, which is special case of LRTA*(k) with k=. In each iteration, it updates the heuristic estimate of the k states. Our Adaptive LRTA*(k) (abbr. ALATA*(k))) update the k states according the history of visited states which means the special terrain. Our update-strategy maintains heuristic admissibility. ALATA*(k) update heuristic value of more states just as LRTA*(k) when the agent stuck into a local trap of heuristic surface, also keep the good theoretical properties of LRTA* when there are few obstacles. Experimentally, we show that the ALATA*(k) produces better solution in the first trial than LRTA*, While reduced the number of expanded states of LRTA*(k).
LRTA* LRTA*(k) adadptive visited history hvalue sutface heuristic search
Shaohan Liu Zhiqiu Huang
College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
国际会议
重庆
英文
251-254
2011-01-21(万方平台首次上网日期,不代表论文的发表时间)