Multi Objective Path Finding Based on Adding-Weight A* Algorithm
Multi-objective path planning is a path planning problem when there are more than one objective function to be optimized at the same time. This paper is based on traditional A* algorithm.To improve the algorithm A* and find out the shortest path in the different environments,we choose different weights and do global path planning by using improved evaluation function.We use the minimum binary heap in a linked list structure to manage the OPEN table,and the search efficiency has been improved.We compile the simulation program of path planning in the VC environment,then compare the operation time and generated paths by transforming the coordinates of the initial node and the goal node.Research shows that, the algorithm can improve the efficiency of the path planning efficiently.
Wen-Pei Sung and Jimmy (C.M.) Kao
Q. Wang et al., "Multi Objective Path Finding Based on Adding-Weight A* Algorithm", Advanced Materials Research, Vols. 1079-1080, pp. 711-715, 2015