This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP) regulated transportation networks. Specifically, the RSP problem that we are targeting at is to minimize the (weighted) linear combination of mean and standard deviation of the path’s travel time. With the reasonable assumption that the travel times of the underlying transportation network follow a multi-variate Gaussian distribution, we propose a Gaussian process path planning (GP3) algorithm to calculate the a priori optimal path as the RSP solution. With a series of equivalent RSP problem transformations, we are able to reach a polynomial time complexity algorithm with guaranteed solution accuracy. Extensive experimental results over various sizes of realistic transportation networks demonstrate the superior performance of GP3 over the state-of-the-art algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    GP3: Gaussian Process Path Planning for Reliable Shortest Path in Transportation Networks


    Contributors:
    Guo, Hongliang (author) / Hou, Xuejie (author) / Cao, Zhiguang (author) / Zhang, Jie (author)


    Publication date :

    2022-08-01


    Size :

    2934020 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Reliable Shortest Path Problems in Stochastic Time-Dependent Networks

    Chen, Bi Yu / Lam, William H. K. / Sumalee, Agachai et al. | Taylor & Francis Verlag | 2014


    Impacts of Correlations on Reliable Shortest Path Finding

    Zockaie, Ali / Nie, Yu (Marco) / Wu, Xing et al. | Transportation Research Record | 2013


    Shortest safe path planning for vehicles

    Lambert, A. / Bouaziz, S. / Reynaud, R. | IEEE | 2003


    Shortest Path Optimization Algorithm in Intelligent Transportation System

    Wang, Hao Yu ;Zheng, Yi ;Ji, Xiao Juan | Trans Tech Publications | 2013