首页> 外国专利> HIERARCHICAL GRAPH-BASED PATH SEARCHING METHOD, AND PATH SEARCHING METHOD IN INTERNET OF THINGS ENVIRONMENT, USING SAME

HIERARCHICAL GRAPH-BASED PATH SEARCHING METHOD, AND PATH SEARCHING METHOD IN INTERNET OF THINGS ENVIRONMENT, USING SAME

机译:基于层次图的路径搜索方法以及物联网环境中的路径搜索方法

摘要

The present invention relates to a hierarchical graph-based path searching method and, according to the present invention, the hierarchical graph-based path searching method comprises: a first graph abstracting step of configuring a target space as a grid map and dividing an area so as to set a start vertex and a target vertex, and defining each vertex of the divided areas as a basic hub so as to generate a first abstract graph; a second graph abstracting step of defining, as a basic hub, a vertex having a high degree centrality among vertices of each area of the first abstract graph, and connecting the basic hub so as to generate a second abstract graph; a graph searching step of searching for the shortest path between the start vertex and the target vertex in the second abstract graph; and a materialization step of projecting, on the grid map, the path searched for in the graph searching step, and materializing the same.
机译:本发明涉及基于分层图的路径搜索方法,并且根据本发明,基于分层图的路径搜索方法包括:第一图形抽象步骤,其将目标空间配置为网格图并划分区域。设置起始顶点和目标顶点,并将划分区域的每个顶点定义为基本枢纽,以生成第一抽象图;第二图形抽象步骤,将在第一抽象图形的各个区域的顶点之间具有高度中心度的顶点定义为基本中心,并连接基本中心以生成第二抽象图形;图搜索步骤,其在第二抽象图中搜索起始顶点与目标顶点之间的最短路径;实体化步骤是在网格图上投影在图搜索步骤中搜索的路径并将其实体化。

著录项

  • 公开/公告号WO2018012855A1

    专利类型

  • 公开/公告日2018-01-18

    原文格式PDF

  • 申请/专利权人 SAMJIN LND CO. LTD;

    申请/专利号WO2017KR07423

  • 发明设计人 SEO EUN SEOK;

    申请日2017-07-11

  • 分类号H04L12/721;H04L12/715;H04L29/08;

  • 国家 WO

  • 入库时间 2022-08-21 12:46:24

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号