Plan Quality Optimisation via Block Decomposition

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.

Authors

• Fazlul Hasan Siddiqui Department of Computer Science and Engineering, DUET, Gazipur
• Patrik Haslum Australian National University

Keywords

No keywords are indexed for this paper.