Abstract
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 achieved significantly good results in experimental analysis and International Planning Competitions. Such results let suppose that future challenges of Automated Planning community will converge on designing different approaches for combining existing planning algorithms.
This paper reviews existing techniques and provides an exhaustive guide to portfolio-based planning. In addition, the paper outlines open issues of existing approaches and highlights possible future evolution of these techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129, 5–33 (2001)
Coles, A., Coles, A., Olaya, A.G., Jiménez, S., Lòpez, C.L., Sanner, S., Yoon, S.: A survey of the seventh international planning competition. AI Magazine 33, 83–88 (2012)
Fern, A., Khardon, R., Tadepalli, P.: The first learning track of the international planning competition. Machine Learning 84, 81–107 (2011)
Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research (JAIR) 20, 239–290 (2003)
Gerevini, A., Saetti, A., Vallati, M.: An automatically configurable portfolio-based planner with macro-actions: PbP. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 350–353 (2009)
Gerevini, A., Saetti, A., Vallati, M.: PbP2: Automatic configuration of a portfolio-based multiplanner. In: Working notes of 21st International Conference on Automated Planning and Scheduling (ICAPS 2011) 7th International Planning Competition (2011)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers (2004)
Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2), 43–62 (2001)
Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research (JAIR) 26, 191–246 (2006)
Helmert, M., Röger, G., Karpas, E.: Fast Downward Stone Soup: A baseline for building planner portfolios. In: Proceedings of the ICAPS 2011 Workshop of AI Planning and Learning, PAL (2011)
Howe, A., Dahlman, E.: A critical assessment of benchmark comparison in planning. Journal of Artificial Intelligence Research (JAIR) 17, 1–33 (2002)
Howe, A., Dahlman, E., Hansen, C., von Mayrhauser, A., Scheetz, M.: Exploiting Competitive Planner Performance. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol. 1809, Springer, Heidelberg (2000)
Huberman, B., Lukose, R., Hogg, T.: An economics approach to hard computational problems. Science 265, 51–54 (1997)
Nakhost, H., Müller, M.: Monte-carlo exploration for deterministic planning. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1766–1771 (2009)
Nell, C., Fawcett, C., Hoos, H.H., Leyton-Brown, K.: HAL: A framework for the automated analysis and design of high-performance algorithms. In: Proceedings of the 5th International Conference on Learning and Intelligent Optimization (LION-5), pp. 600–615 (2011)
Newton, M.H., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 256–263. AAAI (2007)
Núnez, S., Borrajo, D., Lòpez, C.L.: How good is the performance of the best portfolio in ipc-2011? In: Proceedings of ICAPS 2012 Workshop on International Planning Competition (2012)
Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)
Richter, S., Westphal, M.: The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research (JAIR) 39, 127–177 (2010)
Roberts, M., Howe, A.: Learned models of performance for many planners. In: Proceedings of the ICAPS 2007 Workshop of AI Planning and Learning, PAL (2007)
Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: Proceedings of the 22nd International Conference on Automated Planning & Scheduling, ICAPS 2012 (2012)
Valenzano, R., Nakhost, H., Müller, M., Schaeffer, J., Sturtevant, N.: Arvandherd: Parallel planning with a portfolio. In: Proceedings of the 20st European Conference on AI, ECAI 2012 (2012)
Vallati, M., Fawcett, C., Gerevini, A., Hoos, H., Saetti, A.: Automatic generation of efficient domain-specific planners from generic parametrized planners. In: Proceedings of the 18th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2011)
Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research (JAIR) 32, 565–606 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vallati, M. (2012). A Guide to Portfolio-Based Planning. In: Sombattheera, C., Loi, N.K., Wankar, R., Quan, T. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2012. Lecture Notes in Computer Science(), vol 7694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35455-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-35455-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35454-0
Online ISBN: 978-3-642-35455-7
eBook Packages: Computer ScienceComputer Science (R0)