| An optimum vehicular path solution with multi-heuristics | |
| Lu F. | |
| 2004 | |
| 会议名称 | Lecture Notes in Computer Science |
| 关键词 | algorithms |
| 页码 | 964-971 |
| 英文摘要 | Heuristics have been widely used in artificial intelligence related fields including path finding. In this paper, the author argue that different heuristics can be integrated to solve the path finding problems and set forward a solution integrating greedy heuristic, directional heuristic and hierarchical heuristic. In greedy heuristic, an improved Dijkstra's algorithm based on quad heap is set forward. Then an MBR for ellipse is presented to limit the searching extent. Thirdly, hierarchical spatial reasoning is used to build another heuristic considering the hierarchical structure of road network, which makes the optimum path selection completed in higher hierarchies as much as possible. A case study is carried out with a real road network to verify the efficiency and validation of the solution integrating the above algorithms. |
| 收录类别 | CPCI |
| 会议录出版者 | Springer-Verlag Berlin |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 3-540-22129-8 |
| 内容类型 | 会议论文 |
| 源URL | [http://ir.igsnrr.ac.cn/handle/311030/25213]  |
| 专题 | 地理科学与资源研究所_历年回溯文献 |
| 推荐引用方式 GB/T 7714 | Lu F.. An optimum vehicular path solution with multi-heuristics[C]. 见:Lecture Notes in Computer Science. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论