Download:
|
by Shlomo Zilbersteiny, Stuart Russell
http://www.cs.berkeley.edu/~russell/papers/aij-anytime.ps
Add To MetaCart
Abstract:
Real-time systems are designed for environments in which the utility of actions is strongly time-dependent. Recent work by Dean, Horvitz and others has shown that anytime algorithms are a useful tool for real-time system design, since they allow computation time to be traded for decision quality. In order to construct complex systems, however, we need to be able to compose larger systems from smaller, reusable anytime modules. This paper addresses two basic problems associated with composition: how to ensure the interruptibility of the composed system; and how to allocate computation time optimally among the components. The first problem is solved by a simple and general construction that incurs only a small, constant penalty. The second is solved by an off-line compilation process. We show that the general compilation problem is NP-complete. However, efficient local compilation techniques, working on a single program structure at a time, yield globally optimal allocations for a large class of programs. We illustrate these results with two simple applications.
Citations
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
4388
|
Probabilistic Reasoning in Intelligent Systems
– Pearl
- 1988
|
|
481
|
An analysis of time-dependent planning
– Dean, Boddy
- 1988
|
|
293
|
Real-time heuristic search
– Korf
- 1990
|
|
280
|
Depth-first iterative-deepening: An optimal admissible tree search
– Korf
- 1985
|
|
248
|
An Effective Heuristic Algorithm for the Traveling Salesman Problem
– Lin, Kernighan
- 1973
|
|
213
|
AuTOCLASS: A Bayesian classification system
– Cheeseman, Kelly, et al.
- 1988
|
|
210
|
Solving TimeDependent Planning Problems
– Boddy, Dean
- 1989
|
|
150
|
Reasoning about beliefs and actions under computational resource constraints
– Horvitz
- 1987
|
|
142
|
Models of Bounded Rationality
– Simon
- 1982
|
|
135
|
Principles of metareasoning
– Russell, Wefald
- 1991
|
|
114
|
Design-to-time Real-Time Scheduling
– Garvey, Lesser
- 1993
|
|
105
|
Rationality and its roles in reasoning
– Doyle
- 1992
|
|
86
|
Operational rationality through compilation of anytime algorithms
– Zilberstein
- 1993
|
|
84
|
Bounded conditioning: Flexible inference for decisions under scarce resources
– Horvitz, Suermondt, et al.
- 1989
|
|
77
|
Composing real-time systems
– Russell, Zilberstein
- 1991
|
|
66
|
Meta-rules: reasoning about control
– Davis
- 1980
|
|
52
|
Approximate Processing in Real-Time Problem Solving
– Lesser, Pavlin, et al.
- 1989
|
|
50
|
Anytime sensing, planning and action: A practical model for robot control
– Zilberstein, Russell
- 1993
|
|
43
|
Anytime problem solving using dynamic programming
– Boddy
- 1991
|
|
40
|
Do the right thing: studies in limited rationality
– Russell, Wefald
- 1991
|
|
39
|
Provably bounded optimal agents
– Russell, Subramanian, et al.
- 1993
|
|
35
|
An Overview of Meta-Level Architecture
– Genesereth
- 1983
|
|
26
|
An introduction to random algorithms
– Karp
- 1990
|
|
24
|
Variable Precision Logic
– Michalski, Winston
- 1986
|
|
23
|
Fuzzy Logic and Approximate Reasoning. Synthese
– Zadeh
- 1975
|
|
23
|
Efficient resource-bounded reasoning in AT-RALPH
– Zilberstein, Russell
- 1992
|
|
20
|
Constructing utility-driven real-time systems using anytime algorithms
– Zilberstein, Russell
- 1992
|
|
17
|
Producing monotonically improving approximate answers to database queries
– Vrbsky, Liu
- 1995
|
|
16
|
Ideal partition of resources for metareasoning
– Horvitz, Breese
- 1990
|
|
12
|
Time-constrained model-based diagnosis
– Pos
- 1993
|
|
8
|
Resource bounded agents in an uncertain world
– D’Ambrosio
- 1989
|
|
8
|
et al., eds., The traveling salesman problem: a guided tour of combinatorial optimization
– Lawler
- 1987
|
|
5
|
Real-time planning
– Hendler
- 1989
|
|
4
|
Incremental, approximate planning: Abductive default reasoning
– Elkan
- 1990
|
