Planning of moving path based on simplified terrain

This paper gives a definition of moving path planning based on summing up planning of 3D path, and points out planning method of moving path in real terrain is different from path planning in vertex graph. This paper simplifies the problem firstly, emphasizing on simplifying shape of obstacle, and seeing encasing box of planar convex polygon as simplified obstacle, and puts forward using modified Dijkstra algorithm to solve the problem, and we submit an algorithm of creating linking matrix of vertices of encasing box. Experiments prove the method can get shortest path, and have preferable applied importance.