CN113255110A - Automatic generation method, system, equipment and medium for elevator emergency rescue path - Google Patents
Automatic generation method, system, equipment and medium for elevator emergency rescue path Download PDFInfo
- Publication number
- CN113255110A CN113255110A CN202110488304.7A CN202110488304A CN113255110A CN 113255110 A CN113255110 A CN 113255110A CN 202110488304 A CN202110488304 A CN 202110488304A CN 113255110 A CN113255110 A CN 113255110A
- Authority
- CN
- China
- Prior art keywords
- path
- starting point
- grid
- stair
- emergency rescue
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B5/00—Applications of checking, fault-correcting, or safety devices in elevators
- B66B5/0006—Monitoring devices or performance analysers
- B66B5/0018—Devices monitoring the operating condition of the elevator system
- B66B5/0031—Devices monitoring the operating condition of the elevator system for safety reasons
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B5/00—Applications of checking, fault-correcting, or safety devices in elevators
- B66B5/02—Applications of checking, fault-correcting, or safety devices in elevators responsive to abnormal operating conditions
-
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Geometry (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Software Systems (AREA)
- Development Economics (AREA)
- Evolutionary Computation (AREA)
- Game Theory and Decision Science (AREA)
- Computer Hardware Design (AREA)
- Computer Graphics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Maintenance And Inspection Apparatuses For Elevators (AREA)
Abstract
The invention discloses an automatic generation method, a system, equipment and a medium for an elevator emergency rescue path, wherein a three-dimensional building model adopted by the method is named and attribute-set for each floor slab member, stair members and barriers according to a preset rule so as to identify and distinguish required members through keyword or key attribute classification, then a crawling path and path length of each stair member are obtained through pretreatment, and gridding treatment and obstacle gridding are carried out on each floor slab member. And finally, combining the stair crawling path with the feasible shortest path of the floor plane to obtain the optimal emergency rescue path with the shortest path length. In the whole path generation process, the starting point and the end point of the rescue path only need to be set manually, the inflection points at all positions in the path do not need to be judged manually, the technical threshold is low, the automatic generation efficiency is high, the optimal rescue path can be generated quickly and automatically, and the requirement on timeliness of emergency rescue can be met well.
Description
Technical Field
The invention relates to the technical field of elevator emergency rescue, in particular to an automatic generation method, system, equipment and computer readable storage medium of an elevator emergency rescue path.
Background
With the rapid development of Chinese economy in recent years, on one hand, the quantity of elevator reserves and annual acceleration in China are kept at the first level in the world, and as the quantity of elevator reserves continuously increases, old elevators increase year by year, and people trapping of elevators and faults and safety accidents occur at times; on the other hand, in order to meet the increasing material culture requirements of people, large public places in China also show explosive growth, the integration degree is higher and higher, and in the large comprehensive public places, the number, the types and the models of the elevators are various, the elevator arrangement modes are various, and the distribution is not concentrated. These circumstances have led to new demands on elevator emergency rescue in areas and buildings.
The most basic emergency rescue system of the elevator in China at present responds to the demand of emergency rescue through a five-party intercom system arranged in the elevator, and guides the execution of the emergency rescue by combining elevator emergency rescue plans in areas and buildings. Aiming at the cities with large elevator holding capacity and outstanding elevator emergency rescue contradiction, an elevator emergency disposal service platform is established by referring to guidance opinions about the construction of a propulsion elevator emergency disposal service platform issued by a quality control bureau. By establishing an emergency disposal information system based on an emergency call telephone, establishing systems such as emergency disposal workflow and the like, and establishing a coordination mechanism with an elevator rescue team, the system realizes quick response and accurate geographical positioning of elevator emergency rescue in a large area, and makes up the defects of an elevator basic emergency rescue system in a large-capacity area to a certain extent. However, for elevator emergency rescue in large-scale comprehensive public places, the elevator emergency rescue plans in two-dimensional paper form of each using unit at present have defects in plan description and expression of complex scenes. According to the requirements of special equipment use management rules and elevator maintenance rules, emergency drilling is performed regularly for the existing elevator emergency rescue plan, the emergency drilling is usually performed in a form due to the fact that the time and the site cost are high and the resistance is large when the elevator emergency rescue plan is optimized and updated in actual combat drilling, and the formulated elevator emergency rescue plan and the actual elevator emergency rescue situation can be in large access and can also influence the efficiency of elevator emergency rescue in a long time.
Therefore, the patent CN201910934632.8 previously applied by the applicant proposes a three-dimensional elevator operation monitoring and emergency rescue system and method, the BIM model is obtained through a 3D visualization module, the obtained BIM model already contains model information and GIS information, emergency rescue for elevators based on BIM and GIS technologies is oriented to digital building organisms, and is not limited by time and space, and an elevator emergency rescue processing module generates an optimal three-dimensional emergency rescue path for each elevator in a building, so that rescuers can be guided to reach a target elevator at the highest speed for rescue maintenance, the last kilometer of elevator emergency rescue is opened, elevator emergency rescue management level is effectively improved, and the emergency rescue system of the current elevator is further perfected. However, when the optimal three-dimensional emergency rescue path is generated in the scheme, different rescue paths need to be generated by manually selecting inflection points, then the lengths of the different rescue paths are automatically calculated to screen out the optimal rescue path, the mode of manually selecting the inflection points has high technical threshold, the processing efficiency is low, the optimal path generation speed is low, and the timeliness of emergency rescue cannot be well met.
Disclosure of Invention
The invention provides an automatic generation method, system, equipment and computer readable storage medium of an elevator emergency rescue path, which are used for solving the technical problems of high technical threshold and low optimal path generation speed in the prior art that different rescue routes need to be generated by manually selecting inflection points when an emergency rescue path is generated.
According to one aspect of the invention, an automatic generation method of an elevator emergency rescue path is provided, which comprises the following steps:
step S1: importing a three-dimensional building model containing elevator equipment, wherein each floor slab member, each stair member and each barrier in the three-dimensional building model are named or set with attributes according to a preset rule;
step S2: preprocessing a three-dimensional building model, wherein the preprocessing process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
step S3: setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
step S4: automatically generating a stair climbing path from the starting point to the end point and all feasible floor plane shortest paths based on the set starting point position and the set end point position;
step S5: and combining the shortest plane path of all feasible floor slabs with the stair crawling path to obtain at least one optimal emergency rescue path.
Further, in the step S2, each grid after the gridding process at least includes the following information:
the uniqueness number of the grid, grid coordinates, information of a floor slab, surrounding grid information, grid weight, information of a minimum weight source grid, obstacle grid identification information, starting point grid identification information and ending point grid identification information.
Further, the manner of setting the start point and the end point of the elevator emergency rescue path in step S3 is as follows: appointing a line segment in the three-dimensional building model, wherein the intersection points of the starting point and the end point of the line segment and the nearest floor slab member are the starting point and the end point of the elevator emergency rescue path; or setting three-dimensional coordinates of a starting point and a terminal point in the three-dimensional building model, and projecting to the nearest floor component below according to the three-dimensional coordinates of the starting point and the terminal point, wherein the projection points are the starting point and the terminal point of the elevator emergency rescue path respectively;
and after the starting point position and the end point position of the elevator emergency rescue path are obtained, respectively marking the grids to which the starting point and the end point belong as a starting point grid and an end point grid.
Further, the process of preprocessing the crawling path and path length of each stair member from bottom to top based on the stair path algorithm comprises the following steps:
step S21: representing the three-dimensional building model in a triangular surface grid mode;
step S22: extracting all triangular surfaces of each stair component, and screening out the triangular surfaces with upward normal vectors;
step S23: identifying triangular faces adjacent to the same plane and combining the triangular faces into a whole tread;
step S24: calculating the central point of each tread, performing high-low sequencing according to the vertical coordinate of the central point to form a dot matrix, then combining collinear points to form a line segment, wherein the line segment is the crawling path of the single stair, the information contained in the line segment at least comprises coordinates of a starting point and a finishing point, the length of the line segment and the direction of the line segment, and calculating to obtain the plane path and the path length between two adjacent sections of stairs based on the coordinates of the finishing point of the previous single stair and the coordinates of the starting point of the next single stair.
Further, the step S4 is specifically:
judging whether the set starting point position and the set end point position belong to the same floor slab member, if the set starting point position and the set end point position belong to the same floor slab member, generating all feasible floor slab plane shortest paths according to a plane path algorithm, if the set starting point position and the set end point position do not belong to the same floor slab member, intercepting partial stair crawling paths intersected with the vertical plane from all stair crawling paths obtained through preprocessing according to the vertical plane formed by the height coordinates of the starting point position and the end point position, and generating all feasible floor slab plane shortest paths in the floor slab member where the starting point is located and the floor slab member where the end point is located based on the plane path algorithm.
Further, the process of automatically generating the stair climbing path from the starting point to the ending point in the step S4 specifically includes the following steps:
and extracting corresponding crawling paths of a plurality of single-section stairs and plane paths of stairwells according to the intercepted partial stair crawling paths, and accumulating the crawling paths of the plurality of single-section stairs and the plane paths of the stairwells to obtain a multi-section stair crawling path.
Further, the process of generating all feasible floor plane shortest paths in the floor member with the starting point and the floor member with the ending point based on the plane path algorithm in step S4 includes the following steps:
step S41: assigning the weight values of a starting point grid and a temporary starting point grid in the floor slab member to be 0, wherein the temporary starting point grid is a grid to which the end point of the stair crawling path belongs;
step S42: respectively starting from a starting point grid and a temporary starting point grid, and searching paths according to a weighted value of 8 directions of the grid, wherein the path weight value given to the path searching in the four directions of front, back, left and right is 10, and the path weight value given to the path searching in the four directions of left-down, right-down, left-up and right-up is 14;
step S43: respectively calculating the sum of the path weights from a starting point grid to a temporary destination grid and from the temporary starting point grid to the destination grid, wherein the temporary destination grid is the grid to which the starting point of the stair crawling path belongs;
step S44: and screening a search path with the minimum sum of the path weights, wherein the shortest path from the starting point grid to the temporary destination grid is the shortest path of the floor plane of the floor member at the starting point position, and the shortest path from the temporary starting point grid to the destination grid is the shortest path of the floor plane of the floor member at the destination position.
In addition, the invention also provides an automatic generation system of the elevator emergency rescue path, which comprises
The system comprises a model import module, a model selection module and a model selection module, wherein the model import module is used for importing a three-dimensional building model containing elevator equipment, and each floor slab member, each stair member and each obstacle in the three-dimensional building model are named or subjected to attribute setting according to a preset rule;
the pretreatment module is used for pretreating the three-dimensional building model, and the pretreatment process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
the setting module is used for setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
the calculation module is used for automatically generating a stair climbing path from the starting point to the end point and all feasible floor slab plane shortest paths based on the set starting point position and the set end point position;
and the path generation module is used for combining all feasible shortest paths of the floor slab plane and stair crawling paths to obtain at least one optimal emergency rescue path.
In addition, the present invention also provides an apparatus comprising a processor and a memory, wherein the memory stores a computer program, and the processor is used for executing the steps of the method by calling the computer program stored in the memory.
In addition, the invention also provides a computer readable storage medium for storing a computer program for automatically generating an elevator emergency rescue path, wherein the computer program executes the steps of the method when running on a computer.
The invention has the following effects:
according to the automatic generation method of the elevator emergency rescue path, naming and attribute setting are carried out on each floor slab member, each stair member and each obstacle in the adopted three-dimensional building model according to preset rules, so that the required members can be identified and distinguished through keywords or key attribute classification, and a convenient data basis is provided for automatic generation of subsequent paths. And then preprocessing the three-dimensional building model to obtain the crawling path and the path length of each stair member so as to automatically generate all stair crawling paths from the elevator emergency rescue starting point to the terminal point in the follow-up process, and performing gridding processing and setting barrier grids on each floor slab member so as to automatically generate all feasible floor slab plane shortest paths in the follow-up process. And finally, combining the stair crawling path required to pass from the elevator emergency rescue starting point to the elevator emergency rescue terminal point with the feasible shortest floor plane path to obtain the optimal emergency rescue path with the shortest path length. In the whole path generation process, the starting point and the end point of the rescue path only need to be set manually, the inflection points at all positions in the path do not need to be judged manually, the technical threshold is low, the automatic generation efficiency is high, the optimal rescue path can be generated quickly and automatically, and the requirement on timeliness of emergency rescue can be met well.
In addition, the automatic generation system, the automatic generation device and the computer-readable storage medium of the elevator emergency rescue path have the advantages.
In addition to the objects, features and advantages described above, other objects, features and advantages of the present invention are also provided. The present invention will be described in further detail below with reference to the drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the invention and, together with the description, serve to explain the invention and not to limit the invention. In the drawings:
fig. 1 is a flow chart of an automatic generation method of an elevator emergency rescue path according to a preferred embodiment of the present invention.
Figure 2 is a schematic view of the arrangement of a barrier grid in a reticulated floor element in a preferred embodiment of the invention.
Fig. 3 is a sub-flowchart of step S2 in fig. 1.
Fig. 4 is a sub-flowchart of step S4 in fig. 1.
Fig. 5 is a diagram illustrating a path search from the starting point mesh or the temporary starting point mesh according to a weighted value of the mesh 8 direction in the preferred embodiment of the present invention.
Fig. 6 is a schematic block structure diagram of an automatic generation system of an elevator emergency rescue path according to another embodiment of the present invention.
Detailed Description
The embodiments of the invention will be described in detail below with reference to the accompanying drawings, but the invention can be embodied in many different forms, which are defined and covered by the following description.
As shown in fig. 1, a preferred embodiment of the present invention provides an automatic generation method of an elevator emergency rescue path, including the steps of:
step S1: importing a three-dimensional building model containing elevator equipment, wherein each floor slab member, each stair member and each barrier in the three-dimensional building model are named or set with attributes according to a preset rule;
step S2: preprocessing a three-dimensional building model, wherein the preprocessing process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
step S3: setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
step S4: automatically generating a stair climbing path from the starting point to the end point and all feasible floor plane shortest paths based on the set starting point position and the set end point position;
step S5: and combining the shortest plane path of all feasible floor slabs with the stair crawling path to obtain at least one optimal emergency rescue path.
It can be understood that, in the method for automatically generating an elevator emergency rescue path according to the embodiment, naming and attribute setting are performed on each floor slab member, each stair member and each obstacle according to a preset rule in the three-dimensional building model, so that required members are identified and distinguished through keyword or key attribute classification, and a convenient data base is provided for automatic generation of subsequent paths. And then preprocessing the three-dimensional building model to obtain the crawling path and the path length of each stair member so as to automatically generate all stair crawling paths from the elevator emergency rescue starting point to the terminal point in the follow-up process, and performing gridding processing and setting barrier grids on each floor slab member so as to automatically generate all feasible floor slab plane shortest paths in the follow-up process. And finally, combining the stair crawling path required to pass from the elevator emergency rescue starting point to the elevator emergency rescue terminal point with the feasible shortest floor plane path to obtain the optimal emergency rescue path with the shortest path length. In the whole path generation process, the starting point and the end point of the rescue path only need to be set manually, the inflection points at all positions in the path do not need to be judged manually, the technical threshold is low, the automatic generation efficiency is high, the optimal rescue path can be generated quickly and automatically, and the requirement on timeliness of emergency rescue can be met well.
It is understood that, in the step S1, each floor member, stair member and obstacle in the imported three-dimensional building model (i.e., BIM model) are named or attribute-set according to preset rules, so as to quickly identify members required for path generation through common keywords or key attribute classification, and provide a convenient data base for subsequent path automatic generation.
In step S2, each grid after the gridding process includes at least the following information:
the uniqueness number of the grid, grid coordinates, information of a floor slab, surrounding grid information, grid weight, information of a minimum weight source grid, obstacle grid identification information, starting point grid identification information and ending point grid identification information. Wherein, the peripheral grid information includes but is not limited to the number, grid coordinate, grid weight, grid mark, etc. of the peripheral grid, the obstacle grid mark information is used to represent the actual position of the obstacle corresponding to the position of the grid, the start grid mark information is used to represent the start of the plane path, the end grid mark information is used to represent the end of the plane path, the grid weight is used to represent the minimum of the accumulated weight from the start grid to the current grid, the information of the minimum weight source grid is used to correlate with the previous grid on the search path, because each grid can reach after the path search through at least one grid around, at least one search path exists, at least one accumulated weight is corresponding, and the grid weight stored by each grid is the minimum of the search path of at least one grid nearby, therefore, the current grid on the shortest rescue path can be associated with the previous grid through the information of the minimum weight source grid, and the information of all grids on the shortest rescue path is obtained. As shown in fig. 2, corresponding obstacle grids are arranged in the floor slab member after the gridding processing according to the distribution condition of the obstacles, and then the obstacle grids need to be bypassed when the rescue path is automatically generated.
It is understood that, as shown in fig. 3, the process of preprocessing the crawling path and path length from bottom to top of each stair member based on the stair path algorithm includes the following:
step S21: representing the three-dimensional building model in a triangular surface grid mode;
step S22: extracting all triangular surfaces of each stair component, and screening out the triangular surfaces with upward normal vectors;
step S23: identifying triangular faces adjacent to the same plane and combining the triangular faces into a whole tread;
step S24: calculating the central point of each tread, performing high-low sequencing according to the vertical coordinate of the central point to form a dot matrix, then combining collinear points to form a line segment, wherein the line segment is the crawling path of the single stair, the information contained in the line segment at least comprises coordinates of a starting point and a finishing point, the length of the line segment and the direction of the line segment, and calculating to obtain the plane path and the path length between two adjacent sections of stairs based on the coordinates of the finishing point of the previous single stair and the coordinates of the starting point of the next single stair.
Specifically, the raw data of the BIM model is represented in the form of a triangular surface mesh, that is, each surface of each component in the BIM model is represented by a triangular surface mesh, for example, the side surface and the top surface of the step of the staircase respectively include at least two triangular surfaces. And then extracting the triangular surface of each stair component in the BIM model, and screening out the triangular surfaces with the upward normal vectors, namely screening out at least two triangular surfaces contained in the top surface of the stair step, wherein in the BIM model, the bottom surface of the stair step is usually not represented, so that the screened triangular surfaces with the upward normal vectors belong to the top surface of the step. In addition, because the data of each triangular surface comprises the coordinate data, the triangular surfaces adjacent to the same plane can be identified and combined into the whole tread, and each tread corresponds to the top surface of each step of the stairs in the building. And then, calculating the central point of each tread, sequencing the treads in height according to the vertical coordinate of the central point based on the stair structure, combining collinear points to form a line segment, wherein the line segment is the crawling path of the single-section stair. Theoretically, all the tread center points should be on one line segment, and in practice, some center points deviate from the line segment due to the existence of model errors, and the line segment with the largest number of collinear points is screened out as the crawling path of the single stair. And finally, obtaining information contained in the line segment, such as coordinate information of a starting point and an end point of the line segment, the length of the line segment, the direction of the line segment and the like. In addition, the plane path and the path length between two adjacent sections of staircases are calculated based on the terminal point coordinate of the previous single-section stair and the starting point coordinate of the next single-section stair. And finally, storing the crawling path and path length of each stair section and the plane path and path length of the staircases at two adjacent ends, wherein the crawling path and the plane path of the corresponding single stair section and the plane path of the staircases can be called automatically when the crawling path of the staircases is generated automatically in the follow-up process.
It can be understood that the manner of setting the starting point and the ending point of the elevator emergency rescue path in step S3 is as follows: appointing a line segment in the three-dimensional building model, wherein the intersection points of the starting point and the end point of the line segment and the nearest floor slab member are the starting point and the end point of the elevator emergency rescue path; or setting three-dimensional coordinates of a starting point and an end point in the three-dimensional building model, and projecting to the nearest floor component below according to the three-dimensional coordinates of the starting point and the end point, wherein the projection points are the starting point and the end point of the elevator emergency rescue path respectively. And after the starting point position and the end point position of the elevator emergency rescue path are obtained, the grids to which the starting point and the end point belong are respectively marked as a starting point grid and an end point grid so as to be convenient for calculating the floor slab plane path based on a plane path algorithm.
It can be understood that step S4 specifically includes:
judging whether the set starting position and the set end position belong to the same floor slab member, and if the set starting position and the set end position belong to the same floor slab member, generating all feasible floor slab plane shortest paths according to a plane path algorithm; if the stair climbing paths do not belong to the same floor slab member, a vertical plane formed according to the height coordinates of the starting point position and the end point position intercepts part of stair climbing paths intersected with the vertical plane from all stair climbing paths obtained through preprocessing, and all feasible shortest paths of the floor slab surface in the floor slab member where the starting point is located and the floor slab member where the end point is located are generated based on a plane path algorithm.
The process of automatically generating the stair climbing path from the starting point to the ending point in step S4 specifically includes the following steps:
and extracting corresponding crawling paths of a plurality of single-section stairs and plane paths of stairwells according to the intercepted partial stair crawling paths, and accumulating the crawling paths of the plurality of single-section stairs and the plane paths of the stairwells to obtain a multi-section stair crawling path.
In addition, as shown in fig. 4, the process of generating all feasible floor slab plane shortest paths in the floor slab member where the starting point is located and the floor slab member where the ending point is located in step S4 based on the plane path algorithm includes the following steps:
step S41: assigning the weight values of a starting point grid in the floor slab component where the starting point is located and a temporary starting point grid in the floor slab component where the end point is located to be 0, wherein the temporary starting point grid is a grid to which the end point of the stair climbing path belongs;
step S42: respectively starting from a starting point grid and a temporary starting point grid, and searching paths according to a weighted value of 8 directions of the grid, wherein the path weight value given to the path searching in the four directions of front, back, left and right is 10, and the path weight value given to the path searching in the four directions of left-down, right-down, left-up and right-up is 14;
step S43: respectively calculating the sum of the path weights from a starting point grid to a temporary destination grid and from the temporary starting point grid to the destination grid, wherein the temporary destination grid is the grid to which the starting point of the stair crawling path belongs;
step S44: and screening a search path with the minimum sum of the path weights, wherein the shortest path from the starting point grid to the temporary destination grid is the shortest path of the floor plane of the floor member at the starting point position, and the shortest path from the temporary starting point grid to the destination grid is the shortest path of the floor plane of the floor member at the destination position.
It can be understood that, in the step S41, since the rescue path is divided into the stair crawling path and the planar path, and the stair crawling path is already obtained based on the stair path algorithm, only the planar shortest path needs to be calculated at this time. Thus, it is only necessary to calculate all feasible paths from the starting point in the floor member where the starting point is located to the starting point of the stair crawling path, and all feasible paths from the end point of the stair crawling path to the end point in the floor member where the end point is located. That is, the starting point of the stair crawling path is the temporary end point of the search path in the floor member where the starting point is located, and the end point of the stair crawling path is the temporary starting point of the search path in the floor member where the end point is located. And assigning the weights of the starting point grids in the floor slab member where the starting point is located and the temporary starting point grids in the floor slab member where the end point is located to be 0, and then searching paths respectively reaching the temporary end point grids and the actual end point grids.
It can be understood that, as shown in fig. 5, the path search is performed according to the grid 8 direction weighting values from the starting point grid I or the temporary starting point grid I, the weights reaching the grid O, C, H, J are 10 respectively, and the weights reaching the grid B, D, N, P are 14 respectively. Referring to fig. 2, assuming that the starting point grid is grid I and the ending point grid is grid G1, there are many search paths from grid I to grid G1, and the cumulative weight of each search path to grid G1 can be obtained. Then, all the search paths from the grid I to the grid G1 and the corresponding cumulative weights are calculated, and the search path with the smallest cumulative weight is screened out, i.e. the search path with the shortest length from the starting grid I to the ending grid G1.
The shortest path from the starting point grid to the temporary destination grid is the shortest path of the floor plane of the floor member where the starting point position is located, and the shortest path from the temporary starting point grid to the destination grid is the shortest path of the floor plane of the floor member where the destination position is located.
In addition, when the set starting point position and the set end point position belong to the same floor slab component, namely the elevator is subjected to emergency rescue without climbing stairs, all feasible floor slab plane shortest paths are generated by directly adopting a plane path algorithm.
In addition, as shown in fig. 6, the present invention further provides an automatic generation system of an elevator emergency rescue path, preferably the automatic generation method of an elevator emergency rescue path according to the above embodiment, the system includes
The system comprises a model import module, a model selection module and a model selection module, wherein the model import module is used for importing a three-dimensional building model containing elevator equipment, and each floor slab member, each stair member and each obstacle in the three-dimensional building model are named or subjected to attribute setting according to a preset rule;
the pretreatment module is used for pretreating the three-dimensional building model, and the pretreatment process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
the setting module is used for setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
the calculation module is used for automatically generating a stair climbing path from the starting point to the end point and all feasible floor slab plane shortest paths based on the set starting point position and the set end point position;
and the path generation module is used for combining all feasible shortest paths of the floor slab plane and stair crawling paths to obtain at least one optimal emergency rescue path.
It can be understood that each module included in the system of this embodiment corresponds to each step in the method embodiment, and therefore, the specific working process of each module is not described herein again.
It can be understood that, in the automatic generation system of the elevator emergency rescue path of the embodiment, naming and attribute setting are performed on each floor slab member, stair member and barrier according to preset rules in the adopted three-dimensional building model, so that required members are identified and distinguished through keywords or key attribute classification, and a convenient data base is provided for the automatic generation of subsequent paths. And then preprocessing the three-dimensional building model to obtain the crawling path and the path length of each stair member so as to automatically generate all stair crawling paths from the elevator emergency rescue starting point to the terminal point in the follow-up process, and performing gridding processing and setting barrier grids on each floor slab member so as to automatically generate all feasible floor slab plane shortest paths in the follow-up process. And finally, combining the stair crawling path required to pass from the elevator emergency rescue starting point to the elevator emergency rescue terminal point with the feasible shortest floor plane path to obtain the optimal emergency rescue path with the shortest path length. In the whole path generation process, the starting point and the end point of the rescue path only need to be set manually, the inflection points at all positions in the path do not need to be judged manually, the technical threshold is low, the automatic generation efficiency is high, the optimal rescue path can be generated quickly and automatically, and the requirement on timeliness of emergency rescue can be met well.
In addition, the present invention also provides an apparatus comprising a processor and a memory, wherein the memory stores a computer program, and the processor is used for executing the steps of the method by calling the computer program stored in the memory.
In addition, the invention also provides a computer readable storage medium for storing a computer program for automatically generating an elevator emergency rescue path, wherein the computer program executes the steps of the method when running on a computer.
The general form of computer readable media includes: floppy disk (floppy disk), flexible disk (flexible disk), hard disk, magnetic tape, any of its magnetic media, CD-ROM, any of the other optical media, punch cards (punch cards), paper tape (paper tape), any of the other physical media with patterns of holes, Random Access Memory (RAM), Programmable Read Only Memory (PROM), Erasable Programmable Read Only Memory (EPROM), FLASH erasable programmable read only memory (FLASH-EPROM), any of the other memory chips or cartridges, or any of the other media from which a computer can read. The instructions may further be transmitted or received by a transmission medium. The term transmission medium may include any tangible or intangible medium that is operable to store, encode, or carry instructions for execution by the machine, and includes digital or analog communications signals or intangible medium that facilitates communication of the instructions. Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise a bus for transmitting a computer data signal.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. An automatic generation method of an elevator emergency rescue path is characterized by comprising the following steps:
step S1: importing a three-dimensional building model containing elevator equipment, wherein each floor slab member, each stair member and each barrier in the three-dimensional building model are named or set with attributes according to a preset rule;
step S2: preprocessing a three-dimensional building model, wherein the preprocessing process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
step S3: setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
step S4: automatically generating a stair climbing path from the starting point to the end point and all feasible floor plane shortest paths based on the set starting point position and the set end point position;
step S5: and combining the shortest plane path of all feasible floor slabs with the stair crawling path to obtain at least one optimal emergency rescue path.
2. The automatic generation method of an elevator emergency rescue path according to claim 1, wherein in the step S2, each mesh after the gridding process includes at least the following information:
the uniqueness number of the grid, grid coordinates, information of a floor slab, surrounding grid information, grid weight, information of a minimum weight source grid, obstacle grid identification information, starting point grid identification information and ending point grid identification information.
3. The method for automatically generating an elevator emergency rescue path according to claim 1, wherein the starting point and the ending point of the elevator emergency rescue path are set in step S3 in a manner that: appointing a line segment in the three-dimensional building model, wherein the intersection points of the starting point and the end point of the line segment and the nearest floor slab member are the starting point and the end point of the elevator emergency rescue path; or setting three-dimensional coordinates of a starting point and a terminal point in the three-dimensional building model, and projecting to the nearest floor component below according to the three-dimensional coordinates of the starting point and the terminal point, wherein the projection points are the starting point and the terminal point of the elevator emergency rescue path respectively;
and after the starting point position and the end point position of the elevator emergency rescue path are obtained, respectively marking the grids to which the starting point and the end point belong as a starting point grid and an end point grid.
4. The method for automatically generating an elevator emergency rescue path according to claim 1, wherein the pre-processing based on the stair path algorithm to obtain the crawling path and the path length of each stair member from bottom to top comprises the following steps:
step S21: representing the three-dimensional building model in a triangular surface grid mode;
step S22: extracting all triangular surfaces of each stair component, and screening out the triangular surfaces with upward normal vectors;
step S23: identifying triangular faces adjacent to the same plane and combining the triangular faces into a whole tread;
step S24: calculating the central point of each tread, performing high-low sequencing according to the vertical coordinate of the central point to form a dot matrix, then combining collinear points to form a line segment, wherein the line segment is the crawling path of the single stair, the information contained in the line segment at least comprises coordinates of a starting point and a finishing point, the length of the line segment and the direction of the line segment, and calculating to obtain the plane path and the path length between two adjacent sections of stairs based on the coordinates of the finishing point of the previous single stair and the coordinates of the starting point of the next single stair.
5. The automatic generation method of the elevator emergency rescue path according to claim 4, wherein the step S4 is specifically:
judging whether the set starting point position and the set end point position belong to the same floor slab member, if the set starting point position and the set end point position belong to the same floor slab member, generating all feasible floor slab plane shortest paths according to a plane path algorithm, if the set starting point position and the set end point position do not belong to the same floor slab member, intercepting partial stair crawling paths intersected with the vertical plane from all stair crawling paths obtained through preprocessing according to the vertical plane formed by the height coordinates of the starting point position and the end point position, and generating all feasible floor slab plane shortest paths in the floor slab member where the starting point is located and the floor slab member where the end point is located based on the plane path algorithm.
6. The method for automatically generating an elevator emergency rescue path according to claim 5, wherein the step S4 of automatically generating the stair climbing path from the starting point to the ending point specifically comprises the following steps:
and extracting corresponding crawling paths of a plurality of single-section stairs and plane paths of stairwells according to the intercepted partial stair crawling paths, and accumulating the crawling paths of the plurality of single-section stairs and the plane paths of the stairwells to obtain a multi-section stair crawling path.
7. The automatic generation method of elevator emergency rescue path according to claim 5, wherein the step S4 of generating all feasible floor plane shortest paths of the floor member with the starting point and the floor member with the ending point based on the plane path algorithm comprises the following steps:
step S41: assigning the weight values of a starting point grid and a temporary starting point grid in the floor slab member to be 0, wherein the temporary starting point grid is a grid to which the end point of the stair crawling path belongs;
step S42: respectively starting from a starting point grid and a temporary starting point grid, and searching paths according to a weighted value of 8 directions of the grid, wherein the path weight value given to the path searching in the four directions of front, back, left and right is 10, and the path weight value given to the path searching in the four directions of left-down, right-down, left-up and right-up is 14;
step S43: respectively calculating the sum of the path weights from a starting point grid to a temporary destination grid and from the temporary starting point grid to the destination grid, wherein the temporary destination grid is the grid to which the starting point of the stair crawling path belongs;
step S44: and screening a search path with the minimum sum of the path weights, wherein the shortest path from the starting point grid to the temporary destination grid is the shortest path of the floor plane of the floor member at the starting point position, and the shortest path from the temporary starting point grid to the destination grid is the shortest path of the floor plane of the floor member at the destination position.
8. An automatic generation system of an elevator emergency rescue path is characterized by comprising
The system comprises a model import module, a model selection module and a model selection module, wherein the model import module is used for importing a three-dimensional building model containing elevator equipment, and each floor slab member, each stair member and each obstacle in the three-dimensional building model are named or subjected to attribute setting according to a preset rule;
the pretreatment module is used for pretreating the three-dimensional building model, and the pretreatment process comprises the following steps: preprocessing based on a stair path algorithm to obtain a climbing path and a path length of each stair component from bottom to top, performing gridding processing on each floor slab component, and setting corresponding obstacle grids in each floor slab component after gridding processing according to the distribution condition of obstacles;
the setting module is used for setting a starting point and a terminal point of an elevator emergency rescue path in the three-dimensional building model;
the calculation module is used for automatically generating a stair climbing path from the starting point to the end point and all feasible floor slab plane shortest paths based on the set starting point position and the set end point position;
and the path generation module is used for combining all feasible shortest paths of the floor slab plane and stair crawling paths to obtain at least one optimal emergency rescue path.
9. An apparatus comprising a processor and a memory, the memory having stored therein a computer program, the processor being configured to perform the steps of the method of any one of claims 1 to 7 by invoking the computer program stored in the memory.
10. A computer-readable storage medium for storing a computer program for automatically generating an elevator emergency rescue path, characterized in that the computer program, when running on a computer, performs the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488304.7A CN113255110B (en) | 2021-05-06 | 2021-05-06 | Automatic generation method, system, equipment and medium for elevator emergency rescue path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488304.7A CN113255110B (en) | 2021-05-06 | 2021-05-06 | Automatic generation method, system, equipment and medium for elevator emergency rescue path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113255110A true CN113255110A (en) | 2021-08-13 |
| CN113255110B CN113255110B (en) | 2022-07-01 |
Family
ID=77223517
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110488304.7A Active CN113255110B (en) | 2021-05-06 | 2021-05-06 | Automatic generation method, system, equipment and medium for elevator emergency rescue path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113255110B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646166A (en) * | 2012-03-08 | 2012-08-22 | 北京师范大学 | Indoor emergency evacuation simulation method for complex building |
| CN108596382A (en) * | 2018-04-18 | 2018-09-28 | 中国地质大学（武汉） | Rescue path planing method based on a lot of points, point more to be rescued, multiple terminals |
| CN110642111A (en) * | 2019-09-29 | 2020-01-03 | 湖南省特种设备检验检测研究院 | Elevator operation monitoring and emergency rescue three-dimensional system and method |
| WO2020134082A1 (en) * | 2018-12-28 | 2020-07-02 | 歌尔股份有限公司 | Path planning method and apparatus, and mobile device |
-
2021
- 2021-05-06 CN CN202110488304.7A patent/CN113255110B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646166A (en) * | 2012-03-08 | 2012-08-22 | 北京师范大学 | Indoor emergency evacuation simulation method for complex building |
| CN108596382A (en) * | 2018-04-18 | 2018-09-28 | 中国地质大学（武汉） | Rescue path planing method based on a lot of points, point more to be rescued, multiple terminals |
| WO2020134082A1 (en) * | 2018-12-28 | 2020-07-02 | 歌尔股份有限公司 | Path planning method and apparatus, and mobile device |
| CN110642111A (en) * | 2019-09-29 | 2020-01-03 | 湖南省特种设备检验检测研究院 | Elevator operation monitoring and emergency rescue three-dimensional system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113255110B (en) | 2022-07-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Soltani et al. | Path planning in construction sites: performance evaluation of the Dijkstra, A∗, and GA search algorithms | |
| CN111275923B (en) | Man-machine collision early warning method and system for construction site | |
| CN108897969B (en) | BIM-based facility maintenance automatic scheduling method | |
| CN110309952B (en) | City employment spatial layout optimization auxiliary system based on commuting model | |
| CN108663047B (en) | Cross-layer path planning method | |
| JP5694078B2 (en) | Management system and management method | |
| CN115545359B (en) | Dynamic intelligent evacuation method and device for complex building fire | |
| CN115330360B (en) | Pedestrian trajectory calculation method based on multi-agent simulation technology | |
| CN111626648B (en) | Survey task scheduling method and device, computer equipment and storage medium | |
| JP6059030B2 (en) | Network data generation system, method, and program | |
| CN113255110B (en) | Automatic generation method, system, equipment and medium for elevator emergency rescue path | |
| US11637417B2 (en) | System and method for analyzing survivability of an infrastructure link | |
| Koriashkina et al. | TWO-STAGE PROBLEMS OF OPTIMAL LOCATION AND DISTRIBUTION OF THE HUMANITARIAN LOGISTICS SYSTEM’S STRUCTURAL SUBDIVISIONS. | |
| KR20170081884A (en) | System for providing indoor route and method thereof | |
| CN112232722A (en) | Building equipment management system based on building information model technology | |
| JP2012190237A (en) | Arrangement method determination system for vehicle | |
| Palve | Applications of GIS in infrastructure project management | |
| CN115440044A (en) | Road multi-source event data fusion method and device, storage medium and terminal | |
| CN115660157A (en) | Smart city charging pile construction planning method, internet of things system, device and medium | |
| Zuccaro et al. | Seismic impact scenarios in the volcanic areas in Campania | |
| JP2022068441A (en) | Computer system and plan evaluation method | |
| CN113593217B (en) | Traffic police force commanding and dispatching method, equipment and readable storage medium | |
| KR102443937B1 (en) | Optimal Area Analysis Method and Device for Responding to Forest Fires, and Medium Being Recorded with Program for Executing the Method | |
| JP2021068164A (en) | Construction management support program, construction management support method and construction management support device | |
| CN115562334B (en) | Unmanned plane cluster task cooperation method and system oriented to multi-source disaster situation data fusion |
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 |