Improving LRTA*(k)
Abstract
We identify some weak points of the LRTA*(k) algorithm in the propagation of heuristic changes. To solve them, we present a new algorithm, LRTA*LS(k), that is based on the selection and up-dating of the interior states of a local space around the current state. It keeps the good theoretical prop-erties of LRTA*(k), while improving substantially its performance. It is related with a lookahead depth greater than 1. We provide experimental evidence of the benefits of the new algorithm on real-time benchmarks with respect to existing approaches.
Cite
Text
Hernández and Meseguer. "Improving LRTA*(k)." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Hernández and Meseguer. "Improving LRTA*(k)." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/hernandez2007ijcai-improving/)BibTeX
@inproceedings{hernandez2007ijcai-improving,
title = {{Improving LRTA*(k)}},
author = {Hernández, Carlos and Meseguer, Pedro},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {2312-2317},
url = {https://mlanthology.org/ijcai/2007/hernandez2007ijcai-improving/}
}