The Fast Downward Planning System
Explore this paper's citation graph
Summary
A full account of Fast Downward's approach to solving multivalued planning tasks is given and a new non-heuristic search algorithm called focused iterative-broadening search, which utilizes the information encoded in causal graphs in a novel way is presented.
- Type
- article
- Published
- 2006-05-01
- Cited by
- 2,124
- References
- 34
- Access
- Open access
- OpenAlex
- https://openalex.org/W2161414194
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17305
Keywords
Heuristics, Incremental heuristic search, Heuristic, Axiom, Task (project management)
References
- Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework
- Local Search Topology in Planning Benchmarks: An Empirical Analysis
- A Reactive Planner for a Model-based Executive
- The FF Planning System: Fast Plan Generation Through Heuristic Search
- Tractable plan existence does not imply tractable plan generation
- A* with Partial Expansion for Large Branching Factor Problems
- State-Variable Planning Under Structural Restrictions: Algorithms and Complexity
- Planning in a Hierarchy of Abstraction Spaces
- Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae
- Downward Refinement and the Efficiency of Hierarchical Problem Solving
- A Theoretical Analysis of Conjunctive-Goal Problems
- COMPLEXITY RESULTS FOR SAS+ PLANNING
- Automatically Generating Abstractions for Planning
- The Computational Complexity of Propositional STRIPS Planning
- Planning as Search: A Quantitative Approach
- Strucutre and Complexity in Planning with Unary Operators
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
- Planning as heuristic search
- The HARPY speech recognition system
- The Deterministic Part of IPC-4: An Overview
Cited by
- Preferences, Planning and Control
- Act Local, Think Global: Width Notions for Tractable Planning
- Structural Patterns Heuristics via Fork Decomposition
- Evaluating Diversity in Classical Planning
- PLANNING, ACTING, AND LEARNING IN INCOMPLETE DOMAINS
- Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework
- AI Planning-Based Service Modeling for the Internet of Things
- Hierarchical Methods for Optimal Long-Term Planning
- Improved Features for Runtime Prediction of Domain-Independent Planners
- On the Hardness of Planning Problems with Simple Causal Graphs
- Inference and Decomposition in Planning Using Causal Consistent Chains
- Challenges of Portfolio-based Planning
- Structural Patterns of Tractable Sequentially-Optimal Planning
- Enhancing Constraint Models for Planning Problems
- A Planning Approach to Active Visual Search in Large Environments
- Evaluating Temporal Planning Domains
- The Model-Based Approach to Autonomous Behavior: A Personal View
- Monte-Carlo Exploration for Deterministic Planning
- Partial Order Reduction for Planning
- Useless Actions Are Useful
Related papers
No related papers recorded.