A Polynomial Planning Algorithm that Beats LAMA and FF. Lipovetzky, N. & Geffner, H. In Barbulescu, L., Frank, J., Mausam, & Smith, S. F., editors, Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017, Pittsburgh, Pennsylvania, USA, June 18-23, 2017, pages 195–199, 2017. AAAI Press.
A Polynomial Planning Algorithm that Beats LAMA and FF [link]Paper  bibtex   
@inproceedings{DBLP:conf/aips/LipovetzkyG17,
  author       = {Nir Lipovetzky and
                  Hector Geffner},
  editor       = {Laura Barbulescu and
                  Jeremy Frank and
                  Mausam and
                  Stephen F. Smith},
  title        = {A Polynomial Planning Algorithm that Beats {LAMA} and {FF}},
  booktitle    = {Proceedings of the Twenty-Seventh International Conference on Automated
                  Planning and Scheduling, {ICAPS} 2017, Pittsburgh, Pennsylvania, USA,
                  June 18-23, 2017},
  pages        = {195--199},
  publisher    = {{AAAI} Press},
  year         = {2017},
  url          = {https://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15740},
  timestamp    = {Tue, 26 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/aips/LipovetzkyG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0