92 search results - page 7 / 19 » New Heuristics for Timeline-Based Planning |
183
click to vote
JAIR
2006
15 years 6 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
126
click to vote
AIPS
2003
15 years 7 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
245
click to vote
AIPS
2011
14 years 9 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
156
click to vote
AIPS
2006
15 years 7 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
163
click to vote
IJCAI
2003
15 years 7 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...