Access Restriction

Author Haddawy, Peter ♦ Doan, Anhai
Source CiteSeerX
Content type Text
Publisher Morgan Kaufmann
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Introduction Optimal Planning ♦ Computer Science University ♦ Conditional Probabilistic Action ♦ Temporal Action Representation ♦ Drip Decision-theoretic Planner ♦ Intra-action Abstraction ♦ Developed Technique ♦ Inter-action Abstraction ♦ Probabilistic Action ♦ Decision-theoretic Framework ♦ Distinct Type ♦ Wisconsin-milwaukee Po Box ♦ Anhaig C ♦ Electrical Engineering
Description In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence
ing Probabilistic Actions Peter Haddawy AnHai Doan Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee PO Box 784 Milwaukee, WI 53201 fhaddawy, Abstract This paper discusses the problem of abstracting conditional probabilistic actions. We identify two distinct types of abstraction: intra-action abstraction and inter-action abstraction. We define what it means for the abstraction of an action to be correct and then derive two methods of intra-action abstraction and two methods of inter-action abstraction which are correct according to this criterion. We illustrate the developed techniques by applying them to actions described with the temporal action representation used in the drips decision-theoretic planner and we describe how the planner uses abstraction to reduce the complexity of planning. 1 Introduction Optimal planning in a decision-theoretic framework requires finding the plan or set of plans that maximizes expected ...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1994-01-01