摘要
已有的火灾浓烟雾空间多人员疏散方法可得到较优逃生路径,但是无法适用于不同障碍物环境。为此提出基于最优路径规划的火灾浓烟雾空间多目标人员疏散方法。利用网格法将浓雾空间划分为多个区域,通过目标的行走、跳跃、爬行速度以及人员在网格中的占比,计算疏散时所需的最小密度。模拟密闭空间的分布情况,拟定三种不同障碍物环境下最优规划疏散路径,计算障碍物体与空间边界线之间形成的最大夹角,建立方程组求解,给出目标点间的最优线段。根据人均最低移动速度,根据密闭空间面积计算最低耗用时间,将人员密度、时间结合代入到疏散最优路径公式中,求解得出最优疏散方案。仿真结果证明,所提方法实用性及可靠性较强,耗用时间和疏散路程均较短,实验结果显示所提方法整体性能优异。
Traditionally, some evacuation methods can get a good escape path in fire space, but they are unable to be applied to different obstacle environments. Therefore, a method of multiple target evacuation in dense smoke space based on optimal path planning was proposed. This paper used the grid method to divide the dense smoke space into several areas, and calculated the minimum density required for evacuation by the walking, jumping, and crawling speed of the target and the proportion of people in the grid. Then, our method simulated the distribution of confined space and designed the optimal evacuation paths in three obstacle environments. After calculating the maximum intersection angle between obstacles and space boundaries, we established equations to solve it, and thus to give the optimal line segment between target points. According to the per capita minimum movement speed and the area of confined space, we could get the minimum time consumption. Finally, personnel density and time were substituted into the optimal evacuation path formula to obtain the optimal evacuation scheme. Simulation results show that the proposed method has strong practicability and reliability, and requires less time and shorter evacuation distance. In addition, the overall performance of the method is excellent.
作者
刘显成
朱国庆
LIU Xian-cheng;ZHU Guo-qing(School of Urban Construction,Yangtze University,Jingzhou Hubei 434023,China)
出处
《计算机仿真》
北大核心
2022年第10期457-461,共5页
Computer Simulation
基金
湖北高校省级教学研究项目(2017280)。
关键词
疏散效率
最优路径规划
网格划分法
人员最小密度
耗用时间
Evacuation efficiency
Optimal path planning
Grid division method
Minimum personnel density
Time consumption
