检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:齐彤华 周小平 王佳 QI Tong-hua;ZHOU Xiao-ping;WANG Jia(School of Electrical&Information Engineering,Beijing University of Civil Engineering and Architecture,Beijing 100044,China)
机构地区:[1]北京建筑大学电气与信息工程学院,北京100044
出 处:《消防科学与技术》2022年第3期347-351,共5页Fire Science and Technology
摘 要:对消防疏散路径规划问题的研究通常是仅考虑路径最短这一条件,较少考虑多约束条件对路径查询的影响,给消防疏散带来了一定的局限性。本文将基于多种约束条件,即融合距离约束、消防设施数量约束、危险区域数量约束,进行室内消防路径查询方法研究。通过BIM技术对室内混合路网数据以及消防信息进行提取,搭建出消防综合路网数据;再通过设计函数,调节函数系数,确定多约束条件下的消防综合路网,然后调用Dijkstra算法生成满足多约束条件下的K条路径,为消防疏散提供更多人性化、个性化的路径选择;最后通过实验以及三维展示,验证了本方法的可行性与实用性。In current studies, scholars usually only consider a single constraint condition of shortest path in the research of fire path planning, and do not consider the impact of multiple constraints on path query, which brings some limitations to the evacuation. This paper will study the indoor fire path query method based on a variety of constraints, that is, integrating distance constraints, number constraints of fire-fighting facilities and number constraints of dangerous areas. Extract the data and fire information in the indoor mixed road network through BIM technology, and build the comprehensive fire road network data;then through the design function, adjust the coefficients in the function, determine the fire comprehensive road network under the specific multiple constraints, and then call the Dijkstra algorithm to generate K paths satisfying multiple constraints,and provide more path selection for evacuation, so that the fire path is more humane and personalized. Finally, the feasibility and practicability of the proposed method are verified by experiments and three-dimensional display.
分 类 号:X932[环境科学与工程—安全科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.140.23