| 摘要 |
PROBLEM TO BE SOLVED: To search a route shortest and lowest in cost while following composite intersection traffic regulations existing over a plurality of intersections. SOLUTION: In an area where composite intersection traffic regulations exist, each node and each link used in a conventional network are respectively separated into a plurality of nodes and links. For instance, one node is separated into N1a-N1c, and one link is separated into L1a-L1c. The whole road network is expressed being divided into a road network (L1a, L2a, L3a, L4a, L5a, N1a, N2a) taking notice of approach links (L1a, L3a) uninfluenced by the composite intersection traffic regulations and road networksα(L1b, L2b, L3b, L4b, N1b, N2b) andβ(L1c, L2c, L3c, L5c, N1c, N2c) taking notice of approach links (L4b, L5c) influenced by the composite intersection traffic regulations. One-way traffic regulation is further set to the suitable link to express the composite intersection traffic regulations. With the use of such map data, a route following the composite intersection taffice regulations can be selected without specifal processing at the time of searching. |
