Encoding HTN Planning as a Dynamic CSP

Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal is an application of the CSP formalism on hierarchical task network planning domain. An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reduction through constraint propagation. The paper also deals with a search strategy and constraint combination suitable for the model.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Pavel Surynek, Roman Barták
• Keywords: Constraint Satisfaction Problems, CP 2005, CSP Formalism, HTN Planning Problems, Programming Languages