A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors

A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors

C. Dellin, S.S. Srinivasa

International Conference on Automated Planning and Scheduling, 2016

PDF

BibTeX

@inproceedings{dellin2016lazysp, author = "Dellin, C. and Srinivasa, S.S.", title = "A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors", booktitle = "International Conference on Automated Planning and Scheduling", year = "2016" }