Sciweavers

AIPS
2009
14 years 24 days 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...
AIPS
2009
14 years 24 days ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
AIPS
2009
14 years 24 days ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
AIPS
2009
14 years 24 days ago
Learning User Plan Preferences Obfuscated by Feasibility Constraints
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
AIPS
2009
14 years 24 days ago
Focused Topological Value Iteration
Peng Dai, Mausam, Daniel S. Weld
AIPS
2009
14 years 24 days ago
A Semantics for HTN Methods
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
Robert P. Goldman
AIPS
2009
14 years 24 days ago
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
AIPS
2009
14 years 24 days ago
Extending the Use of Inference in Temporal Planning as Forwards Search
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
AIPS
2009
14 years 24 days ago
Semantic Attachments for Domain-Independent Planning Systems
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only...
Christian Dornhege, Patrick Eyerich, Thomas Keller...
AIPS
2009
14 years 24 days ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert