CN114153936B - BIM-based fire route query method, device, equipment and medium - Google Patents
BIM-based fire route query method, device, equipment and medium Download PDFInfo
- Publication number
- CN114153936B CN114153936B CN202210119683.7A CN202210119683A CN114153936B CN 114153936 B CN114153936 B CN 114153936B CN 202210119683 A CN202210119683 A CN 202210119683A CN 114153936 B CN114153936 B CN 114153936B
- Authority
- CN
- China
- Prior art keywords
- fire fighting
- route
- target building
- topological
- road network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004590 computer program Methods 0.000 claims description 13
- 230000015654 memory Effects 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 9
- 239000011159 matrix material Substances 0.000 description 9
- 239000000243 solution Substances 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013499 data model Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000009792 diffusion process Methods 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 231100001261 hazardous Toxicity 0.000 description 2
- 206010000369 Accident Diseases 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 239000012895 dilution Substances 0.000 description 1
- 238000010790 dilution Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000000779 smoke Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Alarm Systems (AREA)
Abstract
The application provides a method, a device, equipment and a medium for inquiring a fire fighting route based on BIM, wherein the method comprises the following steps: acquiring a safety query condition, a starting point position and an end point position in a target building, and fire fighting topology road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building; determining candidate fire fighting routes meeting the safety query conditions according to the safety query conditions, the topological road network data and the fire fighting information data of the target building; determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building; and determining a target fire fighting route meeting the safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route.
Description
Technical Field
The application relates to the field of data analysis, in particular to a method, a device, equipment and a medium for inquiring a fire fighting route based on BIM.
Background
Along with the building inner structure is more complicated, the function is more various, the building size is huge gradually for all kinds of fire accident danger degree constantly strengthens, has increased more the degree of difficulty for fleeing for one's life and rescue work.
At present, when a building is in a fire, a shortest route from a rescue destination is usually selected as a rescue route in the building in consideration of rescue efficiency.
Disclosure of Invention
In view of the above, an object of the present application is to provide a method, an apparatus, a device and a medium for querying a fire fighting route based on BIM, which are used to solve the problem of low safety of the fire fighting route determined in a building with a fire in the prior art.
In a first aspect, an embodiment of the present application provides a method for querying a fire route based on BIM, including:
acquiring a safety query condition, a starting point position and an end point position in a target building, and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
determining candidate fire fighting routes meeting the safety query conditions according to safety query conditions, the topological road network data and the fire fighting information data of the target building;
determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building;
and determining a target fire fighting route meeting the safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route.
Optionally, the topological road network data of the target building is determined by the following steps:
acquiring geometric information of the target building from a building model data document of the target building;
determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
aiming at the plane grid map of each floor, determining the hierarchical topology road network data of the floor according to the passable area grid;
and combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
Optionally, the fire information data of the target building is determined by the following steps:
obtaining semantic information of the target building from a building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
and associating the fire fighting facilities, the dangerous area and each topological path in the fire fighting topological road network data according to the first position information of the fire fighting facilities, the second position information of the dangerous area and the position information of each topological path in the topological road network data in the target building to obtain the fire fighting information data of the target building.
Optionally, determining, according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route, a target fire fighting route meeting a safety query condition in at least one candidate fire fighting route, including:
for each candidate fire fighting route, determining the degree of conformity of the candidate fire fighting route with the safety query condition according to the route distance of the topological route forming the candidate fire fighting route, the first number of the fire fighting facilities on each topological route and the second number of the dangerous areas;
and determining one candidate fire fighting route with the conformity degree meeting the preset conditions as a target fire fighting route meeting the safety query conditions.
Optionally, for each topological path, determining a candidate fire fighting route topological path meeting the safety query condition according to the safety query condition, the topological road network data, and the fire fighting information data of the target building, including:
determining a density coefficient set according to the safety query condition; the density coefficient set comprises at least one density coefficient group, and the density coefficient group comprises a first density coefficient and a second density coefficient;
and for each density coefficient group, determining candidate fire fighting routes which are corresponding to the density coefficient group and meet the safety query condition according to the path distance of each topological path in the topological road network data, the total number of the fire fighting facilities in the target building, the total number of the dangerous areas, the first density coefficient and the second density coefficient.
In a second aspect, an embodiment of the present application provides a BIM-based device for querying a fire route, including:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a safety query condition, a starting point position and an end point position in a target building and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
the first determining module is used for determining candidate fire fighting routes meeting the safety query condition according to the safety query condition, the topological road network data and the fire fighting information data of the target building;
the second determining module is used for determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building;
and the third determining module is used for determining a target fire fighting route meeting the safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route.
Optionally, the apparatus further comprises:
the second acquisition module is used for acquiring the geometric information of the target building from the building model data document of the target building;
the grid module is used for determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
the topology module is used for determining the hierarchical topology road network data of each floor according to the passable area grid aiming at the plane grid map of each floor;
and the first combination module is used for combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
Optionally, the apparatus further comprises:
the third acquisition module is used for acquiring semantic information of the target building from the building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
and the association module is used for associating the fire fighting equipment, the dangerous area and each topological path in the fire fighting topological road network data according to the first position information of the fire fighting equipment, the second position information of the dangerous area and the position information of each topological path in the fire fighting topological road network data in the target building to obtain the fire fighting information data of the target building.
In a third aspect, an embodiment of the present application provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor implements the steps of the above method when executing the computer program.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, performs the steps of the above method.
The method for inquiring the fire fighting route comprises the steps of firstly, obtaining a safety inquiry condition, a starting point position and an end point position in a target building and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building; secondly, determining candidate fire fighting routes according with the safety query conditions according to the safety query conditions, the topological road network data and the fire fighting information data of the target building; thirdly, determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building; and finally, according to the path distance of each candidate fire fighting route and fire fighting information data on each candidate fire fighting route, determining a target fire fighting route meeting a safety query condition in at least one candidate fire fighting route.
In some embodiments, according to the topological paths corresponding to the starting position and the ending position and the fire information data associated with the topological paths, when a target fire fighting route is queried, the fire fighting information on the paths needs to be considered in addition to the distance between the starting position and the ending position, so that the target fire fighting route meeting the safety query condition can be determined more accurately, and the safety of rescuers and personnel to be rescued is improved.
In order to make the aforementioned objects, features and advantages of the present application comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a schematic flowchart of a method for querying a fire route based on BIM according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a first topological road network provided in an embodiment of the present application;
fig. 3 is a schematic diagram of a second topological network provided in the embodiment of the present application;
FIG. 4 is a schematic diagram of querying fire routes in a model provided by an embodiment of the present application;
FIG. 5 is a schematic view of a first grid plan map provided in an embodiment of the present application;
FIG. 6 is a schematic view of a second land grid map provided in accordance with an embodiment of the present invention;
FIG. 7 is a schematic structural diagram of a BIM-based fire route query device according to an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
At present, more researches on fire fighting routes of buildings are based on a single road network, the requirements of providing faster, more accurate and higher-safety fire fighting routes under emergency conditions cannot be met, and the life and property safety of people cannot be well guaranteed.
Based on the above defects, the present application provides a BIM-based fire route query method, as shown in fig. 1, the method includes the following steps:
s101, acquiring a safety query condition, a starting point position and an end point position in a target building, and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
s102, determining candidate fire fighting routes according with safety query conditions according to the safety query conditions, the topological road network data and the fire fighting information data of the target building;
s103, determining fire fighting information data on each candidate fire fighting route according to the candidate fire fighting routes and the fire fighting information data of the target building;
s104, determining a target fire fighting route meeting the safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route.
In the above step S101, the safety inquiry condition is artificially defined, but the safety inquiry condition is mainly to determine a fire protection route in which the personnel in the building can safely and rapidly move when the target building is in fire, and therefore, the safety inquiry condition may include: shortest rescue route, fire rescue route and safe escape route. Wherein the shortest rescue route is the shortest route from the starting point position to the end point position in the target building. The fire rescue route is a route from a starting position to an end position in a target building, which is convenient for a fireman to rescue, in which the safety of the fireman needs to be ensured as much as possible and the rescue efficiency needs to be improved, so that enough fire-fighting facilities need to be in the route and the length of the route needs to be as short as possible. The safe escape route is a route from a starting position to a destination position in a target building for facilitating escape of trapped persons, and in this route, danger of the trapped persons needs to be reduced as much as possible, so this route needs to avoid a dangerous area in the target building as much as possible, and the route length needs to be as short as possible. At present, buildings in Building engineering are basically built based on an Industry Foundation class data model standard (IFC), and the built buildings carry Building Information Modeling (BIM) data (hereinafter, Building Information model data is referred to as BIM data). The BIM data comprises fire fighting topological road network data of the target building, and the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building. BIM data conforms to the standards of the industrial basic class data model. The topology network data of the target building is data corresponding to a route structure diagram composed of all passable areas in the target building, wherein the route structure diagram corresponding to the topology network data includes a plurality of nodes and a plurality of topology paths, wherein a node is a point in a passable area and can be an intersection point between the topology paths, different nodes are connected by different topology paths, as shown in fig. 2, the topology network corresponding to a part of the route structure diagram includes 1-8 nodes, and different nodes are connected by topology paths with different lengths. The fire protection information data of the target building is the incidence relation between all fire protection facilities and all danger areas in the target building and each topological path in the topological road network data.
In step S102, the requirements of the fire fighting equipment and/or the dangerous area in the queried fire fighting route are different according to different safety query conditions, and the specific difference is that the density of the fire fighting equipment and/or the dangerous area in the fire fighting route may be different, so that a plurality of density coefficients (the range of the density coefficients may be 0-100, and the step length value between different density coefficients is 0.1) are preset for the fire fighting equipment and/or the dangerous area in the present scheme, where the fire fighting equipment corresponds to the first density coefficient and the dangerous area corresponds to the second density coefficient. When the safety query condition is the shortest rescue route, the density of the fire-fighting facilities and the density of the dangerous area do not need to be considered for the searched rescue route, and therefore the first density coefficient and the second density coefficient can be set to be 0. When the safety query condition is a fire rescue route, as many fire-fighting facilities as possible need to be provided on the route, so that the first density coefficient takes a value according to the preset density coefficient, and the second density coefficient of the dangerous area is set to be 0. When the safety query condition is a safety escape route, as many fire-fighting facilities as possible need to be provided on the route and as many dangerous areas as possible need to be avoided, so that the first density coefficient and the second density coefficient both need to be valued according to preset density coefficients. According to the first density coefficient and the second density coefficient after the value is taken, different combinations between the first density coefficient and the second density coefficient are utilized, new topological road network data and fire information data of a target building are reconstructed by utilizing each group of the first density coefficient and the second density coefficient, and candidate fire fighting routes corresponding to each group of the first density coefficient and the second density coefficient are determined, wherein the candidate fire fighting routes are shortest routes from a starting point position to an end point position in the new topological road network data corresponding to the group of the first density coefficient and the second density coefficient.
In step S103, fire fighting information data on each candidate fire fighting route is determined according to the association relationship between each fire fighting device and each topological path in the fire fighting information data and the association relationship between each danger area and each topological path. As shown in fig. 3, a partial route structure diagram includes 1 to 8 nodes, different nodes are connected by topology paths with different lengths, and each topology path is associated with a corresponding fire protection facility and a dangerous area, for example, between node 1 and node 2, the path distance of the topology path is 7.5, the number of fire protection facilities is 2, and the number of dangerous areas is 0.
In step S104, fire fighting information data, that is, the number of fire fighting facilities and the number of dangerous areas, and a corresponding path distance are associated with each topological path of each candidate fire fighting route, so as to calculate a target fire fighting route meeting the query condition.
Specifically, the method for determining the target fire fighting route comprises the following steps:
step 1041, for each candidate fire fighting route, determining a degree of conformity of the candidate fire fighting route with the safety query condition according to a route distance of a topological route constituting the candidate fire fighting route, and the first number of the fire fighting equipment and the second number of the dangerous areas on each topological route;
and 1042, determining the candidate fire fighting route with the conformity degree meeting the preset conditions as a target fire fighting route meeting the safety query conditions.
In the above step 1041 and step 1042, for each candidate fire fighting route, according to the path distance of each topological path in the candidate fire fighting routes, and the first number of the fire fighting equipment and the second number of the dangerous area on each topological path, a value may be calculated, and this value may represent the degree of compliance of the candidate fire fighting routes with the safety query condition. And then the target fire fighting route which best meets the safety query condition can be determined according to the meeting degree. The greater the value of the degree of compliance, the closer the density of fire fighting equipment and/or dangerous areas in the fire fighting route is to the safety inquiry conditions.
Specifically, in the scheme, when the query condition is the shortest rescue route, only one candidate fire fighting route is provided, so that the candidate fire fighting route is determined as the target fire fighting route.
When the query condition is the fire rescue route, the scheme calculates the conforming degree of the candidate fire fighting route by using the following formula for each candidate fire fighting route.
Wherein,
in order to be a function of the probability density,
the degree of compliance of the candidate fire routes is characterized,
representing unweighted original topological distances in the candidate fire routes,
representing the number of flammable and combustible and hazardous areas in the candidate fire route,
representing the number of fire-fighting equipment in the candidate fire route.
As the fire-fighting rescue route needs to contain fire-fighting facilities as much as possible, the density of the fire-fighting facilities in the fire-fighting rescue route needs to be higher, and therefore, the fire-fighting rescue route can be used in the fire-fighting rescue route
The first density coefficient is calculated when the maximum value is taken, so the second density coefficient corresponding to the dangerous area can be set to 0. And after the coincidence degree of each candidate fire fighting route is calculated, determining the candidate fire fighting route corresponding to the maximum coincidence degree as the target fire fighting route.
When the query condition is the safe escape route, the scheme calculates the conforming degree of each candidate fire fighting route by using the following formula.
Wherein,
in order to be a function of the probability density,
the degree of compliance of the candidate fire routes is characterized,
representing unweighted original topological distances in the candidate fire routes,
representing the number of flammable and combustible and hazardous areas in the candidate fire route,
representing the number of fire-fighting equipment in the candidate fire route, and N representing the degree of danger of the dangerous area in the candidate fire route.
For example, the risk level can be expressed by smoke concentration, which is divided into three levels, i.e., 5% -10% OBS/M, 10% -15% OBS/M, and 15% -20% OBS/M, and the corresponding N values are 1, 2, and 3, respectively.
Because the safe escape route needs to contain fire-fighting facilities as much as possible and avoid dangerous areas as much as possible, the safe escape route is an area with more fire-fighting facilities and fewer dangerous areas. Therefore, after the coincidence degree of each candidate fire fighting route is calculated, the candidate fire fighting route corresponding to the maximum value of the coincidence degree is determined as the target fire fighting route.
In the present scheme, the candidate fire fighting routes are determined through the following steps, that is, step S102 includes:
step 10411, determining a density coefficient set according to the safety query condition; the density coefficient set comprises at least one density coefficient group, and the density coefficient group comprises a first density coefficient and a second density coefficient;
step 10412, for each density coefficient group, determining a candidate fire fighting route meeting the safety query condition corresponding to the density coefficient group according to the path distance of each topological path in the topological road network data, the total number of the fire fighting facilities in the target building, the total number of the dangerous area, the first density coefficient and the second density coefficient.
In the above step 10411, according to the safety query condition and the preset density coefficient range, a value corresponding to the first density coefficient and a value corresponding to the second density coefficient are determined, and different first density coefficients and second density dilutions are combined to obtain a density coefficient set corresponding to the safety query condition, where the density coefficient set includes at least one density coefficient group, and the density coefficient group includes the first density coefficient and the second density coefficient.
And calculating the new path distance of each topological path in the new topological road network by using the following formula for each set of the first density coefficient and the second density coefficient.
Wherein,
a new path distance representing a topological path in the new topological road network,
the original path distance of the topological path in the original topological road network is represented,
representing the total number of flammable and explosive and dangerous areas contained in the original topological road network,
representing the total number of fire protection facilities contained in the original topological road network,
is a first density coefficient and
for the second density factor, r and m are both adjustable factors.
The method for inquiring the fire fighting route can accurately determine the target fire fighting route in the target building, and as shown in fig. 4, the target fire fighting route inquired by the method for inquiring the fire fighting route is displayed by using a three-dimensional model of the target building, wherein the three-dimensional model is 1193.14 in floor area
Building area of 3629.42
The certain three floors of the building model. The building model has 57 fire-fighting facilities and 12 fire points, two sides of each floor are respectively provided with a fire-fighting channel, and the distribution of the fire-fighting facilities is shown in table 1. In a graphical user interfaceThe starting point and the destination point selection control determines a starting point position and a destination point position, target fire fighting routes with different safety query conditions are determined through touch control of the shortest path calculation control, path information of each target fire fighting route is displayed in a multipath information display area, and each target fire fighting route is displayed in a building model of a target building, wherein the three target fire fighting routes are different in color concentration.
TABLE 1
When the target fire fighting routes with different safety query conditions are calculated, in the first step, a first density coefficient and a second density coefficient in a formula for calculating the distance of the new topological path are adjusted.
Define one (shortest rescue route), coefficient for demand
Coefficient of
Therefore, a new topological road network under the current constraint condition is established; define two (fire rescue routes) for demand, from
Coefficient of formation
Coefficient of
Therefore, a new topological road network under the condition of multiple constraints is established; for the requirement, three (safe escape routes) are defined by
Coefficient of derivation
Coefficient of
Therefore, a new topological road network under multiple constraint conditions is established.
The second step is that:
and the coordinates of the starting point and the ending point of the experiment connect the randomly selected starting point and ending point to the nearest topological point through a grid map by a diffusion principle. Therefore, the starting point of the experiment is connected to the topology node with the Key of "K038 b966746349ab9ad9a77592b3e9 a", and the end point is connected to the topology node with the Key of "w 2a9432130314bb790ef7a7258659a4 b".
The third step: three indoor fire fighting routes under the multi-constraint condition defined herein are queried through Dijkstra algorithm, as shown in fig. 4: defining a first, namely, the shortest rescue route for the demand, as shown in the first color density route a in fig. 4, the length of the route is 59.23m, which is 16.07m shorter than the fire rescue route, and 23.89m shorter than the safe escape route, so as to provide a route reference for the user who needs to escape from the building as soon as possible; for the demand definition two, i.e., the fire rescue route, as shown in the second color concentration route B in fig. 4, the route bypasses 6 more dangerous areas and passes 20 more fire fighting equipments compared to the route with only the shortest distance, and the route length is increased by 16.07m, while as can be seen from table 2, the average number of fire fighting equipments is increased by 25% and the average number of dangerous areas is decreased by 11%. Therefore, the route achieves the effect that the route is as short as possible and passes through as many fire-fighting facilities as possible, a safer fire-fighting route can be provided for fire fighters, and the difficulty of the fire fighters in carrying out fire-fighting and rescue work is reduced; for the requirement definition of three, i.e., the safe escape route, as shown in the third color concentration route C in fig. 4, the route passes through 12 more fire fighting facilities but the route length is only 23.89m more and bypasses 7 more dangerous areas compared to the route considering only the shortest distance, and as can be seen from table 2, the average number of fire fighting facilities is increased by 13% and the average number of dangerous areas is decreased by 13%. Therefore, the route has the advantages that the route is as short as possible and bypasses as many dangerous areas as possible, a safer route is provided for the escapers in the escape process, and the danger degree is greatly reduced. In fig. 4, the second color concentration route B partially overlaps with the first color concentration route a and the third color concentration route C, respectively.
TABLE 2
The topological road network data are determined based on geometric information of a target building, and specifically comprise the following steps:
105, acquiring geometric information of the target building from a building model data document of the target building;
step 106, determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
step 107, determining hierarchical topological road network data of each floor according to the trafficable area grid aiming at the plane grid map of each floor;
and 108, combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
In the above step 105, the geometric information of the target building includes the length, width, height, floor number, etc. of the target building.
In step 106, a world coordinate system related to the target building is constructed by using the geometric information of the target building, and the target building is discretized by using grid cells, wherein the size of the grid cells may be cells with a side length of 15 cm, when the size of the grid cells is less than 15 cm, the precision grid of the grid network is substantially consistent with the size of the grid cells equal to 15 cm, and since the larger the size of the grid cells is, the lower the diffusion efficiency is, the preferred grid cell size is 15 cm, so as to ensure the precision and the routing efficiency of the grid network herein. And acquiring a plane grid map of each floor of the target building in the world coordinate system by using the floors. The grid cells in the land grid map include a passable area grid and a non-passable area grid, where "1" is a passable area and "0" is a non-passable area, as shown in fig. 5.
In step 107, a hierarchical topological road network of passable areas is determined by using the midpoint position corresponding to the passable area in the planar grid map. As shown in fig. 6, in order to distinguish the grid cells corresponding to the hierarchical topology network from other grid cells, the present application may change the path corresponding to the hierarchical topology network from "1" to "2" of the original passable area. In order to more conveniently record the positions of the topological road network in the world coordinate system, the grid cells belonging to the topological nodes can be recorded in the following way:
(ii) a Wherein,
the grid cells of the ith row and the jth column in the planar grid map,
represents the number of each node in the topological road network,
the grid unit cells representing the ith row and the jth column belong to the m node to the nth node.
In step 108, the topological road network data of the target building is obtained by combining the hierarchical topological road network data corresponding to each floor. After the topological road network data is constructed, in order to increase the query efficiency of the topological path, the topological road network data can be stored in a symmetrical matrix form when being recorded, and the topological structure adopts a symmetrical matrix form
Order matrix
Represents and adds thereto
The factor (a number that goes to infinity) represents the position coordinates of two without topological connections. Compared with the traditional list storage mode, the storage mode reduces traversal operation, and further improves query efficiency. For example, as shown in FIG. 3, a matrix
As follows
Of (2) matrix
For example. Matrix array
Generated by node 1 to node 5:
the fire fighting equipment and the dangerous area position information recorded in the building model data document of the target building are not data associated with the topological road network data, so that in order to more accurately query the fire fighting route, the fire fighting equipment position information and the dangerous area position information need to be associated with the topological path, that is, the fire fighting information data of the target building is determined by specifically using the following steps:
step 109, obtaining semantic information of the target building from the building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
step 110, associating the fire-fighting equipment and the dangerous area with each topological path in the fire-fighting topological road network data according to the first position information of the fire-fighting equipment, the second position information of the dangerous area and the position information of each topological path in the fire-fighting topological road network data in the target building to obtain the fire-fighting information data of the target building.
In the above step 109, the building model data document of the target building may not be the directly stored first location information of the fire fighting equipment and the second location information of the dangerous area, and the type and keyword (if the type is the fire fighting equipment type, the keyword is "fire hydrant", "fire extinguisher", "fire sprinkler head", etc.), but stored with an offset matrix representing the location information. If the building model data file of the target building is stored using the offset matrix, it needs to be calculated using the following formula.
Wherein W represents a fire facility or a dangerous area, A is
Order rotation offset matrix
，
Position information of the fire-fighting facilities or the dangerous area in a world coordinate system.
In step 110, according to the first location information of the fire-fighting equipment and the second location information of the dangerous area, the topological path in the topological road network closest to the fire-fighting equipment or the dangerous area is determined, and the fire-fighting equipment or the dangerous area is associated with the topological path closest to the fire-fighting equipment or the dangerous area, so as to obtain the fire-fighting information data of the target building.
According to the method for inquiring the fire fighting route, when the target fire fighting route is inquired, the distance between the starting position and the end position and the fire fighting information on the route are considered when the target fire fighting route is inquired, the target fire fighting route which meets the safety inquiry condition can be more accurately determined by the determined target fire fighting route, and the safety degree of rescue workers and personnel to be rescued is improved.
The present application provides a device for inquiring fire route based on BIM, as shown in fig. 7, including:
a first obtaining module 701, configured to obtain a security query condition, a starting position and an ending position in a target building, and fire fighting topology road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
a first determining module 702, configured to determine, according to a safety query condition, the topological road network data, and the fire information data of the target building, a candidate fire route that meets the safety query condition;
a second determining module 703, configured to determine fire information data on each candidate fire route according to the fire information data of each candidate fire route and the target building;
a third determining module 704, configured to determine, according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route, a target fire fighting route that meets the safety query condition in at least one candidate fire fighting route.
Optionally, the apparatus further comprises:
the second acquisition module is used for acquiring the geometric information of the target building from the building model data document of the target building;
the grid module is used for determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
the topology module is used for determining the hierarchical topology road network data of each floor according to the passable area grid aiming at the plane grid map of each floor;
and the first combination module is used for combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
Optionally, the apparatus further comprises:
the third acquisition module is used for acquiring semantic information of the target building from the building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
and the association module is used for associating the fire fighting equipment, the dangerous area and each topological path in the fire fighting topological road network data according to the first position information of the fire fighting equipment, the second position information of the dangerous area and the position information of each topological path in the fire fighting topological road network data in the target building to obtain the fire fighting information data of the target building.
Optionally, the third determining module includes:
a first determination unit, configured to determine, for each candidate fire fighting route, a degree of compliance of the candidate fire fighting route with the safety query condition according to a path distance of topological paths constituting the candidate fire fighting route, and the first number of fire fighting facilities and the second number of dangerous areas on each topological path;
and the second determining unit is used for determining the candidate fire fighting route with the conformity degree meeting the preset condition as the target fire fighting route meeting the safety inquiry condition.
Optionally, the second determining module includes:
a third determining unit, configured to determine a density coefficient set according to the secure query condition; the density coefficient set comprises at least one density coefficient group, and the density coefficient group comprises a first density coefficient and a second density coefficient;
and a fourth determining unit, configured to determine, for each density coefficient group, a candidate fire fighting route corresponding to the density coefficient group and meeting the safety query condition according to the path distance of each topological path in the topological road network data, the total number of the fire fighting facilities in the target building, the total number of the dangerous areas, the first density coefficient, and the second density coefficient.
Corresponding to the method for querying a fire fighting route based on BIM in fig. 1, an embodiment of the present application further provides a computer device 800, as shown in fig. 8, the device includes a memory 801, a processor 802, and a computer program stored on the memory 801 and executable on the processor 802, wherein the processor 802 implements the method for querying a fire fighting route based on BIM when executing the computer program.
Specifically, the memory 801 and the processor 802 can be general memories and processors, which are not limited in particular, and when the processor 802 runs a computer program stored in the memory 801, the BIM-based fire route querying method can be executed, so that the problem of low safety of a fire route determined in a building in which a fire occurs in the prior art is solved.
Corresponding to the method for querying a fire fighting route based on BIM in fig. 1, the present application also provides a computer readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to perform the steps of the method for querying a fire fighting route based on BIM.
Specifically, the storage medium can be a general storage medium, such as a mobile disk, a hard disk, and the like, when a computer program on the storage medium is run, the method for querying a fire fighting route based on the BIM can be executed, and the problem of low safety of the fire fighting route determined in a building with a fire in the prior art is solved.
In the embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments provided in the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus once an item is defined in one figure, it need not be further defined and explained in subsequent figures, and moreover, the terms "first", "second", "third", etc. are used merely to distinguish one description from another and are not to be construed as indicating or implying relative importance.
Finally, it should be noted that: the above-mentioned embodiments are only specific embodiments of the present application, and are used for illustrating the technical solutions of the present application, but not limiting the same, and the scope of the present application is not limited thereto, and although the present application is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope disclosed in the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the present disclosure, which should be construed in light of the above teachings. Are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (9)
1. A BIM-based fire route query method is characterized by comprising the following steps:
acquiring a safety query condition, a starting point position and an end point position in a target building, and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
determining candidate fire fighting routes meeting the safety query conditions according to the safety query conditions, the topological road network data and the fire fighting information data of the target building;
determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building;
determining a target fire fighting route meeting a safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and fire fighting information data on each candidate fire fighting route;
determining candidate fire fighting route topological paths meeting the safety query condition according to the safety query condition, the topological road network data and the fire fighting information data of the target building, and including:
determining a density coefficient set according to the safety query condition; the density coefficient set comprises at least one density coefficient group, and the density coefficient group comprises a first density coefficient and a second density coefficient; the first density coefficient is used for representing the density of the fire fighting facilities in the fire fighting route, and the second density coefficient is used for representing the density of the dangerous area in the fire fighting route;
for each density coefficient group, determining candidate fire fighting routes which are corresponding to the density coefficient group and meet the safety query condition according to the path distance of each topological path in the topological road network data, the total number of the fire fighting facilities in the target building, the total number of the dangerous areas, a first density coefficient and a second density coefficient; the candidate fire route is the shortest route of the set of density coefficients from the start location to the end location.
2. The method of claim 1, wherein the topological road network data for the target building is determined by:
acquiring geometric information of the target building from a building model data document of the target building;
determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
aiming at the plane grid map of each floor, determining the hierarchical topology road network data of the floor according to the passable area grid;
and combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
3. The method of claim 1, wherein the fire information data for the target building is determined by:
obtaining semantic information of the target building from a building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
and associating the fire fighting facilities, the dangerous area and each topological path in the fire fighting topological road network data according to the first position information of the fire fighting facilities, the second position information of the dangerous area and the position information of each topological path in the topological road network data in the target building to obtain the fire fighting information data of the target building.
4. The method of claim 3, wherein determining a target fire protection route meeting the safety query in at least one of the candidate fire protection routes according to the path distance of each of the candidate fire protection routes and the fire protection information data on each of the candidate fire protection routes comprises:
for each candidate fire fighting route, determining the degree of conformity of the candidate fire fighting route with the safety query condition according to the route distance of the topological route forming the candidate fire fighting route, the first number of the fire fighting facilities on each topological route and the second number of the dangerous areas;
and determining one candidate fire fighting route with the coincidence degree meeting a preset condition as a target fire fighting route meeting a safety query condition.
5. A BIM-based fire route query device, comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a safety query condition, a starting point position and an end point position in a target building and fire fighting topological road network data of the target building; the fire fighting topological road network data comprises topological road network data of the target building and fire fighting information data of the target building;
the first determining module is used for determining candidate fire fighting routes meeting the safety query condition according to the safety query condition, the topological road network data and the fire fighting information data of the target building;
the second determining module is used for determining fire fighting information data on each candidate fire fighting route according to the fire fighting information data of each candidate fire fighting route and the target building;
the third determining module is used for determining a target fire fighting route meeting the safety query condition in at least one candidate fire fighting route according to the path distance of each candidate fire fighting route and the fire fighting information data on each candidate fire fighting route;
the second determining module includes:
a third determining unit, configured to determine a density coefficient set according to the secure query condition; the density coefficient set comprises at least one density coefficient group, and the density coefficient group comprises a first density coefficient and a second density coefficient;
and a fourth determining unit, configured to determine, for each density coefficient group, a candidate fire fighting route corresponding to the density coefficient group and meeting the safety query condition according to the path distance of each topological path in the topological road network data, the total number of the fire fighting facilities in the target building, the total number of dangerous areas, the first density coefficient, and the second density coefficient.
6. The apparatus of claim 5, further comprising:
the second acquisition module is used for acquiring the geometric information of the target building from the building model data document of the target building;
the grid module is used for determining a plane grid map of each floor of the target building according to the geometric information; the plane grid map comprises a passable area grid and a non-passable area grid;
the topology module is used for determining the hierarchical topology road network data of each floor according to the passable area grid aiming at the plane grid map of each floor;
and the first combination module is used for combining the hierarchical topological road network data of each floor into the topological road network data of the target building.
7. The apparatus of claim 5, further comprising:
the third acquisition module is used for acquiring semantic information of the target building from the building model data document of the target building; the semantic information comprises first position information of the fire-fighting equipment and second position information of a dangerous area;
and the association module is used for associating the fire fighting equipment, the dangerous area and each topological path in the fire fighting topological road network data according to the first position information of the fire fighting equipment, the second position information of the dangerous area and the position information of each topological path in the fire fighting topological road network data in the target building to obtain the fire fighting information data of the target building.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any of the preceding claims 1-4 when executing the computer program.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, is adapted to carry out the steps of the method of any one of the preceding claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210119683.7A CN114153936B (en) | 2022-02-09 | 2022-02-09 | BIM-based fire route query method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210119683.7A CN114153936B (en) | 2022-02-09 | 2022-02-09 | BIM-based fire route query method, device, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114153936A CN114153936A (en) | 2022-03-08 |
| CN114153936B true CN114153936B (en) | 2022-05-03 |
Family
ID=80450279
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210119683.7A Active CN114153936B (en) | 2022-02-09 | 2022-02-09 | BIM-based fire route query method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114153936B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116775930B (en) * | 2023-06-14 | 2024-03-08 | 广州图石科技有限公司 | BIM+GIS-based data combination and visual display method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106975191A (en) * | 2017-04-18 | 2017-07-25 | 江苏省冶金设计院有限公司 | A kind of fire-fighting system and its rescue mode |
| CN107708062A (en) * | 2017-10-31 | 2018-02-16 | 济南浪潮高新科技投资发展有限公司 | A kind of fire evacuation system and method based on indoor positioning |
| CN111982113A (en) * | 2020-07-22 | 2020-11-24 | 湖南大学 | Path generation method, device, equipment and storage medium |
| CN112488401A (en) * | 2020-12-08 | 2021-03-12 | 武汉理工光科股份有限公司 | Fire escape route guiding method and system |
| CN112581714A (en) * | 2020-11-18 | 2021-03-30 | 关酢壬 | Fire timely alarm system based on transmission of Internet of things |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8538687B2 (en) * | 2010-05-04 | 2013-09-17 | Honeywell International Inc. | System for guidance and navigation in a building |
| CN111832811A (en) * | 2020-06-24 | 2020-10-27 | 北京工业大学 | Intelligent fire-fighting evacuation method based on digital twins |
| CN117741679A (en) * | 2020-08-28 | 2024-03-22 | 上海禾赛科技有限公司 | Laser radar and ranging method |
-
2022
- 2022-02-09 CN CN202210119683.7A patent/CN114153936B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106975191A (en) * | 2017-04-18 | 2017-07-25 | 江苏省冶金设计院有限公司 | A kind of fire-fighting system and its rescue mode |
| CN107708062A (en) * | 2017-10-31 | 2018-02-16 | 济南浪潮高新科技投资发展有限公司 | A kind of fire evacuation system and method based on indoor positioning |
| CN111982113A (en) * | 2020-07-22 | 2020-11-24 | 湖南大学 | Path generation method, device, equipment and storage medium |
| CN112581714A (en) * | 2020-11-18 | 2021-03-30 | 关酢壬 | Fire timely alarm system based on transmission of Internet of things |
| CN112488401A (en) * | 2020-12-08 | 2021-03-12 | 武汉理工光科股份有限公司 | Fire escape route guiding method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114153936A (en) | 2022-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mirahadi et al. | EvacuSafe: A real-time model for building evacuation based on Dijkstra's algorithm | |
| US8538687B2 (en) | System for guidance and navigation in a building | |
| Wu et al. | 3D spatial information for fire-fighting search and rescue route analysis within buildings | |
| KR102375246B1 (en) | intelligent evacuation guidance simulation system for disaster situation | |
| Li et al. | A household-level approach to staging wildfire evacuation warnings using trigger modeling | |
| CN112254733B (en) | Fire escape path planning method and system based on extended A-x algorithm | |
| CN114153936B (en) | BIM-based fire route query method, device, equipment and medium | |
| Rüppel et al. | BIM-based immersive indoor graph networks for emergency situations in buildings | |
| Liu et al. | Towards a 3D network model for indoor navigation | |
| Li et al. | Using reverse geocoding to identify prominent wildfire evacuation trigger points | |
| CN116957484A (en) | Fire rescue plan method and system based on digital twinning | |
| Mitchell et al. | Integrating wildfire spread and evacuation times to design safe triggers: Application to two rural communities using PERIL model | |
| Boguslawski et al. | 3D building interior modelling for navigation in emergency response applications | |
| Li et al. | Evacuation-path-selection model of real-time fire diffusion in urban underground complexes | |
| CN116363825B (en) | Method and device for displaying fire spreading trend, electronic equipment and medium | |
| Liu et al. | Dynamic route decision model-based multi-agent evacuation simulation-case study of Nagata Ward, Kobe | |
| Mayasari et al. | Mathematical modeling approach of an evacuation model for tsunami risk reduction in bengkulu | |
| CN114743333A (en) | Intelligent building fire safety control system | |
| Wang et al. | Integrating sensing and routing for indoor evacuation | |
| Liu et al. | Real-time evacuation route optimization in the fire scenarios of cruise ships | |
| Cao et al. | Indoor fire emergency evacuation path planning based on improved NavMesh algorithm | |
| Liu et al. | Dynamic Evacuation Routes Navigation for Passenger Ship Fire Based on Intelligence Algorithms | |
| Wang | Bidirectional ACO intelligent fire evacuation route optimization | |
| Li | Modeling wildfire evacuation as a coupled human-environmental system using triggers | |
| CN116386163B (en) | Method and system for patrol management, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231102 Address after: Building 5, Niujiahou River, 100 meters east of Bijia Village, Beizhai Street, Laoshan District, Qingdao City, Shandong Province, 266000 Patentee after: Qingdao Saab Weitong Technology Co.,Ltd. Address before: 100000 room 1008, 10th floor, building 16, yard 30, Shixing street, Shijingshan District, Beijing Patentee before: BIM WINNER (BEIJING) TECHNOLOGY CO.,LTD. Patentee before: BIM WINNER (SHANGHAI) TECHNOLOGY Co.,Ltd. Patentee before: SHENZHEN BIM WINNER TECHNOLOGY Co.,Ltd. Patentee before: Yingjia Internet (Beijing) Smart Technology Co.,Ltd. Patentee before: Foshan Yingjia Smart Space Technology Co.,Ltd. Patentee before: SHENZHEN QIANHAI YINGJIA DATA SERVICE Co.,Ltd. Patentee before: JIAXING WUZHEN YINGJIA QIANZHEN TECHNOLOGY Co.,Ltd. Patentee before: Shandong Jiaying Internet Technology Co.,Ltd. |