Gauss meets Canadian traveler: shortest-path problems with correlated natural dynamics

In a variety of real world problems from robot navigation to logistics, agents face the challenge of path optimization on a graph with unknown edge costs. These settings can be generally formalized as the Canadian Traveler Problems (CTPs) [13]. Although in many applications the edge costs have dependencies resulting from world dynamics, C...More