CAJ | 학술논문

车载导航系统中的动态路线选择是其必备功能之一，文中分析了经典Dijkstra算法存在的不足，并在此基础上，采用优化的邻接矩阵存储结构，讨论了有障碍物存在情况下的最短路径问题。同时用VC++与MapX实现了有障碍物存在的动态最短路径算法。实验结果表明，该算法能有效求出有障碍物存在时的最短路径。
차재도항계통중적동태로선선택시기필비공능지일，문중분석료경전Dijkstra산법존재적불족，병재차기출상，채용우화적린접구진존저결구，토론료유장애물존재정황하적최단로경문제。동시용VC++여MapX실현료유장애물존재적동태최단로경산법。실험결과표명，해산법능유효구출유장애물존재시적최단로경。
Dynamic route choice is one of the essential functions in n car navigation system. The deifciencies of classic Dijkstra algorithm are analyzed, and on this basis, the problems of obstacles-existed shortest path are discussed by using optimized adjacency matrix storage structure. The dynamic shortest path algorithm with the obstacles existing is realized by using VC++ and MapX. Experimental results show that the proposed algorithm can effectively work out the shortest path with the obstacles existing.