| 基于车辆导航的一种改良动态最短路径算法 |
| |
| 引用本文： | 张一珂,刘鸿剑,朱志斌.基于车辆导航的一种改良动态最短路径算法[J].科技广场,2009(5):26-28. |
| |
| 作者姓名： | 张一珂 刘鸿剑 朱志斌 |
| |
| 作者单位： | 1. 东华理工大学,江西,抚州,344000
2. 甘肃省电力设计院,甘肃,兰州,730020 |
| |
| 摘 要： | 车辆导航的一个基本问题是如何在一个即时的动态交通网中找到最优路径,现有的算法不是太复杂,就是不能很好地处理当移动物体的位置及交通环境同时发生变化所造成的复杂环境.本文推荐一种A*算法的变种-A*终身计划(Lifelong Planning A*,LPA*),并在该算法的基础上进行了改良,提出了采用特定椭圆修剪不必要的查询节点,以提高动态搜索的速度.
|
| 关 键 词： | 导航 动态最短路径 |
An Improved Dynamic Shortest Path Algorithm for Vehicle Navigation |
| |
| Zhang Yike,Liu Hongdian,Zhu Zhibin.An Improved Dynamic Shortest Path Algorithm for Vehicle Navigation[J].Science Mosaic,2009(5):26-28. |
| |
| Authors: | Zhang Yike Liu Hongdian Zhu Zhibin |
| |
| Institution: | 1.East China Institute of Technology;Jiangxi Fuzhou 344000;2.Electric Power Desigh Institute of Gansu Province;Gansu Lanzhou 730020 |
| |
| Abstract: | Finding an optimal route in dynamic real-time transportation networks is a critical problem for vehicle navigation. Existing approaches are either too complex or incapable of managing complex circumstances where both the location of a mobile object and traffic conditions change over time. In this paper, we proposed an incremental search approach based on a variation of the A* algorithm-Lifelong Planning A*. In addition, we suggested using an ellipse to prune the unnecessary nodes to be scanned in order to s... |
| |
| Keywords: | LPA* |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
