On the application of least-commitment and heuristic search in temporal planning
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 942-946.
Abstract
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especially in temporal planning where actions have different duration. However, Graphplan backward search has some inefficiencies that impose limitations when dealing with large temporal problems. This paper presents a new search process for temporal planning to avoid these inefficiencies. This search uses the information of a planning graph and shows beneficial in the scalability of the planner. Moreover, our experiments show that a planner with this new search is competitive with other state-of-the-art planners w.r.t . the plan quality.
@inproceedings{ijcai2003p135,
title = {On the application of least-commitment and heuristic search in temporal planning},
author = {Tejero, Antonio Garrido and Onaindia, Eva},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {942--946},
year = {2003},
url = {https://ijcai.org/proceedings/2003/135},
}
TY - CPAPER TI - On the application of least-commitment and heuristic search in temporal planning AU - Tejero, Antonio Garrido AU - Onaindia, Eva T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 942 EP - 946 UR - https://ijcai.org/proceedings/2003/135 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
