Hybrid Planning Heuristics Based on Task Decomposition Graphs

@inproceedings{Bercher2014HybridPH,
  title={Hybrid Planning Heuristics Based on Task Decomposition Graphs},
  author={Pascal Bercher and Shawn Keen and Susanne Biundo-Stephan},
  booktitle={SOCS},
  year={2014}
}
Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the planning domain. Our empirical evaluation shows that the proposed heuristics can significantly improve… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

UM translog: A planning domain for the development and benchmarking of planning systems

S. Andrews, B. Kettler, K. Erol, J. A. Hendler
Technical Report CSTR-3487, Department of Computer Science, Institute of Systems Research, University of Maryland. • 1995
View 5 Excerpts
Highly Influenced

On Delete Relaxation in Partial-Order Causal-Link Planning

2013 IEEE 25th International Conference on Tools with Artificial Intelligence • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…