| 摘要 |
In a cost estimation step in step S1, costs from intermediate nodes to all exit nodes are estimated and, in a path generation step in step S2, paths are generated each by extending a current search path to an adjacent path. In a path storage step in step S3, a check is made for the generated paths and, if there are free entries in a storage unit, the paths are stored. In a path selection step in step S4, a path which is stored in the entries of all intermediate nodes and an entrance node in the storage unit, which is not yet selected, and whose total of a path costs and a minimum estimated cost is the minimum is selected as a current search path. In a path output step in step S6, paths stored in the exit nodes are output as a search result. |
