Acting Optimally in Partially Observable Stochastic Domains

Abstract

In this paper, we describe the partially observable Markov decision process (pomdp) approach to finding optimal or near-optimal control strategies for partially observable stochastic environments, given a complete model of the environment. The pomdp approach was originally developed in the operations research community and provides a formal basis for planning problems that have been of interest to the AI community. We found the existing algorithms for computing optimal control strategies to be highly computationally inefficient and have developed a new algorithm that is empirically more efficient. We sketch this algorithm and present preliminary results on several small problems that illustrate important properties of the pomdp approach. Introduction Agents that act in real environments, whether physical or virtual, rarely have complete information about the state of the environment in which they are working. It is necessary for them to choose their actions in partial ignorance and o...

Cite

Text

Cassandra et al. "Acting Optimally in Partially Observable Stochastic Domains." AAAI Conference on Artificial Intelligence, 1994.

Markdown

[Cassandra et al. "Acting Optimally in Partially Observable Stochastic Domains." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/cassandra1994aaai-acting/)

BibTeX

@inproceedings{cassandra1994aaai-acting,
  title     = {{Acting Optimally in Partially Observable Stochastic Domains}},
  author    = {Cassandra, Anthony R. and Kaelbling, Leslie Pack and Littman, Michael L.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1994},
  pages     = {1023-1028},
  url       = {https://mlanthology.org/aaai/1994/cassandra1994aaai-acting/}
}