Hierarchical task planning under uncertainty
Abdelbaki Bouguerra, Lars Karlsson · 2004
In this paper we present an algorithm for planning in nondeterministic domains. Our algorithm C-SHOP extends the successful classical HTN planner SHOP, by introducing new mechanisms to handle situations where there is incomplete and uncertain information about the state of the environment. Being an HTN planner, C-SHOP supports coding domain-dependent knowledge in a powerful way that describes how to solve the planning problem.