Download:
by Shlomo Zilberstein, Stuart Russell
http://anytime.cs.umass.edu/shlomo/papers/kluwer95.pdf
Add To MetaCart
Abstract:
The complexity of reasoning in intelligent systems makes it undesirable, and sometimes infeasible, to find the optimal action in every situation since the deliberation process itself degrades the performance of the system. The problem is then to construct intelligent systems that react to a situation after performing the “right ” amount of thinking. It is by now widely accepted that a successful system must trade off decision quality against the computational requirements of decision-making. Anytime algorithms, introduced by Dean, Horvitz and others in the late 1980’s, were designed to offer such a trade-off. We have extended their work to the construction of complex systems that are composed of anytime algorithms. This paper describes the compilation and monitoring mechanisms that are required to build intelligent systems that can efficiently control their deliberation time. We present theoretical results showing that the compilation and monitoring problems are tractable in a wide range of cases, and provide two applications to illustrate the ideas. 1
Citations
|
519
|
Diagnosing multiple faults
– Kleer, Williams
- 1987
|
|
481
|
An analysis of time-dependent planning
– Dean, Boddy
- 1988
|
|
291
|
Planning and Control
– Dean, Wellman
- 1991
|
|
280
|
Depth-first iterative-deepening: An optimal admissible tree search
– Korf
- 1985
|
|
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
|
|
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
|
|
35
|
An Overview of Meta-Level Architecture
– Genesereth
- 1983
|
|
24
|
Variable Precision Logic
– Michalski, Winston
- 1986
|
|
23
|
Efficient resource-bounded reasoning in AT-RALPH
– Zilberstein, Russell
- 1992
|
|
20
|
Concord: A system of imprecise computations
– Lin, Natarajan, et al.
- 1987
|
|
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
|
