Corpus ID: 14029641

An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP

@inproceedings{Gerevini2009AnAC,
  title={An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP},
  author={A. Gerevini and A. Saetti and M. Vallati},
  booktitle={ICAPS},
  year={2009}
}
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP, a multi-planner which automatically configures a portfolio of planners by (i) computing some sets of macro-actions for every planner in the portfolio, (ii) selecting a promising combination of planners in the portfolio and relative useful macro-actions, and (iii) defining some running time slots for their round-robin… Expand
PbP2: Automatic Configuration of a Portfolio-based Multi-Planner
We present PbP2, an automated system that generates efficient domain-specific multi planners from a portfolio of domain-independent planning techniques by (i) computing some sets of macro-actions forExpand
Planning through Automatic Portfolio Configuration: The PbP Approach
TLDR
A multiplanner approach that automatically configures a portfolio of planning techniques for each given domain, called PbP (Portfolio-based Planner), has two variants focusing on speed and plan quality. Expand
The IBaCoP Planning System: Instance-Based Configured Portfolios
TLDR
This work creates a per-instance configurable portfolio, which is able to adapt itself to every planning task, and defines different portfolio strategies to combine the knowledge generated by the models. Expand
Challenges of Portfolio-based Planning
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 outperformsExpand
A Guide to Portfolio-Based Planning
TLDR
This work configures and exploiting a portfolio of planners to achieve better performances than any individual planner, and suggests that future challenges of Automated Planning community will converge on designing different approaches for combining existing planning algorithms. Expand
Portfolio-based planning: State of the art, common practice and open challenges
TLDR
Existing techniques are reviewed and an exhaustive guide to portfolio-based planning is provided and open issues of existing approaches are outlined and possible future evolution of these techniques are highlighted. Expand
Strategies to Configure a Portfolio
The portfolios of planners have arised as a great idea in automated planning. Their main challenge is how to combine portfolio components, i.e. the base planners. The most extended solution is theExpand
Learning Predictive Models to Configure Planning Portfolios
One of the latest advances for solving classical planning problems is the development of new approaches such as portfolios of planners. In a portfolio, different base planners are run sequentially toExpand
Generating Fast Domain-Specific Planners by Automatically Configuring a Generic Parameterised Planner
TLDR
This work proposes a general framework for automatically configuring a parameterised planner, and demonstrates that substantial performance gains can be achieved by using this highly parameterised planning system in combination with the off- the-shelf, state-of-the-art automatic algorithm configuration procedure ParamILS. Expand
Learning Portfolios of Automatically Tuned Planners
TLDR
This work lets the automatic parameter tuning framework ParamILS find fast configurations of the Fast Downward planning system for a number of planning domains and presents a portfolio planner that runs automatically configured planners. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Exploiting Competitive Planner Performance
TLDR
This research tested performance of a set of planners to determine which is best on what types of problems and implemented a meta-planner that interleaves execution of six planners on a problem until one of them solves it. Expand
Learning Partial-Order Macros from Solutions
TLDR
An automated method that learns relevant information from previous experience in a domain and uses it to solve new problem instances and introduces a heuristic technique that uses only the most promising instantiations of a selected macro for node expansion. Expand
Learning Macro-Actions for Arbitrary Planners and Domains
TLDR
This paper presents an offline macro learning method that works with arbitrarily chosen planners and domains, and generates macros from plans of some of the given problems under the guidance of a genetic algorithm. Expand
Learned Models of Performance for Many Planners
We describe a large scale study of planners and their performance: 28 planners on 4726 benchmark problems. In the first part of the paper, we apply off-the-shelf machine learning techniques to learnExpand
Learning from planner performance
TLDR
This study of existing and new problems and planners is prescriptive and prospective in that the results should help guide researchers in comparatively evaluating their planners and suggest need for additional effort. Expand
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
TLDR
The results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints. Expand
The 3rd International Planning Competition: Results and Analysis
TLDR
The paper addresses the questions of comparative performance between planners, comparative difficulty of domains, the degree of agreement between planners about the relative difficulty of individual problem instances and the question of how well planners scale relative to one another over increasingly difficult problems through statistical analysis of the raw results. Expand
6th IPC – Learning Track http://eecs.oregonstate.edu/ipc-learn
  • 2008
6th IPC – Learning Track http://eecs.oregonstate.edu/ipc-learn
  • 2008
Learning PartialOrder Macros from Solutions
  • Proc. of ICAPS-05.
  • 2005
...
1
2
...