Sciweavers

Share
AIPS
2011
7 years 8 months ago
Learning Inadmissible Heuristics During Search
Jordan Tyler Thayer, Austin J. Dionne, Wheeler Rum...
AIPS
2011
7 years 8 months ago
Planning and Acting in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
Christopher Weber, Daniel Bryce
AIPS
2011
7 years 8 months ago
Cross-Domain Action-Model Acquisition for Planning via Web Search
Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of...
Hankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li
AIPS
2011
7 years 8 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
AIPS
2011
7 years 8 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...
AIPS
2011
7 years 8 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
AIPS
2011
7 years 8 months ago
Searching for Plans with Carefully Designed Probes
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...
Nir Lipovetzky, Hector Geffner
AIPS
2011
7 years 8 months ago
Scheduling an Aircraft Repair Shop
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
Maliheh Aramon Bajestani, J. Christopher Beck
AIPS
2011
7 years 8 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann
books