Proceedings of the AAAI Conference on Artificial Intelligence · 2020 · 24 citations · 33 references
ComputingAutonomous SystemsKnowledge RepresentationPath PlanningPlanning TheoryAction RepresentationHeuristic SearchTask Planning
Both search-based and translation-based planning systems usually operate on grounded representations of the problem. Planning models, however, are commonly defined using lifted description languages. Thus, planning systems usually generate a grounded representation of the lifted model as a preprocessing step. For HTN planning models, only one method to ground lifted models has been published so far. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings in a shorter timespan than the previously published method.
33
Fast planning through planning graph analysis
Avrim Blum, Merrick L. Furst · Artificial Intelligence · 1997 · 1.6K citations
The computational complexity of propositional STRIPS planning
Tom Bylander · Artificial Intelligence · 1994 · 863 citations
The 1998 AI Planning Systems Competition
Drew M. McDermott · 2000 · 300 citations