Sciweavers

KI
2008
Springer
13 years 9 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann
JAIR
2006
120views more  JAIR 2006»
13 years 9 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...
EC
2008
175views ECommerce» more  EC 2008»
13 years 9 months ago
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired oper...
Maoguo Gong, Licheng Jiao, Haifeng Du, Liefeng Bo
AI
2008
Springer
13 years 9 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIPS
2000
13 years 10 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
IJCAI
2003
13 years 10 months ago
A lookahead strategy for solving large planning problems
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...
Vincent Vidal
AIPS
2006
13 years 10 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIPS
2006
13 years 10 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
AAAI
2006
13 years 10 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
IJCAI
2007
13 years 10 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan