An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs

Cite

Text

Szer and Charpillet. "An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs." European Conference on Machine Learning, 2005. doi:10.1007/11564096_38

Markdown

[Szer and Charpillet. "An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs." European Conference on Machine Learning, 2005.](https://mlanthology.org/ecmlpkdd/2005/szer2005ecml-optimal/) doi:10.1007/11564096_38

BibTeX

@inproceedings{szer2005ecml-optimal,
  title     = {{An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs}},
  author    = {Szer, Daniel and Charpillet, François},
  booktitle = {European Conference on Machine Learning},
  year      = {2005},
  pages     = {389-399},
  doi       = {10.1007/11564096_38},
  url       = {https://mlanthology.org/ecmlpkdd/2005/szer2005ecml-optimal/}
}