Encoding HTN Planning as a Dynamic CSP

  • Pavel Surynek
  • Roman Barták
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

Abstract

Constraint satisfaction methodology has proven to be a successful technique for solving variety of combinatorial and optimization problems. Despite this fact, it was exploited very little in the planning domain. In particular hierarchical task network planning (HTN) [2] seems to be suitable for use of constraint programming. The formulation of HTN planning problem involves a lot of structural information which can be used to prune the search space. Encoding of this structural information by means of constraint programming would provide an effective way for such pruning during the search for solution.

References

  1. 1.
    Dechter, R., Dechter, A.: Belief Maintenance in Dynamic Constraint Networks. In: Proceedings the 7th National Conference on Artificial Intelligence (AAAI 1988), pp. 37–42 (1988)Google Scholar
  2. 2.
    Erol, K., Hendler, J., Nau, D.S.: UMCP: A Sound and Complete Procedure for Hierarchical Task Network Planning. In: Proceedings of the 2nd International Conference on AI Planning Systems (AIPS 1994), pp. 249–254 (1994)Google Scholar
  3. 3.
    Würtz, J., Müller, T.: Constructive Disjunction Revised. In: Görz, G., Hölldobler, S. (eds.) KI 1996. LNCS, vol. 1137, pp. 377–386. Springer, Heidelberg (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pavel Surynek
    • 1
  • Roman Barták
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles University in PraguePraha 1Czech Republic

Personalised recommendations