首页> 外国专利> OPTIMAL PATH ALGORITHM FOR PEDESTRIAN IN THE COMPLEX BUILDING

OPTIMAL PATH ALGORITHM FOR PEDESTRIAN IN THE COMPLEX BUILDING

机译:复杂建筑中行人的最优路径算法

摘要

An algorithm for selecting an optimal pedestrian route in a future complex building is provided to select an optimal route to a destination place of the pedestrian in the complex building by reflecting human factors influenced on the route of the destination after parking a vehicle at an underground parking lot. A horizontal moving cost is calculated by using a multi-extra algorithm. A vertical moving cost is calculated by using a vertical pedestrian moving cost evaluation function. A pedestrian passing cost is calculated by adding the horizontal and vertical moving cost through the multi-extra algorithm. The optimal pedestrian route is presented based on the calculated pedestrian passing cost. The vertical pedestrian moving cost evaluation function calculates the vertical moving const by converting preference and a moving time considering fatigue, pleasantness, and a waiting time felt when a moving tool is used into a distance cost.
机译:提供一种用于在未来的复杂建筑物中选择最佳人行路线的算法,以通过在地下停车场停车后反映反映到目的地路线的人为因素来选择到复杂建筑物中行人目的地的最佳路线。很多。水平移动成本是通过使用多重算法来计算的。通过使用垂直行人移动成本评估功能来计算垂直行进成本。行人通行成本是通过多重算法将水平和垂直移动成本相加得出的。根据计算出的行人通行成本,提出最佳行人路线。垂直行人移动成本评估功能通过将考虑了疲劳,愉悦和使用移动工具时感觉到的等待时间的偏好和移动时间转换为距离成本来计算垂直移动常量。

著录项

  • 公开/公告号KR100798658B1

    专利类型

  • 公开/公告日2008-01-28

    原文格式PDF

  • 申请/专利权人 GEOMATICS KOREA;

    申请/专利号KR20070038773

  • 发明设计人 YANG SEUNG TAE;

    申请日2007-04-20

  • 分类号G06F19;

  • 国家 KR

  • 入库时间 2022-08-21 19:52:37

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号