摘要 |
PROBLEM TO BE SOLVED: To provide a robot operation plan method capable of finding an attitude of a robot wherein a moving time of the robot becomes nearly shortest, in each teaching point. SOLUTION: In step S6, a moving time t<SB>k, j</SB>to an attitude Q<SB>i, j</SB>in a teaching point P<SB>i</SB>is found from an attitude Q<SB>i-1, k</SB>in the preceding teaching point P<SB>i-1</SB>. In step S7, it is confirmed whether a latest shortest moving time f<SB>i, j</SB>to the attitude Q<SB>i, j</SB>from an evacuation point P<SB>0</SB>is larger than a sum of the moving time t<SB>k, j</SB>and the shortest moving time f<SB>i-1, k</SB>to the attitude Q<SB>i-1, k</SB>from the retraction point P<SB>0</SB>or not. It proceeds to step S8 when large, and it proceeds to step S9 when not large. In step S8, the sum of the moving time t<SB>k, j</SB>and the shortest moving time f<SB>i-1, k</SB>is set as a new shortest moving time f<SB>i, j</SB>to the attitude Q<SB>i, j</SB>from the retraction point P<SB>0</SB>, and is stored together with an attitude number k. COPYRIGHT: (C)2006,JPO&NCIPI
|