Obstacle Avoidance Planning of Manipulator Joints Based on an Improved Artificial Potential Field Method
Aiming at the problems in the path planning of the manipulator by artificial potential field (APF) method, a method combining the APF adaptive variable step size in the joint space and goal-biased rapidly-exploring random tree (RRT) is proposed. The APF obstacle avoidance planning is performed in th...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Office of Journal of Mechanical Transmission
2023-10-01
|
| Series: | Jixie chuandong |
| Subjects: | |
| Online Access: | http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2023.10.004 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Aiming at the problems in the path planning of the manipulator by artificial potential field (APF) method, a method combining the APF adaptive variable step size in the joint space and goal-biased rapidly-exploring random tree (RRT) is proposed. The APF obstacle avoidance planning is performed in the joint space to reduce the number of inverse kinematics and the sudden change of joint angles. The collision and target unreachability problems in the path planning are solved by improving the repulsive and gravitational potential field functions. The Cauchy probability distribution is used to change the joint angle step size through the distance between the end point and the obstacle. By adjusting the bias of the RRT algorithm, suitable temporary target points are generated to solve the local minima problem of the APF. The obstacle avoidance simulation of the manipulator is carried out in the presence of local minima of the APF. Adaptive variable-step path planning can generate smooth trajectories and improve the search efficiency. The goal-biased RRT selects the temporary target point and the overall path length becomes smaller. The picking manipulator can effectively meet the requirements of obstacle avoidance picking tasks under the improved algorithm. |
|---|---|
| ISSN: | 1004-2539 |