In the recent years the field of automated planing has significantly advanced and several powerful domain-independent planners have been developed. However, none of these systems clearly outperforms all the others in every known benchmark domain. This observation motivated the idea of configuring and exploiting a portfolio of planners to achieve better performances than any individual planner: some recent planning systems based on this idea obtained significantly good results in experimental analysis and International Planning Competitions. Such results lead us to think that future challenges for the automated planning community will converge on designing different approaches for combining existing planning algorithms.
This paper focuses on the challenges and open issues of existing approaches and highlights the possible future evolution of these techniques. In addition the paper introduces algorithm portfolios, reviews existing techniques, and describes the decisions that have to be taken during the configuration.
Downloads
Downloads per month over past year