Forward Search Value Iteration for POMDPs

Shani, Guy; Brafman, Ronen I.; Shimony, Solomon Eyal

Forward Search Value Iteration for POMDPs

Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony

Download BibTeX Cite

Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 2619-2623.

Abstract

Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly converge to an approximate solution for medium-sized problems. Of this family HSVI, which uses trial-based asynchronous value iteration, can handle the largest domains. In this paper we suggest a new algorithm, FSVI, that uses the underlying MDP to traverse the belief space towards rewards, finding sequences of useful backups, and show how it scales up better than HSVI on larger benchmarks.

Guy Shani, Ronen I. Brafman, and Solomon Eyal Shimony. 2007. Forward Search Value Iteration for POMDPs. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 2619–2623. https://ijcai.org/proceedings/2007/421

@inproceedings{ijcai2007p421,
  title     = {Forward Search Value Iteration for POMDPs},
  author    = {Shani, Guy and Brafman, Ronen I. and Shimony, Solomon Eyal},
  booktitle = {Proceedings of the Twentieth International Joint Conference on
               Artificial Intelligence, {IJCAI-07}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Ramon López de Mántaras},
  pages     = {2619--2623},
  year      = {2007},
  url       = {https://ijcai.org/proceedings/2007/421},
}

TY  - CPAPER
TI  - Forward Search Value Iteration for POMDPs
AU  - Shani, Guy
AU  - Brafman, Ronen I.
AU  - Shimony, Solomon Eyal
T2  - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2007
SP  - 2619
EP  - 2623
UR  - https://ijcai.org/proceedings/2007/421
ER  -