首页> 外国专利> Method and device for determining the minimal cost path between two points in a road network

Method and device for determining the minimal cost path between two points in a road network

机译:确定道路网中两个点之间的最小成本路径的方法和设备

摘要

The invention relates to a network comprising numerous nodes which are paired by means of segments. The inventive method consists in: allocating a cost to each segment in the network; producing two path graphs, essentially from two points respectively; interrupting the production of the two graphs when they comprise at least a first common interference node; determining the two minimal cost paths which belong respectively to the two graphs; and linking the two minimal cost paths in order to obtain the minimal cost path between the two points. The invention also relates to a server which is used to implement said method.
机译:本发明涉及一种网络,该网络包括通过段配对的多个节点。本发明的方法包括:向网络中的每个段分配成本;产生两个路径图,基本上分别来自两个点;当两个图至少包括第一公共干扰节点时,中断两个图的产生;确定分别属于两个图的两条最小成本路径;并链接两个最小成本路径,以获得两点之间的最小成本路径。本发明还涉及用于实现所述方法的服务器。

著录项

  • 公开/公告号AU2002231861B2

    专利类型

  • 公开/公告日2008-05-15

    原文格式PDF

  • 申请/专利权人 WEBRASKA MOBILE TECHNOLOGIES;

    申请/专利号AU20020231861

  • 发明设计人 JULIEN SERRE;

    申请日2002-01-09

  • 分类号G01C21/34;

  • 国家 AU

  • 入库时间 2022-08-21 20:03:12

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号