Enhancing the A* Algorithm for Efficient Route Planning in Agricultural Environments with a Hybrid Heuristic Approach and Path Smoothing

Abstract

The A* algorithm is broadly identified for its application in diverse fields, such as agriculture, robotics and GPS technology, due to its effectiveness in route planning. Despite its broad utility, the algorithm faces inherent limitations regarding operational efficiency and the length of the paths it generates. Addressing these constraints, this paper proposes an enhancement to the traditional A* algorithm that significantly improves its performance. Our innovative approach integrates Euclidean and Chebyshev distances into a single heuristic function, thereby enhancing pathfinding accuracy and flexibility. This combined heuristic leverages the strengths of both distance measures: the Euclidean distance provides an accurate straight-line measure between points, while the Chebyshev distance effectively handles scenarios allowing diagonal movement. Furthermore, we incorporate Bezier curves into the algorithm to smooth the generated paths. This addition is particularly advantageous in agricultural environments, where machinery must navigate complex terrains without causing damage to crops. The smooth paths produced by Bezier curves ensure more efficient and safer navigation in such settings. Comprehensive experiments conducted in various agricultural scenarios demonstrate the superior performance of the enhanced algorithm. These results reveal that the improved algorithm not only reduces the computation time needed for route planning but also generates shorter and smoother paths compared to the standard A* algorithm. The proposed approach significantly enhances the operational efficiency and route optimization capabilities of the A* algorithm, making it more suitable for complex and dynamic applications in agriculture. This advancement also holds promise for improving navigation systems in various other domains.