Time-varying shortest path algorithm with transit time tuning for parking lot navigation

Guanqun Wang; Tsuneo Nakanishi; Akira Fukuda

doi:10.1109/TENCON.2015.7373015

Time-varying shortest path algorithm with transit time tuning for parking lot navigation

Guanqun Wang, Tsuneo Nakanishi, Akira Fukuda

Advanced Software Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit times based on planned vehicle routes as well as traffic flow sensor data. In computer simulations for evaluation, the proposed system showed a improvement of about 40% in travel time when compared with a system that only applies the conventional Dijkstra's algorithm.

Original language	English
Title of host publication	TENCON 2015 - 2015 IEEE Region 10 Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Volume	2016-January
ISBN (Electronic)	9781479986415
DOIs	https://doi.org/10.1109/TENCON.2015.7373015
Publication status	Published - Jan 5 2016
Event	35th IEEE Region 10 Conference, TENCON 2015 - Macau, Macao Duration: Nov 1 2015 → Nov 4 2015

Other

Other	35th IEEE Region 10 Conference, TENCON 2015
Country/Territory	Macao
City	Macau
Period	11/1/15 → 11/4/15

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TENCON.2015.7373015

Cite this

Wang, G, Nakanishi, T & Fukuda, A 2016, Time-varying shortest path algorithm with transit time tuning for parking lot navigation. in TENCON 2015 - 2015 IEEE Region 10 Conference. vol. 2016-January, 7373015, Institute of Electrical and Electronics Engineers Inc., 35th IEEE Region 10 Conference, TENCON 2015, Macau, Macao, 11/1/15. https://doi.org/10.1109/TENCON.2015.7373015

@inproceedings{9ad3a5bc7ea744a0911c1cee25868ecc,

title = "Time-varying shortest path algorithm with transit time tuning for parking lot navigation",

abstract = "This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit times based on planned vehicle routes as well as traffic flow sensor data. In computer simulations for evaluation, the proposed system showed a improvement of about 40% in travel time when compared with a system that only applies the conventional Dijkstra's algorithm.",

author = "Guanqun Wang and Tsuneo Nakanishi and Akira Fukuda",

year = "2016",

month = jan,

day = "5",

doi = "10.1109/TENCON.2015.7373015",

language = "English",

volume = "2016-January",

booktitle = "TENCON 2015 - 2015 IEEE Region 10 Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "35th IEEE Region 10 Conference, TENCON 2015 ; Conference date: 01-11-2015 Through 04-11-2015",

}

TY - GEN

T1 - Time-varying shortest path algorithm with transit time tuning for parking lot navigation

AU - Wang, Guanqun

AU - Nakanishi, Tsuneo

AU - Fukuda, Akira

PY - 2016/1/5

Y1 - 2016/1/5

N2 - This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit times based on planned vehicle routes as well as traffic flow sensor data. In computer simulations for evaluation, the proposed system showed a improvement of about 40% in travel time when compared with a system that only applies the conventional Dijkstra's algorithm.

AB - This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit times based on planned vehicle routes as well as traffic flow sensor data. In computer simulations for evaluation, the proposed system showed a improvement of about 40% in travel time when compared with a system that only applies the conventional Dijkstra's algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84962190503&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962190503&partnerID=8YFLogxK

U2 - 10.1109/TENCON.2015.7373015

DO - 10.1109/TENCON.2015.7373015

M3 - Conference contribution

AN - SCOPUS:84962190503

VL - 2016-January

BT - TENCON 2015 - 2015 IEEE Region 10 Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 35th IEEE Region 10 Conference, TENCON 2015

Y2 - 1 November 2015 through 4 November 2015

ER -

Time-varying shortest path algorithm with transit time tuning for parking lot navigation

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this