A lookahead strategy for solving large planning problems
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1524-1524.
Abstract
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information from the relaxed plan and for dealing with helpful actions, by considering the high quality of the relaxed plans. In numerous domains, the performance of heuristic search planning and the size of the problems that can be handled have been drastically improved.
Vincent Vidal. 2003. A lookahead strategy for solving large planning problems. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1524–1524. https://ijcai.org/proceedings/2003/260
Vidal, V. (2003). A lookahead strategy for solving large planning problems. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 (pp. 1524–1524). IJCAI. https://ijcai.org/proceedings/2003/260
@inproceedings{ijcai2003p260,
title = {A lookahead strategy for solving large planning problems},
author = {Vidal, Vincent},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1524--1524},
year = {2003},
url = {https://ijcai.org/proceedings/2003/260},
}
TY - CPAPER TI - A lookahead strategy for solving large planning problems AU - Vidal, Vincent T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1524 EP - 1524 UR - https://ijcai.org/proceedings/2003/260 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
