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

Christopher M. Dellin, Siddhartha S. Srinivasa. A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors. In Amanda Jane Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, Scott Sanner, editors, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016. pages 459-467, AAAI Press, 2016. [doi]

Abstract

Abstract is missing.