| 摘要 |
A suitable waypoint is selected using a goal score, a section from a start point to a goal point through the waypoint is divided into a plurality of sections based on the waypoint with a solution of inverse kinematics, and trees are simultaneously expanded in the sections using a Best First Search & Rapidly Random Tree (BF-RRT) algorithm so as to generate a path. By this configuration, a probability of local minima occurring is decreased compared with the case where the waypoint is randomly selected. In addition, since the trees are simultaneously expanded in the sections each having the waypoint with a solution of inverse kinematics, the solution may be rapidly obtained. A time consumed to search for an optimal motion path may be shortened and path plan performance may be improved.
|
