A Map Database System for Route Navigation with Multiple Transit Points and Destination Points
Kunihiko Kaneko, Shinya Honda · 2016
This paper presents a map database system for route navigation. The system contains database describing roads, interest points (such as a bus stop, store, etc), and route images. The system also includes an index for efficient processing of the shortest path query. Given a set of candidate destination points and a set of candidate transit points, the system generates an index for shortest path query dynamically. Then, a computer system gets a starting point, and the system makes the shortest path that includes one of the candidate destination points and one of the candidate transit points. The k-shortest path (k-SPT) method is used to evaluate the shortest path query. The original version of k-SPT does not consider multiple number of destination points, then the implementation of k-SPT is modified.