Efficient cache-supported path planning on roads (Extended abstract)

Ying Zhang, Yu Ling Hsueh, Wang-chien Lee, Yi Hao Jhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Owing to the wide availability of the global positioning system (GPS) and digital mapping of roads, road network navigation services have become a basic application on many mobile devices. Path planning, a fundamental function of road network navigation services, finds a route between the specified start location and destination. The efficiency of this path planning function is critical for mobile users on roads due to various dynamic scenarios, such as a sudden change in driving direction, unexpected traffic conditions, lost or unstable GPS signals, and so on. In these scenarios, the path planning service needs to be delivered in a timely fashion. In this paper, we propose a system, namely, Path Planning by Caching (PPC), to answer a new path planning query in real time by efficiently caching and reusing historical queried-paths. Unlike the conventional cachebased path planning systems, where a queried-path in cache is used only when it matches perfectly with the new query, PPC leverages the partially matched queries to answer part(s) of the new query. Comprehensive experimentation on a real road network database shows that our system outperforms the stateof-The-Art path planning techniques by reducing 32% of the computation latency on average.

Original languageEnglish (US)
Title of host publicationProceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017
PublisherIEEE Computer Society
Pages15-16
Number of pages2
ISBN (Electronic)9781509065431
DOIs
StatePublished - May 16 2017
Event33rd IEEE International Conference on Data Engineering, ICDE 2017 - San Diego, United States
Duration: Apr 19 2017Apr 22 2017

Publication series

NameProceedings - International Conference on Data Engineering
ISSN (Print)1084-4627

Other

Other33rd IEEE International Conference on Data Engineering, ICDE 2017
CountryUnited States
CitySan Diego
Period4/19/174/22/17

Fingerprint

Motion planning
Global positioning system
Navigation
Mobile devices
Availability

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Zhang, Y., Hsueh, Y. L., Lee, W., & Jhang, Y. H. (2017). Efficient cache-supported path planning on roads (Extended abstract). In Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017 (pp. 15-16). [7929910] (Proceedings - International Conference on Data Engineering). IEEE Computer Society. https://doi.org/10.1109/ICDE.2017.14
Zhang, Ying ; Hsueh, Yu Ling ; Lee, Wang-chien ; Jhang, Yi Hao. / Efficient cache-supported path planning on roads (Extended abstract). Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017. IEEE Computer Society, 2017. pp. 15-16 (Proceedings - International Conference on Data Engineering).
@inproceedings{4bfc281d243742709f4e794a22c1e14a,
title = "Efficient cache-supported path planning on roads (Extended abstract)",
abstract = "Owing to the wide availability of the global positioning system (GPS) and digital mapping of roads, road network navigation services have become a basic application on many mobile devices. Path planning, a fundamental function of road network navigation services, finds a route between the specified start location and destination. The efficiency of this path planning function is critical for mobile users on roads due to various dynamic scenarios, such as a sudden change in driving direction, unexpected traffic conditions, lost or unstable GPS signals, and so on. In these scenarios, the path planning service needs to be delivered in a timely fashion. In this paper, we propose a system, namely, Path Planning by Caching (PPC), to answer a new path planning query in real time by efficiently caching and reusing historical queried-paths. Unlike the conventional cachebased path planning systems, where a queried-path in cache is used only when it matches perfectly with the new query, PPC leverages the partially matched queries to answer part(s) of the new query. Comprehensive experimentation on a real road network database shows that our system outperforms the stateof-The-Art path planning techniques by reducing 32{\%} of the computation latency on average.",
author = "Ying Zhang and Hsueh, {Yu Ling} and Wang-chien Lee and Jhang, {Yi Hao}",
year = "2017",
month = "5",
day = "16",
doi = "10.1109/ICDE.2017.14",
language = "English (US)",
series = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE Computer Society",
pages = "15--16",
booktitle = "Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017",
address = "United States",

}

Zhang, Y, Hsueh, YL, Lee, W & Jhang, YH 2017, Efficient cache-supported path planning on roads (Extended abstract). in Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017., 7929910, Proceedings - International Conference on Data Engineering, IEEE Computer Society, pp. 15-16, 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, United States, 4/19/17. https://doi.org/10.1109/ICDE.2017.14

Efficient cache-supported path planning on roads (Extended abstract). / Zhang, Ying; Hsueh, Yu Ling; Lee, Wang-chien; Jhang, Yi Hao.

Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017. IEEE Computer Society, 2017. p. 15-16 7929910 (Proceedings - International Conference on Data Engineering).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient cache-supported path planning on roads (Extended abstract)

AU - Zhang, Ying

AU - Hsueh, Yu Ling

AU - Lee, Wang-chien

AU - Jhang, Yi Hao

PY - 2017/5/16

Y1 - 2017/5/16

N2 - Owing to the wide availability of the global positioning system (GPS) and digital mapping of roads, road network navigation services have become a basic application on many mobile devices. Path planning, a fundamental function of road network navigation services, finds a route between the specified start location and destination. The efficiency of this path planning function is critical for mobile users on roads due to various dynamic scenarios, such as a sudden change in driving direction, unexpected traffic conditions, lost or unstable GPS signals, and so on. In these scenarios, the path planning service needs to be delivered in a timely fashion. In this paper, we propose a system, namely, Path Planning by Caching (PPC), to answer a new path planning query in real time by efficiently caching and reusing historical queried-paths. Unlike the conventional cachebased path planning systems, where a queried-path in cache is used only when it matches perfectly with the new query, PPC leverages the partially matched queries to answer part(s) of the new query. Comprehensive experimentation on a real road network database shows that our system outperforms the stateof-The-Art path planning techniques by reducing 32% of the computation latency on average.

AB - Owing to the wide availability of the global positioning system (GPS) and digital mapping of roads, road network navigation services have become a basic application on many mobile devices. Path planning, a fundamental function of road network navigation services, finds a route between the specified start location and destination. The efficiency of this path planning function is critical for mobile users on roads due to various dynamic scenarios, such as a sudden change in driving direction, unexpected traffic conditions, lost or unstable GPS signals, and so on. In these scenarios, the path planning service needs to be delivered in a timely fashion. In this paper, we propose a system, namely, Path Planning by Caching (PPC), to answer a new path planning query in real time by efficiently caching and reusing historical queried-paths. Unlike the conventional cachebased path planning systems, where a queried-path in cache is used only when it matches perfectly with the new query, PPC leverages the partially matched queries to answer part(s) of the new query. Comprehensive experimentation on a real road network database shows that our system outperforms the stateof-The-Art path planning techniques by reducing 32% of the computation latency on average.

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

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

U2 - 10.1109/ICDE.2017.14

DO - 10.1109/ICDE.2017.14

M3 - Conference contribution

AN - SCOPUS:85021217944

T3 - Proceedings - International Conference on Data Engineering

SP - 15

EP - 16

BT - Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017

PB - IEEE Computer Society

ER -

Zhang Y, Hsueh YL, Lee W, Jhang YH. Efficient cache-supported path planning on roads (Extended abstract). In Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017. IEEE Computer Society. 2017. p. 15-16. 7929910. (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2017.14