Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges

Aditya Mandalika, Oren Salzman, Siddhartha Srinivasa. Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. In Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs T. J. Spaan, editors, Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018. pages 476-484, AAAI Press, 2018. [doi]

@inproceedings{MandalikaSS18,
  title = {Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges},
  author = {Aditya Mandalika and Oren Salzman and Siddhartha Srinivasa},
  year = {2018},
  url = {https://aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/17785},
  researchr = {https://researchr.org/publication/MandalikaSS18},
  cites = {0},
  citedby = {0},
  pages = {476-484},
  booktitle = {Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018},
  editor = {Mathijs de Weerdt and Sven Koenig and Gabriele Röger and Matthijs T. J. Spaan},
  publisher = {AAAI Press},
  isbn = {978-1-57735-797-1},
}