Abstracting Probabilistic Actions

2013/02/27 by Peter Haddawy, Haddawy, Peter, AnHai Doan +1
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #cs.AI

paper · pdf · doi:10.48550/arxiv.1302.6812

Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994)

arxiv created 2013/02/27 · arxiv updated 2013/02/28

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.

Related

• Sound Abstraction of Probabilistic Actions in The Constraint Mass Assignment Framework
• A Probabilistic Model of Action for Least-Commitment Planning with Information Gather
• A Translation of Probabilistic Event Calculus into Markov Decision Processes
• Projection Abstractions in Planning Under the Lenses of Abstractions for MDPs
• Theoretical Foundations for Abstraction-Based Probabilistic Planning