【24h】

An Optimum Vehicular Path Solution with Multi-heuristics

机译:具有多种启发式的最优车辆路径解决方案

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:启发式方法已广泛应用于人工智能相关领域,包括路径查找。在本文中,作者认为可以集成不同的启发式方法来解决寻路问题,并提出一种将贪婪启发式,定向启发式和分层启发式结合起来的解决方案。在贪婪启发式算法的基础上,提出了一种改进的基于四堆的Dijkstra算法。然后提出了一种椭圆的MBR来限制搜索范围。第三,考虑路网的层次结构,采用层次空间推理来构建另一种启发式方法,从而使最佳路径选择尽可能地在较高层次中完成。通过一个真实的道路网络进行案例研究,以验证集成上述算法的解决方案的效率和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号