101 search results - page 1 / 21 » Reviving Partial Order Planning |
IJCAI
2001
13 years 6 months ago
2001
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
AIPS
2010
13 years 5 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
SARA
2009
Springer
14 years 12 hour ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
AAAI
1993
13 years 6 months ago
1993
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...
IJCAI
2001
13 years 6 months ago
2001
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...