In the traditional path planning of anti-ship missile (ASM), it is difficult to take into account the problem of both cruising security and fast approaching target； for this, an algorithm of path planning based on regional division is proposed. Firstly, the models of “threat tactical area” and “target tactical area” are established respectively based on the relative positions of the target point and the tactical area. Secondly, the “threat tactical area” is used to calculate the shortest distance of Voronoi diagram by Dijkstra algorithm, then the self-adaptive fold line is used to process the path. The “target tactical area” is used to quickly plan the shortest distance and the minimum number of turning points path by the binary tree algorithm. Simulation results show that the proposed algorithm has more optimal path parameters compared with the Voronoi diagram and is more secure than the binary tree algorithm. At the same time, the generated path planning network can provide multiple path references for the cooperative attacking of anti-ship missile.