| 摘要 |
PROBLEM TO BE SOLVED: To make guidable the shortest route by giving relay points with the scattering of dots obtained by combination and connecting and changing the orders of connections of the relay points by a permutation in searching for a route in which there are obstacles on a bitmap. SOLUTION: This method of solving route selection problem is performed so as to obtain an output by scattering unbiased relay points and performing distance calculation about only routes that do not get across an obstacle with connection changes using a permutation. In this method, only data to be the shortest route are stored as an output. COPYRIGHT: (C)2004,JPO
|
