检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李晟延 马鸿雁 窦嘉铭 叶永雪 LI Sheng-yan;MA Hong-yan;DOU Jia-ming;YE Yong-xue(School of Electrical and Information Engineering,Beijing University of Civil Engineering and Architecture,Beijing 100044,China;Beijing Key Laboratory of Intelligent Processing for Building Big Data,Beijing 100044,China;National Virtual Simulation Experimental Center for Smart City Education,Beijing 100044,China)
机构地区:[1]北京建筑大学电气与信息工程学院,北京100044 [2]建筑大数据智能处理方法研究北京市重点实验室,北京100044 [3]智慧城市国家级虚拟仿真实验教学中心,北京100044
出 处:《消防科学与技术》2022年第8期1066-1072,共7页Fire Science and Technology
基 金:北京建筑大学博士基金项目(ZF15054)。
摘 要:为解决建筑内人员疏散模拟时间长、效率低、无法根据火灾情况改变疏散方向的问题,提出一种新型的混合路径规划算法。首先,在A*算法中加入奖惩机制并对启发函数进行改进。其次,通过改进斥力函数解决人工势场算法易陷入局部极小值的问题。最后,将两种算法组合,构成一种混合路径规划算法。通过对某教学建筑应用BIM和PyroSim软件进行建模与分析,验证混合路径规划算法的可行性。结果表明,所提算法不仅能够快速找到最优疏散路径,还可以避免疏散路径经过危险区域。与单一算法相比,混合路径规划算法遍历节点个数更少,路径平滑性与路径规划效果更好,路径规划效率更高。A novel hybrid path planning algorithm is proposed to solve the problems of long simulation time and low efficiency of evacuation of people in buildings, and the inability to change the evacuation direction according to the fire situation.First, a reward and punishment mechanism is added to the A*algorithm and the heuristic function is improved. Secondly, the problem that the artificial potential field algorithm is easy to fall into local minima is solved by improving the repulsion function. Finally, the two algorithms are combined to form a hybrid path planning algorithm. The feasibility of the hybrid path planning algorithm is verified by modeling and analyzing an educational building with BIM and PyroSim software. The results show that the proposed algorithm can not only find the optimal evacuation path quickly, but also avoid the evacuation path to pass through the dangerous area. Compared with a single algorithm, the hybrid path planning algorithm has fewer traversing nodes, better path smoothness and path planning effect, and higher path planning efficiency.
关 键 词:路径规划 混合路径规划算法 A*算法 人工势场算法
分 类 号:X913.4[环境科学与工程—安全科学] TU972.4[建筑科学—建筑设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28