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

Guanqun Wang, Tsuneo Nakanishi, Akira Fukuda

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationTENCON 2015 - 2015 IEEE Region 10 Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Volume2016-January
ISBN (Electronic)9781479986415
DOIs
Publication statusPublished - Jan 5 2016
Event35th IEEE Region 10 Conference, TENCON 2015 - Macau, Macao
Duration: Nov 1 2015Nov 4 2015

Other

Other35th IEEE Region 10 Conference, TENCON 2015
CountryMacao
CityMacau
Period11/1/1511/4/15

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

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.. https://doi.org/10.1109/TENCON.2015.7373015