Factored Planning Using Decomposition Trees
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1942-1946.
Abstract
Improving AI planning algorithms relies on the ability to exploit the structure of the problem at hand. A promising direction is that of factored planning, where the domain is partitioned into subdomains with as little interaction as possible. Recent work in this field has led to an detailed theoretical analysis of such approaches and to a couple of high-level planning algorithms, but with no practical implementations or with limited experimentations. This paper presents dTreePlan, a new generic factored planning algorithm which uses a decomposition tree to efficiently partition the domain. We discuss some of its aspects, progressively describing a specific implementation before presenting experimental results. This prototype algorithm is a promising contribution---with major possible improvements---and helps enrich the picture of factored planning approaches.
@inproceedings{ijcai2007p313,
title = {Factored Planning Using Decomposition Trees},
author = {Kelareva, Elena and Buffet, Olivier and Huang, Jinbo and Thiébaux, Sylvie},
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 = {1942--1946},
year = {2007},
url = {https://ijcai.org/proceedings/2007/313},
}
TY - CPAPER TI - Factored Planning Using Decomposition Trees AU - Kelareva, Elena AU - Buffet, Olivier AU - Huang, Jinbo AU - Thiébaux, Sylvie T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1942 EP - 1946 UR - https://ijcai.org/proceedings/2007/313 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
