Earticle

초록

영어

Mainly targeting at a small-city level road network, this paper builds an in-memory index for fast map matching, one of the most fundamental building blocks for vehicle information services. For the ESRI shape file sequentially storing road objects such as intersections and links, our indexing scheme obtains the offset of each link and creates the corresponding record consisting of link id, two end points, and the offset. Along with node entries, each of which includes all emanating links for a node, this index makes it possible to traverse the shape file just like Dijkstra’s shortest path algorithm, while all index traversal steps are done within memory. The previous location of a vehicle gives the start point of a map match process, significantly reducing the number of links to check if they include a specific point. This scheme particularly helps us to build an analyzer application for a series of spatio- temporal streams such as battery discharge dynamics.

목차

Abstract
 1. Introduction
 2. Related Work
 3. System Configuration
 4. Indexing Scheme
 5. Conclusions
 References

키워드

저자

• Junghoon Lee [ Jeju National University, Republic of Korea ]
• Gyung-Leen Park [ Jeju National University, Republic of Korea ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605