Sciweavers

AIPS
2008
13 years 6 months ago
Using Classical Planners to Solve Nondeterministic Planning Problems
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P...
AIPS
2008
13 years 6 months ago
Generating Robust Schedules Subject to Resource and Duration Uncertainties
We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we ...
Na Fu, Hoong Chuin Lau, Fei Xiao
AIPS
2008
13 years 6 months ago
Effective Information Value Calculation for Interruption Management in Multi-Agent Scheduling
This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...
David Sarne, Barbara J. Grosz, Peter Owotoki
AIPS
2008
13 years 6 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
AIPS
2008
13 years 6 months ago
P3C: A New Algorithm for the Simple Temporal Problem
Léon Planken, Mathijs de Weerdt, Roman van ...
AIPS
2008
13 years 6 months ago
Planning 3D Task Demonstrations of a Teleoperated Space Robot Arm
We present an automated planning application for generating 3D tasks demonstrations involving a teleoperated robot arm on the International Space Station (ISS). A typical task dem...
Froduald Kabanza, Khaled Belghith, Philipe Bellefe...
AIPS
2008
13 years 6 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
AIPS
2008
13 years 6 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
AIPS
2008
13 years 6 months ago
A Probabilistic Planner for the Combat Power Management Problem
We present a planner for the Combat Power Management (CPM) problem. In response to multiple simultaneous or sequential threats, the planner generates a set of local plans, one for...
Abder Rezak Benaskeur, Froduald Kabanza, Eric Beau...