Download:
by Shlomo Zilberstein, Franois Charpillet
Annals of Mathematics and Artificial Intelligence
http://anytime.cs.umass.edu/shlomo/papers/amai03.pdf
Add To MetaCart
Abstract:
We address the problem of building an interruptible real-time system using noninterruptible components. Some artificial intelligence techniques offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated. These techniques, called contract algorithms, introduce a complex scheduling problem when there is uncertainty about the amount of time available for problem-solving. We show how to optimally sequence contract algorithms to create the best possible interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problem-solving and provide useful guidance for embedding contract algorithms in applications.
Citations
|
481
|
An analysis of time-dependent planning
– Dean, Boddy
- 1988
|
|
150
|
Reasoning about beliefs and actions under computational resource constraints
– Horvitz
- 1987
|
|
146
|
Deliberation scheduling for problem solving in timeconstrained enviroments
– Boddy, Dean
- 1994
|
|
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
|
|
99
|
Optimal Composition of Real-Time Systems
– Zilberstein, Russell
- 1996
|
|
56
|
Computation and action under bounded resources
– Horvitz
- 1990
|
|
39
|
Provably bounded optimal agents
– Russell, Subramanian, et al.
- 1993
|
|
24
|
Models of continual computation
– Horvitz
- 1997
|
|
23
|
and Shlomo Zilberstein. Composing real-time systems
– Russell
- 1991
|
|
16
|
Utility-Based Termination of Anytime Algorithms
– Sandholm, Lesser
- 1994
|
|
14
|
Optimizing Decision Quality with Contract Algorithms
– Zilberstein
- 1995
|
|
12
|
Time-constrained model-based diagnosis
– Pos
- 1993
|
|
5
|
and Shlomo Zilberstein. Monitoring the progress of anytime problemsolving
– Hansen
- 1996
|
|
5
|
and Shlomo Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach
– Hansen
|
|
4
|
Computationally-Optimal Real-Resource Strategies for Independent, Uninterruptible Methods
– Einav
- 1990
|
|
2
|
Dynamic scheduling of progressive processing plans
– Zilberstein, Mouaddib, et al.
- 2000
|
|
1
|
and Shlomo Zilberstein. Optimal sequencing of contract algorithms using multiple processors
– Bernstein
- 2000
|
