Sciweavers

AIPS
2009
13 years 4 months ago
Minimal Sufficient Explanations for Factored Markov Decision Processes
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...
Omar Zia Khan, Pascal Poupart, James P. Black
AIPS
2009
13 years 4 months ago
A Human-Aware Robot Task Planner
The growing presence of household robots in inhabited environments arises the need for new robot task planning techniques. These techniques should take into consideration not only...
Marcello Cirillo, Lars Karlsson, Alessandro Saffio...
AIPS
2009
13 years 4 months ago
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
Patrick Eyerich, Robert Mattmüller, Gabriele ...
AIPS
2009
13 years 4 months ago
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
Dunbo Cai, Jörg Hoffmann, Malte Helmert
AIPS
2009
13 years 4 months ago
Improving Planning Performance Using Low-Conflict Relaxed Plans
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. Ho...
Jorge A. Baier, Adi Botea
AIPS
2009
13 years 4 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
AIPS
2009
13 years 4 months ago
A Conformant Planner with Explicit Disjunctive Representation of Belief States
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form form...
Son Thanh To, Enrico Pontelli, Tran Cao Son
AIPS
2009
13 years 4 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
AIPS
2009
13 years 4 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...