The fast downward planning system
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Fast planning through planning graph analysis
- Extracting mutual exclusion invariants from lifted temporal planning domains
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Formally verified algorithms for upper-bounding state space diameters
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
- Rational deployment of multiple heuristics in optimal state-space search
- Star-topology decoupled state space search
- Landmark-enhanced abstraction heuristics
- Potential-based bounded-cost search and anytime non-parametric A*
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Foundations of explanations as model reconciliation
- SAT competition 2020
- Gradient-based mixed planning with symbolic and numeric action parameters
- Dynamic term-modal logics for first-order epistemic planning
- Evaluation of the moral permissibility of action plans
- Representing and planning with interacting actions and privacy
- Landmark-based approaches for goal recognition as planning
- Computing programs for generalized planning using a classical planner
- Red-black planning: a new systematic approach to partial delete relaxation
- Automated planning as an early verification tool for distributed control
- A complete parameterized complexity analysis of bounded planning
- Bagging strategies for learning planning policies
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Robot task planning and explanation in open and uncertain worlds
- Relational reinforcement learning with guided demonstrations
- On the complexity of planning for agent teams and its implications for single agent planning
- On the importance of domain model configuration for automated planning engines
- Goal distance estimation for automated planning using neural networks and support vector machines
- The FF planning system: Fast plan generation through heuristic search
- scientific article; zbMATH DE number 1696710 (Why is no real title available?)
- Domain-independent planning for services in uncertain and dynamic environments
- Verified over-approximation of the diameter of propositionally factored transition systems
- Speeding up planning through minimal generalizations of partially ordered plans
- The LAMA planner: guiding cost-based anytime planning with landmarks
- Merge-and-Shrink Abstraction
- Efficient symbolic search for cost-optimal planning
- Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
- Continuing plan quality optimisation
- Width and serialization of classical planning problems
- Flucap: a heuristic search planner for first-order MDPS
- Marvin: a heuristic search planner with online macro-action learning
- Directing the Search in the Fast Forward Planning
- On-the-Fly Macros
- Learning heuristic functions for large state spaces
- The influence of k-dependence on the complexity of planning
- Planning in domains with derived predicates through rule-action graphs and local search
- Experimental evaluation of pheromone models in ACOPlan
- scientific article; zbMATH DE number 1943829 (Why is no real title available?)
- scientific article; zbMATH DE number 2038830 (Why is no real title available?)
- scientific article; zbMATH DE number 2038905 (Why is no real title available?)
- scientific article; zbMATH DE number 1753146 (Why is no real title available?)
- Relational reinforcement learning for planning with exogenous effects
- On the completeness of pruning techniques for planning with conditional effects
- Phase transitions of contingent planning problem
- plasp 3: towards effective ASP planning
- A human-centered data-driven planner-actor-critic architecture via logic programming
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- scientific article; zbMATH DE number 2196172 (Why is no real title available?)
- Regarding goal bounding and jump point search
- Asymmetric Action Abstractions for Planning in Real-Time Strategy Games
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
- Planning as heuristic search
- Maintenance of plan libraries for case-based planning: offline and online policies
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- Planning in artificial intelligence
- On the exploitation of control knowledge for enhancing automated planning
- Automated planning instance generation with neuro-symbolic AI
- AxSAT -- bringing axioms to SAT planning
- A correct-by-construction approach for development of reliable planning problems
- Planning for temporally extended goals in pure-past linear temporal logic
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Symbolic search for cost-optimal planning with expressive model extensions
- \textit{Explain it as simple as possible, but no simpler} -- explanation via model simplification for addressing inferential gap
- Lifted action models learning from partial traces
- Answer set planning: a survey
- Planning with mental models -- balancing explanations and explicability
- Plotting: a case study in lifted planning with constraints
- Domain-independent dynamic programming
- Generalised merge and shrink abstractions for temporal planning
- Safe learning of multi-agent action models from concurrent joint action observations
- Efficient SMT formulations for classical planning
- Planning with uncertainty: symmetries, policy inference, and solution compression
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- Long-distance mutual exclusion for planning
- Concise finite-domain representations for PDDL planning tasks
- Learning from planner performance
- Anytime heuristic search for partial satisfaction planning
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Optimal Sokoban solving using pattern databases with specific domain knowledge
- Agent planning programs
- Conformant plans and beyond: principles and complexity
- Causal graphs and structurally restricted planning
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)
