A hierarchical task-network planner based on Symbolic Model Checking
Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso · 2005
Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a novel algorithm, called YoYo, for planning in nondeterministic domains under the assumption of full observability. This algorithm enables us to combine the power of search-control strategies as in Planning with Hierarchical Task Networks (HTNs) with techniques from the Planning via Symbolic Model-Checking (SMC). Our experimental evaluation confirms the potentialities of our approach, demonstrating that it combines the advantages of these paradigms.