Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems

Cite

Text

Fu et al. "Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-326

Markdown

[Fu et al. "Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/fu2011ijcai-simple/) doi:10.5591/978-1-57735-516-8/IJCAI11-326

BibTeX

@inproceedings{fu2011ijcai-simple,
  title     = {{Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems}},
  author    = {Fu, Jicheng and Ng, Vincent and Bastani, Farokh B. and Yen, I-Ling},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1949-1954},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-326},
  url       = {https://mlanthology.org/ijcai/2011/fu2011ijcai-simple/}
}