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

AAMAS, pp. 1101-1108, 2014.

Cited by: 12|Bibtex|Views30
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments