论文部分内容阅读
Path planning of amphibious vehicles on military to-pographic maps is a hot research topic in the field of amphibious tactical training simulation.According to the dynamic characteris-tics and maneuvering destination requirements of amphibious vehicles,a three-dimensional simulation model of amphibious vehicles is designed,and a straight-line driving and steering dy-namic model is constructed.The optimal maneuvering destination and constraint conditions under the condition of unconnected graph are put forward,and the problems of simulation and ma-neuvering path planning of amphibious vehicles on unconnected graph are solved by the theory of region partition and shortest path of graph.Compared with Dijkstra algorithm and heuristic algo-rithm A*,the experimental results show that the algorithm de-signed in this paper has superior applicability and time performance