A Generalization of the Shortest Path Problem to Graphs with Multiple
Edge-Cost Estimates

v1v2v3v4 (latest)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

22 August 2022

ArXiv (abs)PDF HTML

Papers citing "A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates"

5 / 5 papers shown

Title
Position Paper: Online Modeling for Offline Planning Eyal Weiss G. Kaminka OffRL 23 3 0 07 Jun 2022
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles Aditya Mandalika Sanjiban Choudhury Oren Salzman S. Srinivasa 67 58 0 04 Apr 2019
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges Aditya Mandalika Oren Salzman S. Srinivasa 53 50 0 13 Mar 2018
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors Christopher M. Dellin S. Srinivasa 36 71 0 10 Mar 2016
The Fast Downward Planning System M. Helmert 93 1,906 0 27 Sep 2011