| Project/Area Number |
13680430
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | UNIVERSITY OF TSUKUBA |
|---|
Principal Investigator |
KANOH Hitoshi University of TSUKUBA, Institute of Information Sciences and Electronics, Associate Professor, 電子・情報工学系, 助教授 (40251045)
|
|---|
| Project Period (FY) |
2001 – 2002
|
| Project Status |
Completed (Fiscal Year 2002)
|
| Budget Amount *help |
¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2002: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2001: ¥700,000 (Direct Cost: ¥700,000)
|
|---|
| Keywords | Genetic Algorithm / Cellular Automata / Non-equilibrium / Path Planning / Digital Road Map / Car Navigation / 地図 |
|---|
| Research Abstract |
(1) This paper addresses the problem of selecting the easiest-to-drive and quasi-shortest route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting viral infection. The method is to use viruses as domain specific knowledge. A part of an arterial road is regarded as a virus. We generate a population of viruses in addition to a population of routes.
(2) To evaluate dynamic route selection methods, we developed a traffic flow simulator that uses cellula automata in a non-equilibrium environment where traffic congestion occurs frequently. The simulator uses the S standard map of the Navigation System Researchers' Association, which is the map used in actual car navigation devices, and produces environments where spontaneous traffic congestion occurs.
(3) A classification is established for the information required by drivers in selecting routes. The advantage of the method is that the driver's situation is expressed by environment information, destination information and vehicle information.
(4) Experiments with the system in a dynamic environment built from a real road map show that the GA-based method is superior to the Dijkstra algorithm for use in practical car navigation devices. The only point on which the DA is superior is the time required. In contrast to this, the GA is superior in terms of amenity over the entire time-span. Other particular points of superiority for the GA include a computational time in response to changes in the environmental information and destination which is about 60 times faster, in response to changes in the environmental information alone, the GA is about 100 to 300 times faster.
|
