Abstract

Path planning is the core problem of orchard fertilization robots during their operation. The traditional full-coverage job path planning algorithm has problems, such as being not smooth enough and having a large curvature fluctuation, that lead to unsteady running and low working efficiency of robot trajectory tracking. To solve the above problems, an improved A* path planning algorithm based on a multi-constraint Bessel curve is proposed. First, by improving the traditional A* algorithm, the orchard operation path can be fully covered by adding guide points. Second, according to the differential vehicle kinematics model of the orchard fertilization robot, the robot kinematics constraint is combined with a Bessel curve to smooth the turning path of the A* algorithm, and the global path meeting the driving requirements of the orchard fertilization robot is generated by comprehensively considering multiple constraints such as the minimum turning radius and continuous curvature. Finally, the pure tracking algorithm is used to carry out tracking experiments to verify the robot’s driving accuracy. The simulation and experimental results show that the maximum curvature of the planned trajectory is 0.67, which meets the autonomous operation requirements of the orchard fertilization robot. When tracking the linear path in the fertilization area, the average transverse deviation is 0.0157 m, and the maximum transverse deviation is 0.0457 m. When tracking the U-turn path, the average absolute transverse deviation is 0.1081 m, and the maximum transverse deviation is 0.1768 m, which meets the autonomous operation requirements of orchard fertilization robots.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.