The LAMA planner: guiding cost-based anytime planning with landmarks
From MaRDI portal
Publication:3055802
Abstract: LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task. LAMA builds on the Fast Downward planning system, using finite-domain rather than binary state variables and multi-heuristic search. The latter is employed to combine the landmark heuristic with a variant of the well-known FF heuristic. Both heuristics are cost-sensitive, focusing on high-quality solutions in the case where actions have non-uniform cost. A weighted A* search is used with iteratively decreasing weights, so that the planner continues to search for plans of better quality until the search is terminated. LAMA showed best performance among all planners in the sequential satisficing track of the International Planning Competition 2008. In this paper we present the system in detail and investigate which features of LAMA are crucial for its performance. We present individual results for some of the domains used at the competition, demonstrating good and bad cases for the techniques implemented in LAMA. Overall, we find that using landmarks improves performance, whereas the incorporation of action costs into the heuristic estimators proves not to be beneficial. We show that in some domains a search that ignores cost solves far more problems, raising the question of how to deal with action costs more effectively in the future. The iterated weighted A* search greatly improves results, and shows synergy effects with the use of landmarks.
Recommendations
Cited in
(23)- Star-topology decoupled state space search
- Cost optimal planning with multi-valued landmarks
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- Planning in artificial intelligence
- Planning as satisfiability: heuristics
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- Agent planning programs
- Maintenance of plan libraries for case-based planning: offline and online policies
- Red-black planning: a new systematic approach to partial delete relaxation
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- Computing programs for generalized planning using a classical planner
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
- Selecting goals in oversubscription planning using relaxed plans
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Landmark-based approaches for goal recognition as planning
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
- Extracting mutual exclusion invariants from lifted temporal planning domains
- scientific article; zbMATH DE number 7453144 (Why is no real title available?)
- On the exploitation of control knowledge for enhancing automated planning
- Planning with Critical Section Macros: Theory and Practice
This page was built for publication: The LAMA planner: guiding cost-based anytime planning with landmarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055802)
