Path planning of improved A* algorithm based on bidirectional search
In order to address the issue of slow search speed in the traditional A*algorithm for path planning,a novel approach based on bidirectional search,known as the improved A*algorithm,is proposed.This new algorithm utilizes the Euclidean distance as the heuristic function and incorporates bidirectional search strategy.Additionally,it employs a 24-neighborhood search method and dynamically adjusts the weight coefficients of the heuristic function using an adaptive map,thereby enhancing the efficiency of path planning and adapting to different maps.Two sets of simulation experiments were conducted in different environments.Results demonstrate significant performance improvements of the algorithm in terms of the number of search nodes and planning time,as compared with the four existing algorithms.
NETL
NSTL
万方数据
