Reliability theory model and expected life shortest path in stochastic and time-dependent networks

Authors:
Guo-zhen Tan;Xiang-fu Xia;Wen Gao
Affiliations:
Department of Computer Science and Engineering, Dalian University of Technology Dalian, Liaoning, China;Department of Computer Science and Engineering, Dalian University of Technology Dalian, Liaoning, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science
Year:
2003

Citing 2
Cited 0

Improved results for route planning in stochastic transportation

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Path planning under time-dependent uncertainty

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the priori expected shortest path problem from a single origin to a single destination for each departure time in stochastic and time-dependent networks. Such problem requires more than standard shortest path techniques. First, we transform this problem into the problem of systemic reliability, and identify a weaker consistent reliability condition that insures the validity of generalized dynamic-programming method based on reliability priority. Furthermore, we propose a new dominance discriminance, which makes the parameter in traditional discriminance drop from two dimensions to one dimension and reduces the possibility of not doing dominance compare among paths. Finally, we present the expected life shortest path algorithm.