Abstract

Autonomous bulldozers encounter critical challenges in dynamic path planning in complex construction environments such as dynamic obstacles and narrow passages. Bio-inspired neural networks (BINN) are commonly employed for real-time path planning in dynamic environments. However, the algorithm is not feasible enough to calculate the positive input of neighbour cells, thus resulting in unreasonable distribution of activity values in the obstacle-dense regions. Additionally, the use of regular grids results in excessive computation. These drawbacks cause the algorithm to plan irrational paths and reduce computational efficiency. This study proposed an activity-value-optimised BINN and adaptive cell decomposition for the dynamic path planning of autonomous bulldozers. First, an adaptive cell decomposition method was proposed to model a highly intricate and constantly evolving environment, resulting in a reduction in the computational workload of the BINN. Second, the calculation of the activity value is optimised by enhancing the shunt equation of the BINN, which considers both obstacles and grid levels. This improvement enabled more reasonable distribution results. The smoothness of dynamic path planning is refined by incorporating the turning radius, which can be more effectively integrated with local path planning. Compared with the original BINN algorithm and other baseline algorithms, a practical large-scale hydropower project application demonstrated that the proposed method can effectively reduce the number of computational iterations, enrich the travel direction, and improve path quality while ensuring dynamic obstacle avoidance.

Full Text
Paper version not known

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.