Research on navigation of bidirectional A* algorithm based on ant colony algorithm

To overcome the lengthy search time, massive space occupation, and overlong planned path of the traditional A* algorithm, this paper integrates the bidirectional search with the intelligent ant colony algorithm to obtain the heuristic function selection factor, and uses the factor to improve the evaluation function of the algorithm. The simulation results show that the improved algorithm achieved better dynamic navigation than the traditional A* algorithm both in search time and distance, featuring shorter path searching time and the algorithm running time. Therefore, the result of this research has effectively reduced the search time and enhanced the dynamic search.

Automated summary

This study combines bidirectional search with the intelligent ant colony algorithm to improve the evaluation function of the A* algorithm by obtaining a heuristic function selection factor. The results show that the improved algorithm significantly reduces search time and enhances dynamic search performance.