Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
Various cognitive and computational models have addressed the use of previous experience to understand a new domain. In particular, research in case-based reasoning has explored t...
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
Abstract: Before engaging in a conversation, a message must be planned. While there are many ways to perform this task, I believe that people do this in the following way, in parti...
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...