314 search results - page 11 / 63 » Goal Ordering in Partially Ordered Plans |
VLDB
2005
ACM
14 years 28 days ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
ACSC
2009
IEEE
14 years 2 months ago
2009
IEEE
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...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
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...
ATAL
2003
Springer
14 years 21 days ago
2003
Springer
Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in whi...
IJCAI
1989
13 years 8 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...