Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Fast planning through planning graph analysis
Artificial Intelligence
Fast planning through greedy action graphs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Automatic Generation of User Adapted Learning Designs: An AI-Planning Proposal
AH '08 Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The PELA architecture: integrating planning and learning to improve execution
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
An approach to temporal planning and scheduling in domains with predictable exogenous events
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Flaw selection strategies for partial-order planning
Journal of Artificial Intelligence Research
Domain independent approaches for finding diverse plans
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning with partial preference models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hi-index | 0.00 |
Planning through local search and action graphs is a powerful approach to fully-automated planning which is implemented in the well-known LPG planner. The approach is based on a stochastic local search procedure exploring a space of partial plans and several heuristic features with different possible options. In this paper, we experimentally analyze the most important of them, with the goal of understanding and evaluating their impact on the performance of LPG, and of identifying default settings that work well on a large class of problems. In particular, we analyze several heuristic techniques for (a) evaluating the search neighborhood, (b) defining/restricting the search neighborhood, (c) selecting the next plan flaw to handle, (d) setting the “noise” parameter randomizing the search, and (e) computing reachability information that can be exploited by the heuristic functions used to evaluate the neighborhood elements. Some of these techniques were introduced in previous work on LPG, while others are new. Additional experimental results indicate that the current version of LPG using the identified best heuristic techniques as the default settings is competitive with the winner of the last (2008) International Planning Competition.