Author
Listed:
- Quanjie Jiang
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
- Yue Shen
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
- Hui Liu
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
- Zohaib Khan
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
- Hao Sun
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
- Yuxuan Huang
(School of Electrical and Information Engineering, Jiangsu University, Zhenjiang 212013, China)
Abstract
Due to the complex spatial structure, dense tree distribution, and narrow passages in orchard environments, traditional path planning algorithms often struggle with large path deviations, frequent turning, and reduced navigational safety. In order to overcome these challenges, this paper proposes a hybrid path planning algorithm based on improved D* Lite for narrow forest orchard environments. The proposed approach enhances path feasibility and improves the robustness of the navigation system. The algorithm begins by constructing a 2D grid map reflecting the orchard layout and inflates the tree regions to create safety buffers for reliable path planning. For global path planning, an enhanced D* Lite algorithm is used with a cost function that jointly considers centerline proximity, turning angle smoothness, and directional consistency. This guides the path to remain close to the orchard row centerline, improving structural adaptability and path rationality. Narrow passages along the initial path are detected, and local replanning is performed using a Hybrid A* algorithm that accounts for the kinematic constraints of a differential tracked robot. This generates curvature-continuous and directionally stable segments that replace the original narrow-path portions. Finally, a gradient descent method is applied to smooth the overall path, improving trajectory continuity and execution stability. Field experiments in representative orchard environments demonstrate that the proposed hybrid algorithm significantly outperforms traditional D* Lite and KD* Lite-B methods in terms of path accuracy and navigational safety. The average deviation from the centerline is only 0.06 m, representing reductions of 75.55% and 38.27% compared to traditional D* Lite and KD* Lite-B, respectively, thereby enabling high-precision centerline tracking. Moreover, the number of hazardous nodes, defined as path points near obstacles, was reduced to five, marking decreases of 92.86% and 68.75%, respectively, and substantially enhancing navigation safety. These results confirm the method’s strong applicability in complex, constrained orchard environments and its potential as a foundation for efficient, safe, and fully autonomous agricultural robot operation.
Suggested Citation
Quanjie Jiang & Yue Shen & Hui Liu & Zohaib Khan & Hao Sun & Yuxuan Huang, 2025.
"A Hybrid Path Planning Algorithm for Orchard Robots Based on an Improved D* Lite Algorithm,"
Agriculture, MDPI, vol. 15(15), pages 1-25, August.
Handle:
RePEc:gam:jagris:v:15:y:2025:i:15:p:1698-:d:1718995
Download full text from publisher
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:15:y:2025:i:15:p:1698-:d:1718995. 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.