AIPS
2008
13 years 6 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
AIPS
2008
13 years 6 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
AIPS
2008
13 years 6 months ago
2008
AIPS
2008
13 years 6 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
AIPS
2008
13 years 6 months ago
2008
Despite the recent resurgence of interest in learning methods for planning, most such efforts are still focused exclusively on classical planning problems. In this work, we invest...
AIPS
2008
13 years 6 months ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
AIPS
2008
13 years 6 months ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
AIPS
2008
13 years 6 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
AIPS
2008
13 years 6 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
AIPS
2008
13 years 6 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...