利用Dijkstra与A*算法实现船舶导航算路

Using Dijkstra A* algorithm to implement ship navigation arithmetic

在现实导航应用中,为了得到最短路径,一般会采用智能算法去验证每个步骤,然后选出最优的一条路径。为了简化船舶导航路径的计算,本文采用Dijkstra算法,对航行规划图中的每个节点间的航行轨迹进行优化,从而获得最优的路径。然后结合A*算法,对此路径的航行状态进行监测与验证,从而保证船舶导航算路达到最好的状态。

In realistic navigation applications, in order to get the shortest path, the intelligent algorithm is usually sampled to verify each step, and then select the best one path. In order to simplify the calculation of ship navigation path, this paper uses Dijkstra algorithm to optimize the navigation trajectory of each node in the navigation plan, so as to obtain the optimal path. And then combined with the A* algorithm, the navigation state of this path to monitor and verify, thus ensuring the ship navigation operator to achieve the best state.