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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Boddy and T. L. Dean, Solving time-dependent planning problems, In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, Michigan (1989) 979–984.
M. Boddy, Anytime problem solving using dynamic programming, In Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, California (1991) 738–743.
T. L. Dean and M. Boddy, An analysis of time-dependent planning, In Proceedings of the Seventh National Conference on Artificial Intelligence, Minneapolis, Minnesota (1988) 49–54.
T. L. Dean, Intractability and time-dependent planning, In Proceedings of the 1986 Workshop on Reasoning about Actions and Plans, M. P. Georgeff and A. L. Lansky, eds., Los Altos, California Morgan Kaufmann, 1987.
T. L. Dean and M. P. Wellman. Planning and Control. San Mateo, California (Morgan Kaufmann, 1991).
J. de Kleer and B. C. Williams. Diagnosing multiple faults. Artificial Intelligence 32 (1987) 97–130.
J. Doyle, Rationality and its roles in reasoning, In Proceedings of the Eighth National Conference on Artificial Intelligence, Boston, Massachusetts (1990) 1093–1100.
A. Garvey and V. Lesser, Design-to-time real-time scheduling, In IEEE Transactions on Systems, Man and Cybernetics, 23(6) (1993).
M. R. Genesereth, An overview of metalevel architectures, In Proceedings of the Third National Conference on Artificial Intelligence, Washington, D.C. (1983) 119–123.
E. J. Horvitz, Reasoning about beliefs and actions under computational resource constraints, In Proceedings of the 1987 Workshop on Uncertainty in Artificial Intelligence, Seattle, Washington (1987), 301–324.
E. J. Horvitz, H. J. Suermondt and G. F. Cooper, Bounded conditioning: Flexible inference for decision under scarce resources, In Proceedings of the 1989 Workshop on Uncertainty in Artificial Intelligence, Windsor, Ontario (1989) 182–193.
E. J. Horvitz and J. S. Breese, Ideal partition of resources for metareasoning, Technical Report KSL-90-26, Stanford Knowledge Systems Laboratory, Stanford, California (1990).
R. E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence 27 (1985) 97–109.
V. Lesser, J. Pavlin and E. Durfee, Approximate processing in real-time problem-solving, AI Magazine 9(1) (1988) 49–61.
K. J. Lin, S. Natarajan, J. W. S. Liu and T. Krauskopf, Concord: A system of imprecise computations, In Proceedings of COMPSAC’ 87, Tokyo, Japan (1987) 75–81.
R. S. Michalski and P. H. Winston, Variable precision logic, Artificial Intelligence 29(2) (1986) 121–146.
A. Pos, Time-Constrained Model-Based Diagnosis, Master Thesis, Department of Computer Science, University of Twente, The Netherlands (1993).
S. J. Russell and E. H. Wefald, Principles of metareasoning, In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, R.J. Brachman et al., eds., San Mateo, California (Morgan Kaufmann, 1989).
S. J. Russell and E. H. Wefald, Do the Right Thing: Studies in limited rationality, Cambridge, Massachusetts (MIT Press, 1991).
S. J. Russell and S. Zilberstein, Composing real-time systems, In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, Sydney, Australia (1991) 212–217.
H. A. Simon, Models of bounded rationality, Volume 2, Cambridge, Massachusetts (MIT Press, 1982).
S. V. Vrbsky and J. W. S. Liu, Producing monotonically improving approximate answers to database queries, In Proceedings of the IEEE Workshop on Imprecise and Approximate Computation, Phoenix, Arizona (1992) 72–76.
S. Zilberstein, Operational Rationality through Compilation of Anytime Algorithms, Ph.D. dissertation, Computer Science Division, University of California, Berkeley, California (1993).
S. Zilberstein and S. J. Russell, Efficient resource-bounded reasoning in AT-RALPH, In Proceedings of the First International Conference on AI Planning Systems, College Park, Maryland (1992) 260–266.
S. Zilberstein and S. J. Russell, Anytime sensing, planning and action: A practical model for robot control, In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Chambery, France (1993) 1402–1407.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Zilberstein, S., Russell, S. (1995). Approximate Reasoning Using Anytime Algorithms. In: Natarajan, S. (eds) Imprecise and Approximate Computation. The Springer International Series in Engineering and Computer Science, vol 318. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26870-5_4
Download citation
DOI: https://doi.org/10.1007/978-0-585-26870-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9579-9
Online ISBN: 978-0-585-26870-5
eBook Packages: Springer Book Archive