Real-time problem solving with contract algorithms (1999) [9 citations — 0 self]
Download:
by Shlomo Zilberstein, Francois Charpillet
in: Proc. IJCAI-99
http://anytime.cs.umass.edu/shlomo/papers/ijcai99a.pdf
Add To MetaCart
Abstract:
This paper addresses the problem of building an interruptible real-time system using contract algorithms. Contract algorithms offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated. Many AI techniques provide useful contract algorithms that are not interruptible. We show how to optimally sequence contract algorithms to create the best interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problemsolving and provide useful guidance for embedding contract algorithms in applications. I
Citations
| 481 | An analysis of time-dependent planning – Dean, Boddy - 1988 |
| 135 | Principles of metareasoning – Russell, Wefald - 1991 |
| 114 | Design-to-time Real-Time Scheduling – Garvey, Lesser - 1993 |
| 107 | Reasoning under varying and uncertain resource constraints – Horvitz - 1988 |
| 104 | Searching in the plane – Baeza-Yates, Culberson, et al. - 1993 |
| 99 | Optimal Composition of Real-Time Systems – Zilberstein, Russell - 1996 |
| 39 | Provably bounded optimal agents – Russell, Subramanian, et al. - 1993 |
| 24 | Models of continual computation – Horvitz - 1997 |
| 14 | Optimizing Decision Quality with Contract Algorithms – Zilberstein - 1995 |
| 5 | and Shlomo Zilberstein. Monitoring the progress of anytime problemsolving – Hansen - 1996 |
