| 一种基于预测信息的时间依赖网络路径规划算法 |
| |
| 引用本文： | 孙奥,朱桂斌,江铁.一种基于预测信息的时间依赖网络路径规划算法[J].西南科技大学学报,2012(2):48-52. |
| |
| 作者姓名： | 孙奥 朱桂斌 江铁 |
| |
| 作者单位： | 重庆通信学院应急通信重庆市重点实验室 |
| |
| 基金项目： | 重庆市科技攻关项目(CSTC,2010AC2037) |
| |
| 摘 要： | 对时间依赖路网最短路径规划算法的研究是车辆动态导航技术领域研究的热点之一。针对最小时间规划算法存在的不足,在研究SPFA(Shortest Path Faster Algorithm)静态规划算法的基础上,结合两种算法的优点,提出了一种改进的基于路况预测信息的最小时间路径规划算法,并通过实例进行了验证。结果表明,新算法能够提供实时、高效、预测性强的规划路径,在城市交通中能较好满足用户需求。
|
| 关 键 词： | 路径规划 最小时间规划算法 SPFA算法 时间依赖网络 |
A Path Planning Algorithm Based on Forecasting Information in Time-dependent Network |
| |
| SUN Ao,ZHU Gui-bin,JIANG Tie.A Path Planning Algorithm Based on Forecasting Information in Time-dependent Network[J].Journal of Southwest University of Science and Technology,2012(2):48-52. |
| |
| Authors: | SUN Ao ZHU Gui-bin JIANG Tie |
| |
| Institution: | (Chongqing Key Laboratory of Emergency Communication,Chongqing Communication Institute, Chongqing 400035,China) |
| |
| Abstract: | Time-dependent road network of the shortest path planning algorithm is one of the hotspots of vehicle dynamic navigation technology.In allusion to deficiencies of the two minimum time planning algorithms,based on the SPFA(Shortest Path Faster Algorithm) static planning algorithm,and combined with the advantages of the first two planning algorithms,a minimum time path planning improved algorithm was proposed.It is verified by examples.The results show that the algorithm can provide path planning with real-time,high efficiency and predictability.It better meets the needs of users in urban traffic. |
| |
| Keywords: | Path planning Minimal time Planning algorithm SPFA algorithm Time-dependent networks |
| 本文献已被 CNKI 等数据库收录！ |
