| 摘要 |
PROBLEM TO BE SOLVED: To provide a method of automatically calculating the shortest free running route for giving the shortest free running distance to a robot. SOLUTION: A specified number of free running lines are selected from the moving procedure of the robot, patterns in which the specified number of free running lines, selected, are replaced are chosen and a pattern which forms the shortest free running distance, out of the patterns, is searched. If the pattern which forms the shortest free running distance exists, the selection of the specified number of free running lines and processing thereafter are kept on again, based on the pattern.
|
