TY - GEN
T1 - Automatic construction of garage maps for future vehicle navigation service
AU - Zhou, Qian
AU - Ye, Fan
AU - Wang, Xiaoge
AU - Yang, Yuanyuan
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/12
Y1 - 2016/7/12
N2 - Digital garage maps are the basis for future vehicle navigation services such as smart parking management that displays the availability of parking spaces. It can direct drivers to empty ones, avoiding any searching, circulating in large, complex parking structures. However, such maps are not currently available, making it impossible to deploy smart parking management. Conducting manual survey incurs tremendous amount of human efforts, and cannot scale to large numbers of garages. In this paper, we propose three algorithms, Sequential Merging, Points Clustering and Segments Matching that can automatically construct complete and accurate garage maps using data crowdsensed from drivers. Upon entering and leaving the garage, the driver's smartphone collects inertial data, which are used to generate the vehicle's trajectory. Our algorithms fuse together these trajectories to recreate the size, layout of the garage. We compare the performance of the three algorithms using different garages. We find that Points Clustering is robust to trajectory errors, with F-score above 0.95 for trajectory length error up to 2 meters, Segments Matching can handle partial trajectories with arbitrary start/end locations, and it constructs the same map using trajectories much shorter than those needed by the other two algorithms.
AB - Digital garage maps are the basis for future vehicle navigation services such as smart parking management that displays the availability of parking spaces. It can direct drivers to empty ones, avoiding any searching, circulating in large, complex parking structures. However, such maps are not currently available, making it impossible to deploy smart parking management. Conducting manual survey incurs tremendous amount of human efforts, and cannot scale to large numbers of garages. In this paper, we propose three algorithms, Sequential Merging, Points Clustering and Segments Matching that can automatically construct complete and accurate garage maps using data crowdsensed from drivers. Upon entering and leaving the garage, the driver's smartphone collects inertial data, which are used to generate the vehicle's trajectory. Our algorithms fuse together these trajectories to recreate the size, layout of the garage. We compare the performance of the three algorithms using different garages. We find that Points Clustering is robust to trajectory errors, with F-score above 0.95 for trajectory length error up to 2 meters, Segments Matching can handle partial trajectories with arbitrary start/end locations, and it constructs the same map using trajectories much shorter than those needed by the other two algorithms.
UR - https://www.scopus.com/pages/publications/84981346557
U2 - 10.1109/ICC.2016.7511028
DO - 10.1109/ICC.2016.7511028
M3 - Conference contribution
AN - SCOPUS:84981346557
T3 - 2016 IEEE International Conference on Communications, ICC 2016
BT - 2016 IEEE International Conference on Communications, ICC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Conference on Communications, ICC 2016
Y2 - 22 May 2016 through 27 May 2016
ER -