Rizzini, Mattia, Fawcett, Chris, Vallati, Mauro, Gerevini, Alfonso and Hoos, Holger (2017) Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis. International Journal on Artificial Intelligence Tools, 26 (1). ISSN 0218-2130
Abstract

Combining the complementary strengths of several algorithms through portfolio approaches has been demonstrated to be effective in solving a wide range of AI problems. Notably, portfolio techniques have been prominently applied to suboptimal (satisficing) AI planning.

Here, we consider the construction of sequential planner portfolios for domainindependent optimal planning. Specifically, we introduce four techniques (three of which are dynamic) for per-instance planner schedule generation using problem instance features, and investigate the usefulness of a range of static and dynamic techniques for combining planners. Our extensive empirical analysis demonstrates the benefits of using static and dynamic sequential portfolios for optimal planning, and provides insights on the most suitable conditions for their fruitful exploitation.

Information
Library
Documents
[img]
Preview
optimalPlanningPortfolioAnalysis.pdf - Accepted Version

Download (437kB) | Preview
Statistics

Downloads

Downloads per month over past year

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email