Optimization and application of artificial intelligence routing algorithm

Abstract

In order to optimize the artificial intelligence routing algorithm, combined with the calculation of the direction of the vector space model, three strategies are proposed to optimize the A* algorithm. The A* algorithm is widely used in the fields of GIS system and game path finding system. However, with the expansion of the scale of the search map, its performance consumption has increased exponentially. First of all, the first step of A* algorithm is to move towards the target direction by using directional factors, so that the intermediate route process will approach the shortest path as soon as possible. Secondly, the direction factor is used to ensure that the path finding of A* algorithm is the priority point in the direction of the target. Finally, the fault tolerance process is carried out. When the direction factor is guided to the “dead end”, it can be traced back, to ensure that the shortest path can be found at the end. The results show that the A * optimization algorithm is effective. The performance of A * optimization algorithm is about 20–50% higher than the traditional A * algorithm. The best case reached 88.6%. Therefore, the proposed optimization method improves the efficiency of the algorithm and reduces the performance consumption of the algorithm.