Min-max regret approach to the optimal path finding problem in stochastic time-dependent networks.

Shichao Sun Zhengyu Duan Dongyuan Yang

Published in: ISADS (2013)

Keyphrases

min max
path finding
max min
optimal path
worst case
regret bounds
path planning
search algorithm
optimal solution
dynamic programming
heuristic search
rule learning
multi armed bandit
neural network
evolutionary algorithm
online learning