GP3: Gaussian process path planning for reliable shortest path in transportation networks
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...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8126 https://ink.library.smu.edu.sg/context/sis_research/article/9129/viewcontent/GP3_Gaussian_Process_Path_Planning_for_Reliable_Shortest_Path_in_Transportation_Networks.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-9129 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-91292023-09-14T08:34:39Z GP3: Gaussian process path planning for reliable shortest path in transportation networks GUO, Hongliang HOU, Xuejie CAO, Zhiguang ZHANG, Jie 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. 2021-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8126 info:doi/10.1109/TITS.2021.3105415 https://ink.library.smu.edu.sg/context/sis_research/article/9129/viewcontent/GP3_Gaussian_Process_Path_Planning_for_Reliable_Shortest_Path_in_Transportation_Networks.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Reliability Transportation Path planning Planning Gaussian processes Standards Covariance matrices Reliable shortest path (RSP) mean-std minimization Gaussian process path planning (GP3) a priori path stochastic on time arrival (SOTA) Lagrangian relaxation OS and Networks Transportation |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Reliability Transportation Path planning Planning Gaussian processes Standards Covariance matrices Reliable shortest path (RSP) mean-std minimization Gaussian process path planning (GP3) a priori path stochastic on time arrival (SOTA) Lagrangian relaxation OS and Networks Transportation |
spellingShingle |
Reliability Transportation Path planning Planning Gaussian processes Standards Covariance matrices Reliable shortest path (RSP) mean-std minimization Gaussian process path planning (GP3) a priori path stochastic on time arrival (SOTA) Lagrangian relaxation OS and Networks Transportation GUO, Hongliang HOU, Xuejie CAO, Zhiguang ZHANG, Jie GP3: Gaussian process path planning for reliable shortest path in transportation networks |
description |
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. |
format |
text |
author |
GUO, Hongliang HOU, Xuejie CAO, Zhiguang ZHANG, Jie |
author_facet |
GUO, Hongliang HOU, Xuejie CAO, Zhiguang ZHANG, Jie |
author_sort |
GUO, Hongliang |
title |
GP3: Gaussian process path planning for reliable shortest path in transportation networks |
title_short |
GP3: Gaussian process path planning for reliable shortest path in transportation networks |
title_full |
GP3: Gaussian process path planning for reliable shortest path in transportation networks |
title_fullStr |
GP3: Gaussian process path planning for reliable shortest path in transportation networks |
title_full_unstemmed |
GP3: Gaussian process path planning for reliable shortest path in transportation networks |
title_sort |
gp3: gaussian process path planning for reliable shortest path in transportation networks |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2021 |
url |
https://ink.library.smu.edu.sg/sis_research/8126 https://ink.library.smu.edu.sg/context/sis_research/article/9129/viewcontent/GP3_Gaussian_Process_Path_Planning_for_Reliable_Shortest_Path_in_Transportation_Networks.pdf |
_version_ |
1779157161951100928 |