Enhancing a star algorithm for robot path planning

Abstract

This paper describes the importance of robot path planning in artificial intelligence and control theory, and proposes three improvements to the A-algorithm: bi-directional A-search, improved heuristic functions and pruning strategies. The performance of the different algorithms in terms of computation time, path length and number of nodes is compared through experiments. Moreover, it is emphasised in the article that in practical applications suitable algorithms and their improvements are selected according to the characteristics of the specific problem and reasonable evaluation criteria are used to measure the performance of the algorithms.