72 search results - page 7 / 15 » Fast Planning by Search in Domain Transition Graph |
111
click to vote
ICML
2008
IEEE
16 years 13 days ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
104
click to vote
FLAIRS
2008
15 years 2 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
106
click to vote
AIPS
2004
15 years 1 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
106
click to vote
CI
2011
14 years 6 months ago
2011
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
AAAI
2006
15 years 1 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...