Plan Quality Optimisation via Block Decomposition
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 2387-2392.
Abstract
AI planners have to compromise between the speed of the planning process and the quality of the generated plan. Anytime planners try to balance these objectives by finding plans of better quality over time, but current anytime planners often do not make effective use of increasing runtime beyond a certain limit. We present a new method of continuing plan improvement, that works by repeatedly decomposing a given plan into subplans and optimising each subplan locally. The decomposition exploits block-structured plan deordering to identify coherent subplans, which make sense to treat as units. This approach extends the anytime capability of current planners - to provide continuing plan quality improvement at any time scale.
@inproceedings{ijcai2013p351,
title = {Plan Quality Optimisation via Block Decomposition},
author = {Siddiqui, Fazlul Hasan and Haslum, Patrik},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {2387--2392},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/351},
}
TY - CPAPER TI - Plan Quality Optimisation via Block Decomposition AU - Siddiqui, Fazlul Hasan AU - Haslum, Patrik T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 2387 EP - 2392 UR - https://ijcai.org/proceedings/2013/351 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
