Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges

Venkatraman Narayanan, Maxim Likhachev. Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges. In Laura Barbulescu, Jeremy Frank, Mausam, Stephen F. Smith, editors, Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017, Pittsburgh, Pennsylvania, USA, June 18-23, 2017. pages 522-530, AAAI Press, 2017. [doi]

@inproceedings{NarayananL17-0,
  title = {Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges},
  author = {Venkatraman Narayanan and Maxim Likhachev},
  year = {2017},
  url = {https://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15727},
  researchr = {https://researchr.org/publication/NarayananL17-0},
  cites = {0},
  citedby = {0},
  pages = {522-530},
  booktitle = {Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017, Pittsburgh, Pennsylvania, USA, June 18-23, 2017},
  editor = {Laura Barbulescu and Jeremy Frank and Mausam and Stephen F. Smith},
  publisher = {AAAI Press},
}