Improving LRTA*(k)
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 2312-2316.
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.
@inproceedings{ijcai2007p372,
title = {Improving LRTA*(k)},
author = {Hernandez, Carlos and Meseguer, Pedro},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {2312--2316},
year = {2007},
url = {https://ijcai.org/proceedings/2007/372},
}
TY - CPAPER TI - Improving LRTA*(k) AU - Hernandez, Carlos AU - Meseguer, Pedro T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 2312 EP - 2316 UR - https://ijcai.org/proceedings/2007/372 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: