To provide a technology for preventing considerable increase in processing time and storage capacity when applying an algorithm for a shortest route search of a graph by a best priority search by modeling the problem to be solved to a weighted graph with respect to the whole of the problem area.
A device dynamically forms a graph in only a part required for retrieval while searching a graph by a following process. At first dividing a problem area (1), forming a graph in only an area including a starting point (2), and starting a search for a shortest route search from the area (3), a graph of an adjacent area is formed after the progress of the search to a node of a boundary in the area. At the same time, graphs of a present searching area and the formed adjacent area are merged. The process shown by (3) is repeated until the search reaches the endpoint.
Shiro Takayanagi
Yasuhiro Otsuka
Shuji Kimura