Abstracting Probabilistic Actions

02/27/2013
by   Peter Haddawy, et al.
0

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.

READ FULL TEXT
research
02/13/2013

Sound Abstraction of Probabilistic Actions in The Constraint Mass Assignment Framework

This paper provides a formal and practical framework for sound abstracti...
research
08/25/2021

Pagurus: Eliminating Cold Startup in Serverless Computing with Inter-Action Container Sharing

Serverless computing provides fine-grain resource sharing between Cloud ...
research
02/13/2013

Theoretical Foundations for Abstraction-Based Probabilistic Planning

Modeling worlds and actions under uncertainty is one of the central prob...
research
05/13/2021

Counterexample-Guided Repair for Symbolic-Geometric Action Abstractions

Integrated Task and Motion Planning (TMP) provides a promising class of ...
research
02/14/2012

A temporally abstracted Viterbi algorithm

Hierarchical problem abstraction, when applicable, may offer exponential...
research
07/26/2022

Using Abstraction for Interpretable Robot Programs in Stochastic Domains

A robot's actions are inherently stochastic, as its sensors are noisy an...
research
03/06/2013

Probabilistic Conceptual Network: A Belief Representation Scheme for Utility-Based Categorization

Probabilistic conceptual network is a knowledge representation scheme de...

Please sign up or login with your details

Forgot password? Click here to reset