A translation based approach to probabilistic conformant planning Conference Paper uri icon

abstract

  • Abstract. In conformant probabilistic planning (CPP), we are given a set of ac- tions with stochastic effects, a distribution over initial states, a goal condition, and a value 0 < p ≤ 1. Our task is to find a plan π such that the probability that the goal condition holds following the execution of π in the initial state is at least p. In this paper we focus on the problem of CPP with deterministic actions. Motivated by the success of the translation-based approach of Palacious and Geffner [6], we show how deterministic CPP can be reduced to a metric-planning problem. Given …

publication date

  • January 1, 2011