The fast downward planning system
From MaRDI portal
Publication:3624014
zbMATH Open1182.68245arXiv1109.6051MaRDI QIDQ3624014FDOQ3624014
Authors: Malte Helmert 
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1109.6051
Recommendations
Cited In (82)
- The LAMA planner: guiding cost-based anytime planning with landmarks
- Title not available (Why is that?)
- Speeding up planning through minimal generalizations of partially ordered plans
- Width and serialization of classical planning problems
- Landmark-based approaches for goal recognition as planning
- Verified over-approximation of the diameter of propositionally factored transition systems
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Anytime heuristic search for partial satisfaction planning
- Long-distance mutual exclusion for planning
- Goal distance estimation for automated planning using neural networks and support vector machines
- Planning as heuristic search
- Relational reinforcement learning with guided demonstrations
- Learning heuristic functions for large state spaces
- The influence of \(k\)-dependence on the complexity of planning
- Experimental evaluation of pheromone models in ACOPlan
- Planning in domains with derived predicates through rule-action graphs and local search
- Domain-independent planning for services in uncertain and dynamic environments
- Optimal Sokoban solving using pattern databases with specific domain knowledge
- A complete parameterized complexity analysis of bounded planning
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Star-topology decoupled state space search
- Rational deployment of multiple heuristics in optimal state-space search
- Merge-and-Shrink Abstraction
- Optimal admissible composition of abstraction heuristics
- Foundations of explanations as model reconciliation
- Concise finite-domain representations for PDDL planning tasks
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Learning from planner performance
- Red-black planning: a new systematic approach to partial delete relaxation
- Extracting mutual exclusion invariants from lifted temporal planning domains
- On the complexity of planning for agent teams and its implications for single agent planning
- Potential-based bounded-cost search and anytime non-parametric A*
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Marvin: a heuristic search planner with online macro-action learning
- Robot task planning and explanation in open and uncertain worlds
- Formally verified algorithms for upper-bounding state space diameters
- Conformant plans and beyond: principles and complexity
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- Agent planning programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the completeness of pruning techniques for planning with conditional effects
- Phase transitions of contingent planning problem
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
- Efficient symbolic search for cost-optimal planning
- Computing programs for generalized planning using a classical planner
- plasp 3: towards effective ASP planning
- Evaluation of the moral permissibility of action plans
- Landmark-enhanced abstraction heuristics
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- The FF planning system: Fast plan generation through heuristic search
- Dynamic term-modal logics for first-order epistemic planning
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Title not available (Why is that?)
- Fast planning through planning graph analysis
- Causal graphs and structurally restricted planning
- Flucap: a heuristic search planner for first-order MDPS
- Relational reinforcement learning for planning with exogenous effects
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- SAT competition 2020
- Gradient-based mixed planning with symbolic and numeric action parameters
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- Directing the Search in the Fast Forward Planning
- Asymmetric Action Abstractions for Planning in Real-Time Strategy Games
- Automated planning as an early verification tool for distributed control
- Planning in artificial intelligence
- Title not available (Why is that?)
- Bagging strategies for learning planning policies
- Regarding goal bounding and jump point search
- Title not available (Why is that?)
- On the importance of domain model configuration for automated planning engines
- Representing and planning with interacting actions and privacy
- Title not available (Why is that?)
- Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
- On-the-Fly Macros
- Continuing plan quality optimisation
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- On the exploitation of control knowledge for enhancing automated planning
- Maintenance of plan libraries for case-based planning: offline and online policies
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
This page was built for publication: The fast downward planning system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624014)
