Sciweavers

Share
6 search results - page 1 / 2
» Total-Order Planning with Partially Ordered Subtasks
Sort
View
IJCAI
2001
9 years 9 months ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...
AAAI
1993
9 years 9 months ago
Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning
This paper provides a systematic analysisof the relativeutility of basingEBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate th...
Subbarao Kambhampati, Jengchin Chen
DEXA
2004
Springer
131views Database» more  DEXA 2004»
10 years 1 months ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...
CORR
1998
Springer
135views Education» more  CORR 1998»
9 years 7 months ago
The Computational Complexity of Probabilistic Planning
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...
AAAI
2015
4 years 4 months ago
Strong Temporal Planning with Uncontrollable Durations: A State-Space Approach
In many practical domains, planning systems are required to reason about durative actions. A common assumption in the literature is that the executor is allowed to decide the dura...
Alessandro Cimatti, Andrea Micheli, Marco Roveri
books