Probabilistic inference for solving discrete and continuous state Markov Decision Processes

By Marc Toussaint, Amos J. Storkey. 2006

552 citations recorded by the source corpus.

Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. A particularly interesting aspect of the approach is that any existing inference technique in DBNs now becomes available for answering behavioral question--including those on continuous, factorial, or hierarchical state representations. Here we present an Expectation Maximization algorithm for computing optimal policies. Unlike previous approaches we can show that this actually optimizes the discounted expected future return for arbitrary reward functions and without assuming an ad hoc finite total time. The algorithm is generic in that any inference technique can be utilized in the E-step. We demonstrate this for exact inference on a discrete maze and Gaussian belief state propagation in continuous stochastic optimal control problems.

Subfields: Artificial Intelligence, Reinforcement Learning, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Pieter Abbeel
  3. Yoshua Bengio
  4. Chelsea Finn
  5. Ruslan Salakhutdinov
  6. Shimon Whiteson
  7. J. Urgen Schmidhuber
  8. Trevor Darrell

In Reinforcement Learning

  1. Sergey Levine
  2. Pieter Abbeel
  3. Shimon Whiteson
  4. Chelsea Finn
  5. George Tucker
  6. Ofir Nachum
  7. Shixiang Shane Gu
  8. Nicolas Manfred Otto Heess

In Probabilistic & Bayesian Methods

  1. Yoshua Bengio
  2. David M. Blei
  3. Yee Whye Teh
  4. Matthew D. Hoffman
  5. George Tucker
  6. Arnaud Doucet
  7. Sergey Levine
  8. Jan Peters

Citations in the corpus