基于Dijkstra算法和OpenCV的交通导航  

Traffic Navigation based on Dijkstra Algorithm and OpenCV

作　　者：丁业兵[1] 李敬仕[1] 吴静[1] 张静[1] 

机构地区：[1]安徽邮电职业技术学院通信工程系

出　　处：《微型电脑应用》2013年第7期42-44,共3页Microcomputer Applications

摘　　要：最短路径是交通路线导航系统的关键问题,使用Dijkstra算法可以有效解决简单有向网络图中任意两个顶点之间的最短路径问题。应用开源计算机视觉库(OpenCV)开发了模拟城市交通导航系统,该导航系统给出了直观的人机交互图像界面,在图像上标记好起讫点后,即运用Dijkstra算法寻找两地间的最短路径和距离,并可用图标标记最短路径节点、线段指示线路,最后模拟小汽车沿着最短路径线路行驶。The shortest path is the key problem of the traffic route navigation system, Dijkstra algorithm can effectively find the shortest path between any two vertices in simple directed network map. This paper introduced the simulated system of city traffic navigation with Open Source Computer Vision Library （OpenCV）. The navigation system uses intuitive graphical interface of hu- man-computer interaction. Marked start and end points in the image, Dijkstra algorithm is to find the shortest path and the distance between the two places, the available icon marks the shortest path nodes, and the line indicate the path, and the last, analog car trav- eling along the shortest path line.

关 键 词：最短路径 DIJKSTRA算法 交通导航 人机交互 图像界面 

分 类 号：TP317.4[自动化与计算机技术—计算机软件与理论]