Method for determining fire-fighting escape path in real time, fire-fighting emergency lamp and system
By collecting obstacle information in real time and performing grid-based labeling, combined with path planning algorithms, fire escape routes are generated, solving the problem of blocked escape routes during disasters and achieving safe and efficient escape route generation.
Patent Information
- Application Number
- CN202410948300.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2026-01-16
AI Technical Summary
Existing fire escape routes are easily blocked by building deformation or fire during disasters, making it impossible for people to evacuate safely.
By collecting real-time information on the distribution of indoor obstacles, the target space is marked in a grid, and a passable path from a specified starting position to a specified exit is determined. The passability status is represented by the grid space feature values, and a safe escape path is generated by combining the path planning algorithm.
It enables real-time determination of safe fire escape routes in disaster situations, improving the safety and efficiency of escape routes and avoiding the problem of predetermined routes being blocked.
Smart Images
Figure CN121354261A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of fire safety, and in particular to a method, fire emergency lighting fixtures and systems for determining fire escape routes in real time. Background Technology
[0002] In the field of fire safety, in order to ensure the safety of people evacuation after a disaster, evacuation plans are often developed based on the building structure to ensure that people can evacuate safely and quickly according to the pre-determined escape routes.
[0003] However, in practical applications, disasters can lead to unexpected situations, such as building deformation, wall collapse, or disintegration. This could result in safe escape routes being blocked by deformed or collapsed buildings, or by fire ignition points, potentially preventing people from escaping along pre-designated safe escape routes.
[0004] How to improve the safety of fire escape routes is the technical problem that this application aims to solve. Summary of the Invention
[0005] The purpose of this application is to provide a method, emergency lighting fixtures and system for real-time determination of fire escape routes, so as to improve the safety of fire escape routes.
[0006] Firstly, a method for determining fire escape routes in real time is provided, including:
[0007] Obtain information about the target space for determining the fire escape route, wherein the information about the target space includes at least one designated starting position and at least one designated exit position located within the target space;
[0008] Real-time acquisition of indoor obstacle distribution information in the target space;
[0009] The target space is marked with a grid based on the indoor obstacle distribution information. Each grid space of the target space marked with a grid has a passability feature value, which indicates whether the corresponding grid space is passable.
[0010] Based on the gridded target space, a fire escape route is determined from the target designated starting position to any of the designated exit positions, wherein the target designated starting position is any one of the at least one designated starting position, and any grid space along the path of the fire escape route is in a passable state.
[0011] Secondly, a device for determining fire escape routes in real time is provided, comprising:
[0012] The acquisition module acquires information about the target space for determining the fire escape route, the information of which includes at least one designated starting position and at least one designated exit position within the target space.
[0013] The acquisition module collects real-time information on the distribution of indoor obstacles in the target space;
[0014] The processing module performs grid-based labeling on the target space based on the indoor obstacle distribution information. Each grid space of the target space after grid-based labeling has a passability feature value, which indicates whether the corresponding grid space is passable.
[0015] The determination module determines a fire escape route from the target's designated starting position to any of the designated exit positions based on the gridded target space, wherein the target's designated starting position is any one of the at least one designated starting position, and any grid space along the path of the fire escape route is passable.
[0016] Thirdly, a fire emergency lighting fixture is provided to determine fire escape routes in real time, for use in:
[0017] Obtain information about the target space for determining the fire escape route, including the target space information such as the designated starting position of the fire emergency lighting fixture located in the target space and at least one designated exit position;
[0018] Acquire indoor obstacle distribution information of the target space in real time from environmental sensors;
[0019] The target space is marked with a grid based on the indoor obstacle distribution information. Each grid space of the target space marked with a grid has a passability feature value, which indicates whether the corresponding grid space is passable.
[0020] Based on the gridded target space, a fire escape route is determined from the specified starting position of the target to any specified exit position, wherein any grid space through which the fire escape route passes is in a passable state.
[0021] The fire escape route is shown.
[0022] Fourthly, a system for determining fire escape routes in real time is provided, including:
[0023] As described in the third aspect, fire emergency lighting fixtures that determine fire escape routes in real time;
[0024] At least one environmental sensor is communicatively connected to the fire emergency lighting fixture that determines fire escape routes in real time, for collecting indoor obstacle distribution information of the target space in real time and providing it to the fire emergency lighting fixture that determines fire escape routes in real time.
[0025] Fifthly, an electronic device is provided, comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the method of the first aspect.
[0026] In a sixth aspect, a computer-readable storage medium is provided on which a computer program is stored, which, when executed by a processor, implements the steps of the method of the first aspect.
[0027] In a seventh aspect, a computer program product is provided, comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of the method of the first aspect.
[0028] In this embodiment, firstly, information about the target space for determining the fire escape route is acquired. This information includes at least one designated starting position and at least one designated exit position within the target space. This target space information indicates the starting and ending points of the fire escape route. Then, real-time information on the distribution of indoor obstacles within the target space is collected. This information indicates which areas within the target space are passable, providing an information basis for determining the fire escape route in subsequent steps. Next, the target space is gridded based on the indoor obstacle distribution information. Each grid space in the gridded target space has a passability feature value, which indicates whether the corresponding grid space is passable. Gridding transforms the target space into a grid space that facilitates the generation of escape routes, visually expressing the passability of each grid space in the form of feature values. Subsequently, based on the gridded target space, a fire escape route from the designated starting position to any designated exit position is determined. The designated starting position is any one of at least one designated starting position, and all grid spaces along the fire escape route are passable. Because the indoor obstacle distribution information is collected in real time in this solution, the determined fire escape routes are passable in real time, which effectively improves the safety of determining fire escape routes. Specifically, the target space is gridded, which efficiently divides the target space into easily manageable grids. The feature values of the grid spaces facilitate subsequent efficient identification of whether the grid spaces are passable, thereby improving the efficiency of determining fire escape routes. Attached Figure Description
[0029] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:
[0030] Figure 1a This is a flowchart illustrating one embodiment of a method for determining fire escape routes in real time according to this application;
[0031] Figure 1b This is one of the scenario diagrams of a target space for real-time determination of fire escape routes, as an embodiment of this application;
[0032] Figure 1c This is a second schematic diagram of a target space for real-time determination of fire escape routes, as described in one embodiment of this application.
[0033] Figure 1d This is the third of a scenario diagram illustrating a target space for real-time determination of fire escape routes, as described in one embodiment of this application.
[0034] Figure 2 This is a second schematic flowchart of an embodiment of the present application of a method for determining fire escape routes in real time;
[0035] Figure 3a This is a third flowchart illustrating a method for determining fire escape routes in real time, as described in one embodiment of this application.
[0036] Figure 3b This is the fourth of a scenario diagram illustrating a target space for real-time determination of fire escape routes, as described in one embodiment of this application.
[0037] Figure 4a This is a fourth flowchart illustrating a method for determining fire escape routes in real time, as described in one embodiment of this application.
[0038] Figure 4b This is the fifth of a scenario diagram illustrating a target space for real-time determination of fire escape routes, as described in one embodiment of this application.
[0039] Figure 5 This is the fifth of a flowchart illustrating a method for determining fire escape routes in real time, as an embodiment of this application.
[0040] Figure 6 This is a schematic flowchart of a method for determining fire escape routes in real time, which is one embodiment of this application;
[0041] Figure 7 This is a schematic diagram of a device for real-time determination of fire escape routes, as an embodiment of this application;
[0042] Figure 8 This is a schematic diagram illustrating the process of a fire emergency lighting fixture that determines and displays a fire escape route in real time, as an embodiment of this application.
[0043] Figure 9 This is a schematic diagram of a system for determining fire escape routes in real time, according to one embodiment of this application. Detailed Implementation
[0044] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application. The drawing numbers in this application are only used to distinguish the various steps in the solution and are not used to limit the execution order of the various steps. The specific execution order is subject to the description in the specification.
[0045] This application provides a method for real-time determination of fire escape routes, which can be executed by a computer or other electronic devices with processing capabilities. This solution can be used to efficiently generate fire escape routes within building interior spaces, ensuring the real-time safety of the generated fire escape routes. Figure 1a As shown, it includes:
[0046] S11: Obtain information about the target space for determining the fire escape route, wherein the information about the target space includes at least one designated starting position and at least one designated exit position located within the target space.
[0047] Figure 1b A scene diagram of a target space is shown. In this step, obtaining information about the target space may include, for example, building structure information, which can represent the movable areas within the target space (e.g., Figure 1b (Uncovered blank areas). For example, if the target space is a room on a certain floor, the information about the target space can include the room's interior floor plan. Additionally, building structure information can include information about the items and furniture placed within the target space, which can be used to determine whether different areas within the target space are accessible.
[0048] The information about the target space can include planar information, such as an interior floor plan, or other forms of information. For example, the information about the target space can also include images and videos captured by cameras. Alternatively, it can include information about the materials of building walls, objects, or facilities.
[0049] The information in the target space includes at least one specified starting position (in Figure 1b (shown in circles) and at least one designated exit location (in Figure 1b (shown as a triangle in the middle), such as Figure 1b As indicated by the middle arrow. The designated starting position can be flexibly set according to actual needs. For example, the designated starting position can be set according to fire safety requirements, using the location where safety escape signs need to be placed as the designated starting position. The fire escape route determined in this way can be displayed graphically on the safety escape signs. The designated exit location can be a location that allows leaving the target area, leading to the outside or to an evacuation staircase. If the target space is a higher floor in a building, then the designated exit can be a location on that floor leading to the next floor near the ground.
[0050] S12: Real-time acquisition of indoor obstacle distribution information in the target space.
[0051] In this step, images of the target space can be acquired using image acquisition devices such as cameras to determine the distribution of indoor obstacles within the target space. Alternatively, other types of sensing devices can be used to collect information, such as sensors installed on the ceiling to detect whether there are obstacles in the area below the sensor.
[0052] The indoor obstacle distribution information can be obtained by processing and summarizing information collected from multiple acquisition devices. The indoor obstacle distribution information collected in different areas of the target space can be expressed in different forms. For example, information in the form of images is collected from one part of the space by cameras, while information in another part is collected by sensing devices. Figure 1b The shadows in the middle indicate areas that are impassable due to building structures or fixed objects.
[0053] S13: Perform grid-based labeling processing on the target space according to the indoor obstacle distribution information. Any grid space of the target space after grid-based labeling has a passability feature value, which indicates whether the corresponding grid space is in a passable state.
[0054] In this step, the target space can first be gridded, dividing it into uniform or non-uniform grids. The specific size of the grid can be flexibly set according to actual needs. Optionally, the smaller the grid size, the higher the accuracy. To facilitate crowd escape, the size of the grid can be determined based on the space occupied by an average person, ensuring that one person can be accommodated in each grid space, thereby ensuring that a person can safely pass through a grid space.
[0055] For the gridded target space, feature values are further labeled according to its accessibility. These feature values indicate whether the corresponding grid space is passable or blocked. For example, a passable target space has a feature value of 1, while an impassable target space has a feature value of 0. The target space after gridding labeling is as follows: Figure 1c As shown.
[0056] "Passable" means that the target space can be safely passed through by at least one person. "Impassable" can be due to obstruction caused by building deformation or collapse, or due to open flames or excessively high temperatures within the target space.
[0057] S14: Based on the gridded target space, determine a fire escape route from the target specified starting position to any of the specified exit positions, wherein the target specified starting position is any one of the at least one specified starting position, and any grid space through which the fire escape route passes is in a passable state.
[0058] This step can be achieved through various path planning algorithms. Based on the target space marked by the above grid, the path planning algorithm can determine the fire escape path with the accuracy of the grid space. The fire escape path consists of multiple consecutive passable grid spaces with a feature value of 1. The fire escape path starts from the target and connects to the designated exit position through the passable grid space. Figure 1d An alternative fire escape route is shown.
[0059] The path planning algorithm can specifically use basic algorithms such as Dijkstra's algorithm, A* algorithm, and artificial potential field algorithm, or intelligent optimization algorithms such as ant colony algorithm, genetic algorithm, particle swarm algorithm, and artificial neural network algorithm, or a combination of multiple algorithms to jointly determine the path.
[0060] If multiple fire escape routes can be generated for a given starting location, the shortest and safest fire escape route can be selected as the optimal fire escape route for that starting location. The determined fire escape route will facilitate people to escape safely from the given starting location as quickly as possible.
[0061] The solution provided in this application can improve the safety of fire escape in buildings and is beneficial for optimizing fire evacuation plans. In the event of fire, earthquake, or other emergencies, it can generate safe fire escape routes in real time, ensuring that people can escape through passable paths and avoiding the problem of planned evacuation routes being blocked due to building deformation or collapse.
[0062] Because the indoor obstacle distribution information is collected in real time in this solution, the determined fire escape routes are passable in real time, which effectively improves the safety of determining fire escape routes. Specifically, the target space is gridded, which efficiently divides the target space into easily manageable grids. The feature values of the grid spaces facilitate subsequent efficient identification of whether the grid spaces are passable, thereby improving the efficiency of determining fire escape routes.
[0063] Based on the solutions provided in the above embodiments, optionally, such as Figure 2 As shown, in step S13 above, the target space is subjected to gridding annotation processing based on the indoor obstacle distribution information, including:
[0064] S21: Determine whether multiple grid spaces are passable based on the indoor obstacle distribution information, wherein the multiple grid spaces are obtained by dividing the target space based on preset gridding rules.
[0065] In this step, the grid space is obtained by dividing the target space based on preset gridding rules. These preset gridding rules can be flexibly set according to actual needs. For example, the preset gridding rules may include preset grid sizes; during the grid space division step, the target space can be divided into multiple grid spaces of preset grid sizes. Alternatively, the preset gridding rules may include grid partitioning rules; during the grid space division step, grid partitioning can be performed according to these rules. For example, any dimension of the target space can be uniformly divided into 20 parts to obtain an equally divided grid space.
[0066] In practical applications, the grid space can be pre-divided and stored as information of the target space in a preset storage space. In the step of obtaining the information of the target space of the fire escape route to be determined, the pre-divided grid space is directly obtained from the preset storage space, and then in the step of performing grid annotation processing, the pre-divided grid space is annotated.
[0067] Alternatively, in the step of performing gridding and annotation, the undivided target space can be first divided into grids, and then the gridded space can be annotated.
[0068] During the grid-based annotation process, the accessibility of each grid space is determined based on the indoor obstacle distribution information. If the indoor obstacle distribution information is collected by multiple acquisition devices, the information collected by multiple acquisition devices can be combined to determine whether the grid space is accessible.
[0069] Optionally, if it is impossible to determine whether a certain grid space is passable due to equipment malfunction, unclear images caused by smoke, or inaccurate information, the passability status of that grid space can be marked as unknown. In the subsequent step of determining fire escape routes, priority is given to using grid spaces with passable status to construct fire escape routes. If a complete fire escape route cannot be constructed using grid spaces with passable status, fire escape routes can be constructed using both grid spaces with passable status and grid spaces with unknown passability status.
[0070] S22: Generate a matrix corresponding to the target space, wherein the elements in the matrix correspond to the grid spaces in the target space, and the values of the elements represent whether the corresponding grid spaces are in a passable state.
[0071] The matrix in this example can be a Boolean matrix, a floating-point matrix, or a matrix of other types.
[0072] Taking a Boolean matrix as an example, this step uses a Boolean matrix to express the passability status of each grid space within the target space. The values of the elements in the Boolean matrix are either 0 or 1. In this example, 0 represents a grid space that is not passable, and 1 represents a grid space that is passable.
[0073] Representing the traversability of each grid space within the target space using a Boolean matrix facilitates real-time information updates and maintenance, improves the efficiency of generating fire escape routes, and offers advantages such as ease of maintenance and retrieval. In subsequent steps, the paths in grid spaces containing at least 0 can be calculated based on the aforementioned Boolean matrix to serve as fire escape routes.
[0074] In practical applications, if a Boolean matrix is used, there may be a large number of grid spaces with element values of 0, meaning that many grid spaces are impassable and a path cannot be determined. However, if a floating-point matrix is used, the value of any element is greater than or equal to 0 and less than or equal to 1, allowing the selection of more suitable grid spaces based on the magnitude of the element value.
[0075] The following example illustrates the process of determining fire escape routes based on floating-point matrices.
[0076] In this embodiment, a floating-point matrix is used to represent the passability of each grid space on a floor. In practical applications, some element values in the floating-point matrix can represent walls, meaning that people are absolutely unable to pass through. Other values represent fires or other obstacles, meaning that people may be able to pass through, and whether they are actually passable depends on the size of the fire or the amount of obstacles.
[0077] For example, the values of elements in a floating-point matrix can be labeled as follows:
[0078] Locations with a value of 0 are blocked by walls, meaning they are absolutely impassable.
[0079] Positions with values greater than 0 but less than or equal to 1 are blocked by fire or other obstacles. The closer the value is to 0, the larger the fire and the more serious the blockage, making it less passable; the closer the value is to 1, the smaller the fire and the less the blockage, making it more passable.
[0080] A location with a value of 1 indicates that there is no fire and the path is completely passable.
[0081] Based on the floating-point matrix obtained from the above annotations, the cost of passing through a location is adjusted according to the size of the fire at that location. The larger the fire (the closer the value is to 0), the higher the cost of passing through. Wall locations (with a value of 0) are still impassable.
[0082] Optionally, the cost of traversing a fire zone can be adjusted using `1 / grid[next[0]][next[1]]`, resulting in higher costs for areas with larger fires (grid spaces with values close to 0) and lower costs for areas with smaller fires (grid spaces with values close to 1). Therefore, in determining fire escape routes, the algorithm can avoid grid spaces with larger fires as much as possible, favoring areas with smaller or no fires, thus increasing the probability of the determined fire escape route being passable. Simultaneously, walls (positions with values of 0) are considered completely impassable, and the algorithm avoids passing through completely impassable positions during the process of determining fire escape routes.
[0083] Optionally, in one case, during the step of determining the fire escape route using a floating-point matrix, an algorithm can be used to add a very small preset value, such as 0.001, to the values of the zero elements. This allows the use of a floating-point matrix without zero-valued elements to determine the fire escape route.
[0084] Optionally, the fire escape route can be determined based on the above Boolean matrix or floating-point matrix using the A* algorithm. In the A* algorithm, g(n) represents the cost of node n from the starting point, which is the sum of multiple `1 / grid[next[0]][next[1]]`, and h(n)a is the Manhattan distance, thus implementing the A* algorithm under the Manhattan distance.
[0085] Based on the solutions provided in the above embodiments, optionally, such as Figure 3a As shown, in step S14 above, determining a fire escape route from the designated starting position to any of the designated exit positions based on the gridded target space includes:
[0086] S31: Based on a heuristic search algorithm, determine multiple candidate fire escape routes from the target's specified starting position to each specified exit position.
[0087] This step uses a heuristic search algorithm to determine the path. A specific example of this heuristic search algorithm is the A* algorithm. This algorithm has the property of being non-empty, meaning that if a feasible fire escape route exists, the A* algorithm will always generate a valid result, without overlooking any feasible fire escape routes. Furthermore, the A* algorithm can efficiently generate the optimal fire escape route.
[0088] Optionally, to improve the efficiency of generating fire escape routes, this scheme can use the multi-threaded optimized A* algorithm, which leverages the efficient processing characteristics of multi-threading to improve the generation efficiency of fire escape routes and enhance the real-time effectiveness of the generated fire escape routes.
[0089] In practical applications, if there are many passable grid spaces, multiple candidate fire escape routes may be generated. These escape routes can all reach the designated exit location from the target's specified starting position through the passable grid spaces. The starting point of multiple candidate fire escape routes is the target's specified starting position, while the endpoints of different candidate fire escape routes can be different or the same designated exit location.
[0090] S32: The shortest candidate fire escape route is determined as the fire escape route corresponding to the specified starting position of the target.
[0091] In this step, the lengths of multiple candidate fire escape routes are compared to determine the shortest one. This determined fire escape route facilitates the rapid evacuation of people at the designated starting point, improving evacuation efficiency and safety.
[0092] Figure 3b The diagram shows two candidate fire escape routes, indicated by solid and dashed arrows. In this step, the lengths of these two routes are determined. As shown in the diagram, the route corresponding to the dashed arrow is two grid units longer than the route corresponding to the solid arrow. Therefore, the fire escape route indicated by the solid arrow is selected as the fire escape route corresponding to this specified starting position.
[0093] Based on the solution provided in the above embodiments, optionally, the number of specified starting positions can be multiple.
[0094] Among them, such as Figure 4a As shown, after step S32 above, that is, after determining the shortest candidate fire escape route as the fire escape route corresponding to the designated starting position of the target, the method further includes:
[0095] S41: Determine a common grid space based on the fire escape routes corresponding to multiple specified starting positions, wherein the common grid space is the grid space through which all the fire escape routes corresponding to the multiple specified starting positions pass.
[0096] Optionally, the at least one designated starting position is the location of the fire emergency lighting fixture within the target space. Specifically, the fire emergency lighting fixture may be a fire escape sign.
[0097] In this embodiment, there are multiple designated starting locations. In practical applications, these multiple designated starting locations may be, for example, locations where fire escape signs need to be installed, and these fire escape signs can display the fire escape routes at their locations.
[0098] In this step, for the fire escape routes corresponding to multiple fire escape signs, the maximum envelope method can be used to determine the common grid space, thereby improving the clarity of the display of multiple fire escape routes.
[0099] In practical applications, the shortest fire escape path can be determined from multiple designated starting locations, and this shortest path and the designated starting location it connects to can be recorded. Then, from at least one fire escape path at another designated starting location, the second shortest fire escape path with the highest overlap with the recorded shortest path can be determined using the maximum envelope method. These two determined fire escape paths traverse a significant amount of overlapping grid space. After recording these two paths, the process continues to determine fire escape paths for other designated starting locations until a fire escape path is determined for each designated starting location, and these determined fire escape paths traverse a significant amount of overlapping grid space, i.e., a common grid space.
[0100] S42: Determine the public fire escape route of the target space based on the fire escape routes of the public grid space.
[0101] In this step, a public fire escape route is generated based on the public grid space determined in the previous steps. This public fire escape route can overlap with multiple fire escape routes at designated starting locations. In practical applications, these public fire escape routes can be prominently displayed on fire escape signs to improve their clarity and readability, and avoid confusion caused by displaying a large number of fire escape routes together.
[0102] Figure 4bTwo public fire escape routes with specified starting locations are shown. Although the fire escape routes corresponding to the two specified starting locations are different, these two fire escape routes share a common grid space. They are connected based on this common grid space to form a public fire escape route, which is shown as a hollow solid line. Figure 4b The arrow is shown in the middle.
[0103] Based on the solution provided in the above embodiments, optionally, the target space marked with a grid includes multiple sets of grid spaces located on different floors.
[0104] Among them, such as Figure 5 As shown, in step S14 above, determining a fire escape route from the designated starting position to any of the designated exit positions based on the gridded target space includes:
[0105] S51: Based on a set of grid spaces on the target floor where the target's designated starting position is located, determine the target floor fire escape route from the target's designated starting position to any designated exit position on the target floor.
[0106] The solution provided in this application can be applied to buildings with multiple floors. In this step, a fire escape route is determined for the target floor, starting from a specified location. The endpoint of the fire escape route can be an evacuation staircase on the target floor, allowing for quick access to adjacent floors near the ground. If the target floor is a ground floor, the endpoint of the fire escape route allows for escape from the building's interior.
[0107] S52: Determine a multi-story fire escape route from the designated starting position of the target floor to any designated exit position of the designated escape floor based on the fire escape routes of each floor between the target floor and the designated escape floor.
[0108] The designated escape floor can be determined based on the actual situation. For example, the designated escape floor could be the ground floor. In some scenarios, the escape floor could also be the top floor or other floors with escape facilities.
[0109] In this step, the fire escape routes of each floor between the target floor and the designated escape floor are obtained. By connecting the fire escape routes of multiple floors, a fire escape route from the target floor to the designated escape floor can be determined, which can facilitate the efficient passage of escaping personnel through multiple floors to reach a location where they can escape the building.
[0110] Based on the solutions provided in the above embodiments, optionally, such as Figure 6As shown, after step S14 above, and after determining the fire escape route from the designated starting position to any of the designated exit positions based on the gridded target space, the method further includes:
[0111] S61: Display the stated fire escape route; and / or,
[0112] S62: Send the fire escape route to the display terminal to instruct the display terminal to display the fire escape route.
[0113] In the solution provided in this application embodiment, the determined fire escape route is displayed using a display device. If the entity executing this solution has its own display function, it can directly display the fire escape route through its own display device. For example, the entity executing this solution could be an electronic sign, which can display the fire escape route corresponding to its location on a display screen.
[0114] Optionally, the aforementioned fire escape routes can be displayed in a two-dimensional format, allowing users to adjust the viewing angle. Alternatively, the fire escape routes can be displayed in a three-dimensional format using projection or other methods for easier viewing by evacuees.
[0115] If the implementing entity of this solution is a backend server, cloud server, or other device that lacks its own display function, the fire escape route can be sent to other devices with display capabilities for display via wired or wireless means. For example, the server can obtain the location information of the escaping person's terminal device and determine that location as the starting point. Based on the information of the target space where the escaping person is located and the real-time collected indoor obstacle distribution information, the server determines the escaping person's fire escape route and then sends the fire escape route to the escaping person's terminal device for display and reference. In practical applications, the escaping person's terminal device can be a portable device, such as a mobile phone, tablet, or laptop. Furthermore, it can also be a wearable portable device, such as a smartwatch or augmented reality glasses.
[0116] Optionally, if the indoor obstacle distribution information of the target space changes in real time, the fire escape routes can be updated in real time to ensure their real-time effectiveness. Alternatively, a periodic update method can be used to maintain the real-time effectiveness of the fire escape routes.
[0117] The solution provided in this application can determine a real-time and effective fire escape route based on multiple factors such as obstacles and fire conditions within the target space. It meets the non-empty response characteristic required by fire service scenarios, meaning that at least one shortest path can always be found when one exists. For multiple different designated starting locations, this solution can clearly display common escape routes using the maximum envelope method, improving the readability of the escape routes.
[0118] To address the problems existing in related technologies, this application also provides a device 70 for real-time determination of fire escape routes, such as... Figure 7 As shown, it includes:
[0119] The acquisition module 71 acquires information about the target space for the fire escape route to be determined. The information about the target space includes at least one designated starting position and at least one designated exit position located within the target space.
[0120] The acquisition module 72 acquires information on the distribution of indoor obstacles in the target space in real time.
[0121] Processing module 73 performs grid-based labeling processing on the target space based on the indoor obstacle distribution information. Each grid space of the target space after grid-based labeling has a passability feature value, which indicates whether the corresponding grid space is in a passable state.
[0122] The determination module 74 determines a fire escape route from the target specified starting position to any of the specified exit positions based on the target space marked by grids, wherein the target specified starting position is any one of the at least one specified starting position, and any grid space through which the fire escape route passes is in a passable state.
[0123] The apparatus provided in this application first acquires information about the target space from which the fire escape route needs to be determined. This information includes at least one designated starting position and at least one designated exit position within the target space. This target space information indicates the starting and ending points of the fire escape route. Then, real-time data on the distribution of indoor obstacles within the target space is collected. This information indicates which areas within the target space are passable, providing an information basis for determining the fire escape route in subsequent steps. Next, the target space is gridded based on the indoor obstacle distribution information. Each grid space in the gridded target space has a passability feature value, which indicates whether the corresponding grid space is passable. Gridding transforms the target space into a grid space that facilitates the generation of escape routes, visually expressing the passability of each grid space in the form of feature values. Subsequently, based on the gridded target space, a fire escape route from the designated starting position to any designated exit position is determined. The designated starting position is any one of at least one designated starting position, and all grid spaces along the fire escape route are passable. Because the indoor obstacle distribution information is collected in real time in this solution, the determined fire escape routes are passable in real time, which effectively improves the safety of determining fire escape routes. Specifically, the target space is gridded, which efficiently divides the target space into easily manageable grids. The feature values of the grid spaces facilitate subsequent efficient identification of whether the grid spaces are passable, thereby improving the efficiency of determining fire escape routes.
[0124] In this application, the modules in the apparatus provided can also implement the method steps provided in the method embodiments. Alternatively, the apparatus provided in this application may include other modules besides those described above to implement the method steps provided in the method embodiments. Furthermore, the apparatus provided in this application can achieve the technical effects achievable by the method embodiments.
[0125] To address the problems existing in related technologies, this application also provides a fire emergency lighting fixture for real-time determination of fire escape routes, such as... Figure 8 As shown, it is used for:
[0126] S81: Obtain information about the target space of the fire escape route to be determined, the information of the target space including the target designated starting position of the fire emergency lighting fixture located in the target space and at least one designated exit position;
[0127] S82: Obtain the indoor obstacle distribution information of the target space collected in real time by the environmental sensors;
[0128] S83: Perform grid-based labeling processing on the target space according to the indoor obstacle distribution information. Any grid space of the target space after grid-based labeling has a passability feature value. The passability feature value indicates whether the corresponding grid space is in a passable state.
[0129] S84: Based on the gridded target space, determine a fire escape route from the specified starting position of the target to any of the specified exit positions, wherein any grid space through which the fire escape route passes is passable.
[0130] S85: Show the described fire escape route.
[0131] In this embodiment, steps S81 to S84 can be executed according to any embodiment of the method for determining fire escape routes in real time. After determining the fire escape route, this solution displays the fire escape route using emergency lighting. Specifically, the emergency lighting can be a light fixture with a display function, which can visually attract the attention of people in the target space by changing the color of the light, thereby displaying the fire escape route and efficiently guiding people to escape.
[0132] Optionally, the aforementioned fire emergency lights can also be equipped with voice functionality, providing alerts through audible warnings and indicating fire escape routes through voice announcements. Additionally, microphones can be included to facilitate temporary voice communication among people within the target area.
[0133] The solution provided in this application allows fire emergency lighting fixtures to efficiently determine fire escape routes based on their designated starting position within a target area. By displaying these routes, safe escape paths are shown to nearby personnel, enabling them to quickly evacuate from the location of the fire emergency lighting fixture to the designated exit. The starting point of the fire escape route is the location of the fire emergency lighting fixture itself. When people in the target space see the fire escape route, they can clearly understand the escape path starting from their own location, facilitating a quick understanding of the passable route between themselves and the designated exit, thus enabling them to escape as soon as possible.
[0134] To address the problems existing in related technologies, embodiments of this application also provide a system for real-time determination of fire escape routes, such as... Figure 9 As shown, it includes:
[0135] The fire emergency lighting fixture 91, which determines the fire escape route in real time, as described in the above embodiments;
[0136] At least one environmental sensor 92 is communicatively connected to the fire emergency lighting fixture that determines the fire escape route in real time, for collecting indoor obstacle distribution information of the target space in real time and providing it to the fire emergency lighting fixture that determines the fire escape route in real time.
[0137] Figure 9 The diagram illustrates a scenario where fire emergency lighting fixtures and environmental sensors are installed in a target space. The fire emergency lighting fixtures are located within a circular grid space, while the designated exit points are located within a triangular grid space. In this system, the fire emergency lighting fixtures display their determined fire escape routes at the circular locations within the target space. One or more environmental sensors are installed in the target space, with each sensor used to detect the distribution of indoor obstacles.
[0138] The system provided in this application embodiment enables fire emergency lighting fixtures located in a target space to determine a fire escape route starting from their own position and ending at a designated exit. Furthermore, by displaying this fire escape route, personnel within the target space can quickly determine how to reach the designated exit based on the fire escape route displayed by the fire emergency lighting fixtures, thereby improving escape safety.
[0139] Based on the system provided in the above embodiments, optionally, the environmental sensor includes a fire sensor, which is set in the grid space of the target space, wherein the grid space is obtained by dividing the target space based on a preset gridding rule.
[0140] See Figure 9 The scene diagram shown illustrates that the environmental sensor in this application example includes a fire sensor, which can be set in a grid in the target space.
[0141] Optionally, any fire sensor can acquire information about the fire situation in its own grid space to determine the distribution of indoor obstacles within that grid space. The information detected by the fire sensor can be used to determine the accessibility of the grid space in which the fire sensor is located, providing a data foundation for subsequently determining safe and reliable fire escape routes.
[0142] exist Figure 9 Only environmental sensors distributed across three spatial grids are shown in the diagram. It should be understood that other spatial grids in the target space may also be equipped with their own environmental sensors to detect the accessibility of each spatial grid.
[0143] Optionally, environmental sensors do not need to be installed in the grid space containing the buildings in the target space. Assuming the building structure remains unchanged, the grid space containing these buildings will inevitably be impassable.
[0144] Optionally, in practical applications, environmental sensors in the spatial grid can also be used to assist in monitoring adjacent grid spaces, thereby improving the accuracy of the acquired indoor obstacle distribution information and avoiding the situation where a small number of environmental sensors are damaged, resulting in the inability to monitor the indoor obstacle distribution information.
[0145] Preferably, this application embodiment also provides an electronic device, including a processor, a memory, and a computer program stored in the memory and executable on the processor. When the computer program is executed by the processor, it implements the various processes of the above-described method embodiment for determining fire escape routes in real time, and can achieve the same technical effect. To avoid repetition, it will not be described again here.
[0146] This application also provides a computer-readable storage medium storing a computer program. When executed by a processor, this computer program implements the various processes of the above-described method embodiment for real-time determination of fire escape routes, achieving the same technical effects. To avoid repetition, it will not be described again here. The computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
[0147] This application also provides a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program. The computer program is operable to cause a computer to perform some or all of the steps of the above-described method embodiment for determining fire escape routes in real time, and can achieve the same technical effect. To avoid repetition, it will not be described again here.
[0148] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0149] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more flowchart illustrations and / or one or more block diagrams.
[0150] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.
[0151] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.
[0152] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0153] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.
[0154] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.
[0155] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.
[0156] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0157] The above description is merely an embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principle of this application should be included within the scope of the claims of this application.
Claims
1. A method for determining fire escape routes in real time, characterized in that, include: Obtain information about the target space for determining the fire escape route, wherein the information about the target space includes at least one designated starting position and at least one designated exit position located within the target space; Real-time acquisition of indoor obstacle distribution information in the target space; The target space is marked with a grid based on the indoor obstacle distribution information. Each grid space of the target space marked with a grid has a passability feature value, which indicates whether the corresponding grid space is passable. Based on the gridded target space, a fire escape route is determined from the target designated starting position to any of the designated exit positions, wherein the target designated starting position is any one of the at least one designated starting position, and any grid space along the path of the fire escape route is in a passable state.
2. The method as described in claim 1, characterized in that, The target space is subjected to grid-based labeling processing based on the indoor obstacle distribution information, including: Based on the indoor obstacle distribution information, it is determined whether multiple grid spaces are in a passable state, wherein the multiple grid spaces are obtained by dividing the target space based on preset gridding rules; Generate a matrix corresponding to the target space, wherein the elements in the matrix correspond to the grid spaces in the target space, and the values of the elements represent whether the corresponding grid spaces are in a passable state.
3. The method as described in claim 2, characterized in that, Based on the gridded target space, a fire escape route is determined from the specified starting position of the target to any of the specified exit positions, including: Multiple candidate fire escape routes are determined based on a heuristic search algorithm, starting from a specified target location and ending at each specified exit location. The shortest candidate fire escape route is determined as the fire escape route corresponding to the specified starting position of the target.
4. The method as described in claim 3, characterized in that, The number of specified starting positions is multiple; After determining the shortest candidate fire escape route as the fire escape route corresponding to the designated starting position of the target, the process also includes: A common grid space is determined based on the fire escape routes corresponding to multiple specified starting positions. The common grid space is the grid space that all the fire escape routes corresponding to the multiple specified starting positions pass through. The public fire escape route of the target space is determined based on the fire escape routes of the public grid space described above.
5. The method as described in claim 1, characterized in that, The at least one designated starting position is the location of the fire emergency lighting fixtures within the target space.
6. The method as described in claim 1, characterized in that, The target space, marked with a grid, includes multiple sets of grid spaces located on different floors; The process of determining a fire escape route from a designated starting position to any of the designated exit positions based on the gridded target space includes: Based on a set of grid spaces on the target floor where the specified starting position of the target is located, determine the fire escape route of the target floor from the specified starting position of the target to any specified exit position on the target floor; Based on the fire escape routes of each floor between the target floor and the designated escape floor, a multi-floor fire escape route is determined from the designated starting position of the target floor to any designated exit position of the designated escape floor.
7. The method according to any one of claims 1 to 6, characterized in that, After determining the fire escape route from the specified starting position to any of the specified exit positions based on the gridded target space, the method further includes: Show the fire escape routes; and / or, Send the fire escape route to the display terminal to instruct the display terminal to display the fire escape route.
8. A fire emergency lighting fixture for real-time determination of fire escape routes, characterized in that, Used for: Obtain information about the target space for determining the fire escape route, including the target space information such as the designated starting position of the fire emergency lighting fixture located in the target space and at least one designated exit position; Acquire indoor obstacle distribution information of the target space in real time from environmental sensors; The target space is marked with a grid based on the indoor obstacle distribution information. Each grid space of the target space marked with a grid has a passability feature value, which indicates whether the corresponding grid space is passable. Based on the gridded target space, a fire escape route is determined from the specified starting position of the target to any specified exit position, wherein any grid space through which the fire escape route passes is in a passable state. The fire escape route is shown.
9. A system for determining fire escape routes in real time, characterized in that, include: The fire emergency lighting fixture for real-time determination of fire escape routes as described in claim 8; At least one environmental sensor is communicatively connected to the fire emergency lighting fixture that determines fire escape routes in real time, for collecting indoor obstacle distribution information of the target space in real time and providing it to the fire emergency lighting fixture that determines fire escape routes in real time.
10. The system as described in claim 9, characterized in that, The environmental sensor includes a fire sensor, which is set in a grid space of the target space, wherein the grid space is obtained by dividing the target space based on a preset gridding rule.
11. An electronic device, characterized in that, include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the method as described in any one of claims 1 to 7.
12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the method as described in any one of claims 1 to 7.
13. A computer program product, characterized in that, The computer program product includes a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of the method as described in any one of claims 1 to 7.