面向多约束的室内消防路径查询方法研究

对消防疏散路径规划问题的研究通常是仅考虑路径最短这一条件，较少考虑多约束条件对路径查询的影响，给消防疏散带来了一定的局限性。本文将基于多种约束条件，即融合距离约束、消防设施数量约束、危险区域数量约束，进行室内消防路径查询方法研究。通过BIM技术对室内混合路网数据以及消防信息进行提取，搭建出消防综合路网数据；再通过设计函数，调节函数系数，确定多约束条件下的消防综合路网，然后调用Dijkstra算法生成满足多约束条件下的K条路径，为消防疏散提供更多人性化、个性化的路径选择；最后通过实验以及三维展示，验证了本方法的可行性与实用性。

Research on indoor fire path query method for multiple constraints

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.