| (英) |
Routes selection is one of the most important problems for a car navigation system.Moreover, when selecting a path, the route connected with the destination can be multifarious. Most current car navigation systems propose the shortest path from the origin to the destination. But the shortest route is not necessarily most suitable for the user. At times, they propose a shortest path that may be disadvantageous to the user. A definition is given based on that, the user wants the path to be the shortest and most comfortable path for him or her. In other words, the driver wants to have a car navigation system that proposes the subjectively optimal route for him or her. In this paper, such a car navigation system is constructed. At times, defining various situations that may become unpleasant and demand a comfortable path. And, the search technique uses the Dijkstra method. The Dijkstra method is the most famous technique for requesting the shortest route. In this paper, we propose a route search method that can propose a comfortable route by extending Dijkstra's algorithm and data structure. We show a system that corresponded to a large scale search area and a lot of objectionable information. |