| 一种基于改进A~*算法的限制搜索区域的路径规划方法 |
| |
| 作者单位： | 青岛职业技术学院信息学院 山东青岛266555 |
| |
| 摘 要： | 本文根据已有A*算法,给出了一种改进的最优路径规划算法,此算法在根据道路的实际情况对路网进行分层的同时,根据实际路网的拓扑特性对搜索区域进行合理的限制,实验证明此算法在进行路径规划时节省了时间。
|
| 关 键 词： | 路径规划 搜索区域 A*算法 |
An Algorithm Based on Improved A~* Restrictions on the Path to Search Regional Planning Approach |
| |
| XU Zhan-peng,LIN Kai. An Algorithm Based on Improved A~* Restrictions on the Path to Search Regional Planning Approach[J]. Digital Community & Smart Home, 2008, 0(21) |
| |
| Authors: | XU Zhan-peng LIN Kai |
| |
| Abstract: | According to A* algorithm has been given an improved optimal path planning method, this algorithm in accordance with the actual situation of the road network of layered LO at the same time, according to the actual network topology of the region to search for reasonable Restrictions experiment proved that the algorithm in the path planning saving time |
| |
| Keywords: | Path planning Search region A* algorithm |
| 本文献已被 CNKI 等数据库收录！ |
