RUNNING PATH DETERMINING METHOD OF UNATTENDED CAR

• Main Authors: OOBA SHIYUNJI, HOSOBUCHI EIJI, KOBAYASHI NAOYA, KANAZAWA JIYUNPEI
• Format: Patent
• Language: English
• Published: 11.11.1985
• Subjects: CALCULATING; COMPUTING; CONTROLLING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS; REGULATING; SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES

PURPOSE:To reduce the shortest path determining work by cutting virtually a running path of a closed circuit, using it as an open circuit, generating a pair of maps which have reduced paths reaching a destination point from a departure point to one path, and determining the shortest path based on these maps. CONSTITUTION:In case of deriving the shortest path for reaching a destination point S2 from a departure point S1, a closed circuit 2 is opened by cutting suitably a running path 4 of the closed circuit 2, and maps 7, 8 and tree-shaped drawings 7a, 8a corresponding to them are obtained. Before passing through the first branch point X, a path for reaching S2 from the point X is derived in the maps 7, 8. In the map 7, X and a branch B7 are in a connected state, therefore, in the map 8, too, it is acknowledged to go into the branch B7 from X. When seeing the map 7 and the tree-shaped drawing 7a based on this assumption, the other end of the branches B7, B8 becomes the end of the path, therefore, in the map 7, it is decided that no running path exists. On the other hand, when seeing the map 8 and the tree-shaped drawing 8a, a path of X B8 B10 B9 S2 and a path of X B7 B9 S2 are obtained, and a shorter path is derived by comparing the distances of these paths.