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.
This work is supported by the Czech Science Foundation under the contract 201/04/1102.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Surynek, P., Barták, R. (2005). Encoding HTN Planning as a Dynamic CSP. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_106
Download citation
DOI: https://doi.org/10.1007/11564751_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)