首页> 外国专利> METHOD FOR EXECUTING AN OPTIMUM AND SAFE ROUTING PLAN USING AN S* ALGORITHM

METHOD FOR EXECUTING AN OPTIMUM AND SAFE ROUTING PLAN USING AN S* ALGORITHM

机译:S *算法执行最优和安全路由计划的方法

摘要

PURPOSE: A method for executing an optimum and safe routing plan is provided to define danger areas in the entire route for safe autonomous navigation, compose a grid map using a repulsion function of recognition limited areas, and consider the danger repulsive power according to the level of danger, thereby establishing an optimum and safe routing plan.;CONSTITUTION: An S* algorithm reads the entire map of a region (S1) and composes a grid map from the map (S2). Based on the regional closure characteristics, a region with collision danger is defined as a danger area (S3). A region with frequent accidents or congestion is defined as an urgent area, and the definition is reflected to the grid map (S4). When a start point and an end point are given (S5), nodes adjacent to the start node are added into an open list where unexplored nodes are recorded (S6). Based on a safety cost evaluation function, nodes with the minimum safety cost, among nodes adjacent to the current node, are selected, and the safest node is identified (S7). A node for which the search is completed is added into a closed list where already explored nodes are recorded so that those nodes are not to be searched any more (S8).;COPYRIGHT KIPO 2013
机译:目的:提供一种用于执行最佳和安全的路线计划的方法,以定义整个路线中的危险区域以进行安全的自主导航,使用识别受限区域的排斥功能来构成网格图,并根据级别来考虑危险排斥力构成:S *算法读取区域的整个地图(S1),并从该地图组成一个栅格地图(S2)。基于区域关闭特征,将具有碰撞危险的区域定义为危险区域(S3)。将频繁发生事故或拥堵的区域定义为紧急区域,并将该定义反映到网格图(S4)。当给出起点和终点时(S5),将与该起点节点相邻的节点添加到记录未探索节点的开放列表中(S6)。基于安全成本评估功能,在与当前节点相邻的节点之中,选择具有最小安全成本的节点,并且识别最安全的节点(S7)。将完成搜索的节点添加到封闭列表中,在该列表中已记录已探索的节点,以便不再搜索这些节点(S8)。; COPYRIGHT KIPO 2013

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号