首页> 外文会议>Saint Petersburg International Conference on Integrated Navigation Systems; 20030526-28; St.Petersburg(RU) >USING TURN RESTRICTIONS FOR FASTER ROUTE PLANNING WITH PARTITIONED ROAD NETWORKS
【24h】

USING TURN RESTRICTIONS FOR FASTER ROUTE PLANNING WITH PARTITIONED ROAD NETWORKS

机译:将转弯限制用于带分区路网的快速路由规划

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

摘要

We investigate the planning of optimum routes in large real-world road networks, by using a graph partitioning approach. Very specific for real-world road networks is the presence of turn restrictions. We consider the problem of planning optimum routes in partitioned graphs, where the original graph, and thus the created reduced graph, contains turn restrictions. We discuss the consequences of the presence of turn restrictions for the creation of reduced graphs. Then we create a new reduced graph based on the original graph partition. When constructing this new reduced graph, we use the presence of turn restrictions in the original graph to our advantage. We develop a new planning algorithm to plan with the new reduced graph and the original graph partition. We compare the number of function evaluations of this algorithm for the old and new reduced graph, for several planning criteria on several real-world road networks. We conclude that our algorithm performs significantly better for the new reduced graph than for the old one. Our algorithm applied to the old reduced graph is, in turn, faster than the generalized A~* -algorithm for unpartitioned graphs.
机译:我们使用图分区方法来研究大型现实世界道路网络中最佳路线的规划。对于现实世界的道路网而言,非常具体的是转弯限制。我们考虑在分区图中规划最佳路线的问题,其中原始图以及因此创建的缩小图都包含转弯限制。我们讨论了转弯限制的存在对创建简化图形的后果。然后,基于原始图分区创建一个新的简化图。在构造此新的简化图时,我们利用原始图中存在转弯限制的优势。我们开发了一种新的计划算法,以使用新的缩小图和原始图分区进行计划。我们比较了该算法对旧约图和新约图的功能评估的数量,以及在多个现实世界道路网络上的几个规划标准。我们得出的结论是,对于新的缩小图,我们的算法比旧的算法具有明显更好的性能。反过来,我们对旧约简图应用的算法比未分区图的广义A〜*-算法更快。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号