| Paper Abstract and Keywords |
| Presentation |
2011-01-25 13:10
Data Structure that Makes Extended Dijkstra Method Work.
Tomoaki Ogawa (NIT) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
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. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
The extend Dijkstra method / Optimal route search / Comfortable drive / / / / / |
| Reference Info. |
IEICE Tech. Rep. |
| Paper # |
|
| Date of Issue |
|
| ISSN |
|
| Download PDF |
|
| Conference Information |
| Committee |
KBSE |
| Conference Date |
2011-01-24 - 2011-01-25 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Kikai-Shinko-Kaikan Bldg. |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
Knowledge-Based Software Engineering, etc. |
| Paper Information |
| Registration To |
KBSE |
| Conference Code |
2011-01-KBSE |
| Language |
Japanese |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Data Structure that Makes Extended Dijkstra Method Work. |
| Sub Title (in English) |
|
| Keyword(1) |
The extend Dijkstra method |
| Keyword(2) |
Optimal route search |
| Keyword(3) |
Comfortable drive |
| Keyword(4) |
|
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Tomoaki Ogawa |
| 1st Author's Affiliation |
Nippon Institute of Technology (NIT) |
| 2nd Author's Name |
|
| 2nd Author's Affiliation |
() |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| Speaker |
Author-1 |
| Date Time |
2011-01-25 13:10:00 |
| Presentation Time |
45 minutes |
| Registration for |
KBSE |
| Paper # |
|
| Volume (vol) |
vol.110 |
| Number (no) |
no.386 |
| Page |
|
| #Pages |
|
| Date of Issue |
|