WEIGHTED ROUTE SEARCH PROBLEM

摘要

PROBLEM TO BE SOLVED: To search an impartial route search and to distribute an impartial work by applying a weighted vector matrix on a bit map, dispersing the relay points impartially by the combination, and changing serial in permutation. SOLUTION: A pseudo-random number Yt, 1or a PN signal is generated at high speed from a logistic map. The combination or the permutation is taken out, and the route visualized on the bit map to which the weighted vector matrix is applied is searched. COPYRIGHT: (C)2004,JPO