810 search results - page 3 / 162 » Solving Time-Dependent Planning Problems |
AAAI
2006
13 years 9 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
IJCAI
2003
13 years 9 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
AAAI
1998
13 years 9 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
AIPS
2008
13 years 10 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
EACL
1989
ACL Anthology
13 years 9 months ago
1989
ACL Anthology
The structure of problem-solving discourse in the expert advising setting can be modeled by adding a layer of metaplans to a plan-based model of the task domain. Classes of metapl...