Dijkstra as an Oracle for Online Stochastic Shortest Path Navigation with Provable Guarantees
Mobile robots that operate in side by side with humans and critical facilities must reach their goals at low cost, despite often unknown true traversal costs of the map apriori and imperfect actuation. Planners that solve the underlying stochastic shortest path problem exactly, such as value iteration, require computation that grows with the diameter of the map, whereas Dijkstra's algorithm is…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
