News icon 学术报告
Gywm line

题目:The global optimal algorithm of reliable path finding problem


摘要:We will discuss the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, we integrate the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty.




邀请人:吴婷 老师

Date icon 2017-09-02