IDEAS home Printed from https://ideas.repec.org/a/gam/jagris/v14y2024i7p979-d1421043.html
   My bibliography  Save this article

Path Planning Algorithm of Orchard Fertilization Robot Based on Multi-Constrained Bessel Curve

Author

Listed:
  • Fanxia Kong

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Baixu Liu

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Xin Han

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Lili Yi

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Haozheng Sun

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Jie Liu

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Lei Liu

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

  • Yubin Lan

    (School of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China)

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.

Suggested Citation

  • Fanxia Kong & Baixu Liu & Xin Han & Lili Yi & Haozheng Sun & Jie Liu & Lei Liu & Yubin Lan, 2024. "Path Planning Algorithm of Orchard Fertilization Robot Based on Multi-Constrained Bessel Curve," Agriculture, MDPI, vol. 14(7), pages 1-18, June.
  • Handle: RePEc:gam:jagris:v:14:y:2024:i:7:p:979-:d:1421043
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2077-0472/14/7/979/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2077-0472/14/7/979/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jagris:v:14:y:2024:i:7:p:979-:d:1421043. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.