Efficient decision-theoretic planning: techniques and empirical analysis

Authors:
Peter Haddawy;AnHai Doan;Richard Goodwin
Affiliations:
Department of EE&CS, University of Wisconsin-Milwaukee, Milwaukee, WI;Department of EE&CS, University of Wisconsin-Milwaukee, Milwaukee, WI;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Year:
1995

Citing 4
Cited 15

Formulation of tradeoffs in planning under uncertainty

Formulation of tradeoffs in planning under uncertainty
Using abstractions for decision-theoretic planning with time constraints

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
An algorithm for probabilistic least-commitment planning

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Planning with deadlines in stochastic domains

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

Focusing attention in anytime decision-theoretic planning

ACM SIGART Bulletin
Conditional, probabilistic planning: a unifying algorithm and effective search control mechanisms

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Evaluating options in a context

TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Heterogeneous temporal probabilistic agents

ACM Transactions on Computational Logic (TOCL)
Integrating Document-Based and Knowledge-Based Models for Clinical Guidelines Analysis

AIME '07 Proceedings of the 11th conference on Artificial Intelligence in Medicine
Utility-based on-line exploration for repeated navigation in an embedded graph

Artificial Intelligence
Bayesian real-time dynamic programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An overview of planning under uncertainty

Artificial intelligence today
Total-order multi-agent task-network planning for contract bridge

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Time-critical action: representations and application

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Constraining influence diagram structure by generative planning: an application to the optimization of oil spill response

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Sound abstraction of probabilistic actions in the constraint mass assignment framework

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Theoretical foundations for abstraction-based probabilistic planning

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
A graph-theoretic analysis of information value

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
A framework for decision-theoretic planning I: combining the situation calculus, conditional plans, probability and utility

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses techniques for performing efficient decision-theoretic planning. We give an overview of the DRIPS decision-theoretic refinement planning system, which uses abstraction to efficiently identify optimal plans. We present techniques for automatically generating search control information, which can significantly improve the planner's performance. We evaluate the efficiency of DRIPS both with and without the search control rules on a complex medical planning problem and compare its performance to that of a branch-and-bound decision tree algorithm.