49 search results - page 3 / 10 » Forward-Chaining Partial-Order Planning |
AAAI
1994
13 years 6 months ago
1994
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...
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 ...
FOIKS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
DEXA
2004
Springer
13 years 10 months ago
2004
Springer
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...