• Corpus ID: 12836943

Hybrid techniques for classical planning

  title={Hybrid techniques for classical planning},
  author={Nathaniel Waisbrot},
Two common types of planning systems are “domainindependent” and “domain-configurable”. Domainconfigurable planners can perform very well, but require much hand-tuning for peak performance. Domainindependent planners do not require human aid, but do not perform as well on some problems. Hybrid planners attempt to combine the strengths of these two styles while minimizing their weaknesses. 
1 Citations

Figures from this paper

Rule Based Planning for Solving Hanoi Problem
The planning intelligence technique has been developed and applied to solve the tower of Hanoi puzzle through the construction of the rule based included a set of facts and rules under certain conditions to describe this problem.


Practical planning - extending the classical AI planning paradigm
  • D. Wilkins
  • Psychology
    Morgan Kaufmann series in representation and reasoning
  • 1988
1 Reasoning about Actions and Planning 2 Basic Assumptions and Limitations 3 SIPE and Its Representations 4 Hierarchical Planning as Differing Abstraction Levels 5 Constraints 6. The Truth Criterion
Using Component Abstraction for Automatic Generation of Macro-Actions
This paper presents component abstraction, an automatic and generic technique that can reduce the complexity of an important class of planning problems and show an impressive potential for macro operators to reduce the search complexity and achieve more stable performance.
Hybrid Planning for Partially Hierarchical Domains
This paper provides a generalized plan-space refinement that is capable of handling non-primitive actions and provides a principled way of handling partially hierarchical domains, while preserving systematicity, and respecting the user-intent inherent in the reduction schemas.
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Duet is presented, a planning system that incorporates the ability of using hierarchical domain knowledge in the form of Hierarchical Task Networks (HTNs) as in SHOP2 and using domain-independent local search techniques as in LPG.
O-Plan: The open Planning Architecture
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
Two automated methods that learn relevant information from previous experience in a domain and use it to solve new problem instances are presented and compared and indicate a large reduction in search effort in those complex domains where structural information can be inferred.
Automatic Synthesis and Use of Generic Types in Planning
An interesting property of the work described here is that domain components which would not easily be recognised, by the human, as transportation problems can turn out to have an underlying transportation character which can be exploited by the application of standard transportation domain heuristics.
The FF Planning System: Fast Plan Generation Through Heuristic Search
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.
Fast Planning Through Planning Graph Analysis
Learning and Executing Generalized Robot Plans