Search Results for author:
Found 7 papers, 0 papers with code
Planning and Acting While the Clock Ticks
Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates.
Estimating the Probability of Meeting a Deadline in Hierarchical Plans
For the proposed approximation algorithm, we establish formal approximation bounds and show that the time and memory complexities grow polynomially with the required accuracy, the number of nodes in the plan, and with the size of the support of the random variables that represent the durations of the primitive tasks.
Rational Deployment of Multiple Heuristics in IDA*
Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms.
Selecting Computations: Theory and Applications
Sequential decision problems are often approximately solvable by simulating possible future action sequences.
Generic Preferences over Subsets of Structured Objects
For example, preferences over the content of an online newspaper should have this form: At each viewing, the newspaper contains a subset of the set of articles currently available.
Towards Rational Deployment of Multiple Heuristics in A*
The obvious way to use several admissible heuristics in A* is to take their maximum.
A New Algorithm for Finding MAP Assignments to Belief Networks
We present a new algorithm for finding maximum a-posterior) (MAP) assignments of values to belief networks.
