| 智能交通系统的车辆行驶最佳路径算法 |
| |
| 引用本文： | 刘海燕.智能交通系统的车辆行驶最佳路径算法[J].北京工商大学学报(自然科学版),2006,24(1):53-55,68. |
| |
| 作者姓名： | 刘海燕 |
| |
| 作者单位： | 北京工商大学,计算机学院,北京,100037 |
| |
| 摘 要： | 图论中最短路径算法(例如D ijkstra算法)是一种静态的算法,车辆的驾驶路径是一个多元参数的动态过程.最佳路径计算需要在最短路径算法基础上考虑各种动态因素和突发事件.寻找一种动态车辆行驶最佳路径算法的研讨对于解决交通堵塞有着积极的意义.
|
| 关 键 词： | 智能交通 最佳路径 地理信息系统 |
| 文章编号： | 1671-1513（2006）01-0053-03 |
| 收稿时间： | 2005-03-16 |
| 修稿时间： | 2005-03-16 |
BEST-RUNNING-PATH ARITHMETIC OF VEHICLES IN INTELLIGENT TRANSPORT SYSTEM |
| |
| LIU Hai-yan.BEST-RUNNING-PATH ARITHMETIC OF VEHICLES IN INTELLIGENT TRANSPORT SYSTEM[J].Journal of Beijing Technology and Business University:Natural Science Edition,2006,24(1):53-55,68. |
| |
| Authors: | LIU Hai-yan |
| |
| Institution: | College of Computer Science and Technology, Beijing Technology and Business University, Beijing 100037, China |
| |
| Abstract: | The shortest-path arithmetic in diagram theory is a static arithmetic, while the running path of vehicles is a dynamic process of multiplex parameters, it needs to take every kind of dynamic factors and sharp accidents into account on the basis of the shortest-path arithmetic to find the best path. It is very meaningful to enter into finding the best-dynamic-running-path arithmetic for settling the jam problem. |
| |
| Keywords: | intelligent transport the best path geographic information system |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
