首页> 外国专利> ROUTE PLANNING ALGORITHM FOR EFFICIENTLY SEARCHING THROUGH MEANINGFUL LINKS WITHIN A DEFINED TOPOLOGY

ROUTE PLANNING ALGORITHM FOR EFFICIENTLY SEARCHING THROUGH MEANINGFUL LINKS WITHIN A DEFINED TOPOLOGY

机译:路由设计算法,可在定义的拓扑结构中有效地通过有意义的链接进行搜索

摘要

A system and method for identifying a route to a location for a vehicle including generating a topographic map of a parking area having a plurality of parking spaces and a plurality of roads. A plurality of nodes are established on the topographic map, wherein each of the nodes has latitude and longitudinal coordinates. A plurality of links are established on the topographic map. The links each extend between two of the nodes. One of the nodes is established as a starting node at which the vehicle starts and one of the nodes is established as a target node. A route is established to the target node that follows a series of the links to the target node using Dijkstra's algorithm. The route is determined based on a cost associated with each link for purposes of establishing the route with Dijkstra's algorithm.
机译:一种用于识别到车辆位置的路线的系统和方法,包括生成具有多个停车位和多条道路的停车区的地形图。在地形图上建立了多个节点,其中每个节点都具有纬度和纵向坐标。在地形图上建立了多个链接。每个链接都在两个节点之间延伸。节点之一被建立为车辆开始的起始节点,并且节点之一被建立为目标节点。使用Dijkstra的算法建立到目标节点的路由,该路由遵循到目标节点的一系列链接。为了与Dijkstra算法建立路由,基于与每个链接相关的成本确定路由。

著录项

  • 公开/公告号US2020209001A1

    专利类型

  • 公开/公告日2020-07-02

    原文格式PDF

  • 申请/专利权人 ZENUITY AB;

    申请/专利号US201816235691

  • 发明设计人 JON DEE DEMERLY;MADHURA GANDHI;SEAN YANG;

    申请日2018-12-28

  • 分类号G01C21/34;G01C21/20;

  • 国家 US

  • 入库时间 2022-08-21 11:22:16

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号