In real-life multi-agent planning problems, long-term plans will often be invalidated by changes in the environment during or after the planning process. When this happens, short-t...
Xiaoyu Mao, Adriaan ter Mors, Nico Roos, Cees Witt...
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...