Recommended methods, electronic equipment, and storage media for fire emergency routes in outdoor parks

Abstract

This application discloses a method, electronic device, and storage medium for recommending fire emergency routes in outdoor parks, relating to the field of fire emergency management technology. The method includes: determining target areas within the park based on fire location and park wind direction information; assigning second intersection numbers to each intersection in each target area; performing route planning based on the fire location, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersections to obtain at least one candidate fire passage route and one candidate personnel escape route; and performing path conflict detection processing based on the second intersection numbers, using the first set of intermediate nodes for each candidate fire passage route and the second set of intermediate nodes for each candidate personnel escape route, to determine the target fire passage route and target personnel escape route with low conflict levels to be recommended. This provides a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management.

Description

Technical Field

[0001] The present invention relates to the technical field of fire emergency management, and in particular to a fire emergency path recommendation method, electronic equipment, and storage medium for an outdoor park. Background Art

[0002] With the continuous development of science and technology, industry, and the continuous improvement of living standards, large industrial parks, science and technology parks, large building materials market parks, and amusement parks are also increasing. The fire safety management of such large outdoor parks is also facing increasingly severe challenges. When such large outdoor parks encounter fire hazards, people in the park need to be evacuated to ensure the safety of people's lives. At the same time, fire emergency vehicles need to be guided into the dangerous situation to control the development of the dangerous situation from the source.

[0003] At present, evacuation command and guidance are mainly carried out manually. When a fire occurs in a park, the complex outdoor environment will cause the danger to develop and spread rapidly. Therefore, evacuating the crowd and guiding the fire emergency vehicle to enter the site need to be completed in a short time. When the pre-planned emergency plan cannot be used, the park managers need to re-plan the safe escape route according to the on-site situation; this requires the park managers to be very familiar with the park and have considerable experience in dealing with dangerous situations. In a panic, it is difficult for general park managers to plan a safe escape route in a very short time. In addition, in a panic, limited manpower is difficult to take care of every escapee. The escapee is prone to make wrong judgments and panic, which may lead to new safety hazards, such as: causing congestion in safety passages, fire passages, and access roads, trampling of people, slow evacuation of people, occupying fire driving passages, etc. When the escape route of people conflicts with the fire access route, it will aggravate the congestion of the access road, making it difficult for fire trucks to enter the site in time to carry out further fire rescue work, and the time for fire rescue work to be carried out will be delayed, which will easily lead to further expansion of the danger. Therefore, how to quickly and reliably recommend escape routes and fire passage routes with low conflict levels to park managers in order to improve the efficiency of fire emergency management is an urgent problem to be solved. Summary of the invention

[0004] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention proposes a fire emergency path recommendation method, electronic device, and storage medium for an outdoor park, which can quickly and automatically plan and recommend escape paths and fire passage paths with low conflict when a fire occurs in an outdoor park, providing a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management.

[0005] In a first aspect, an embodiment of the present application provides a method for recommending a fire emergency path for an outdoor park, the method comprising:

[0006] Determine the target area within the park based on the fire point and the park wind direction information, and mark the second intersection number for each intersection in each target area;

[0007] Performing path planning based on the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate firefighting path and a candidate escape path for personnel;

[0008] According to the first intermediate node set of each of the candidate fire passage paths and the second intermediate node set of each of the candidate escape paths, path conflict detection processing is performed based on the second intersection number to determine the recommended target fire passage path and target escape path with a small degree of conflict; wherein the path conflict detection processing includes: based on the second intersection number, the first route area number determined from the first intermediate node set and the second route area number determined from the second intermediate node set are binary-encoded respectively, and based on the obtained first route area code and the second route area code, a first XOR operation result is obtained by performing a bit-by-bit XOR operation and a decimal conversion; in the route area determined to overlap according to the first XOR operation result, the first route node number determined from the first intermediate node set and the second route node number determined from the second intermediate node set are binary-encoded, bit-by-bit XORed and decimal-converted, and the number of path conflict nodes is determined according to the obtained second XOR operation result.

[0009] In a second aspect, an embodiment of the present application provides an electronic device comprising at least one control processor and a memory for communicating with the at least one control processor; the memory stores instructions executable by the at least one control processor, and the instructions are executed by the at least one control processor so that the at least one control processor can execute the fire emergency path recommendation method for an outdoor park as described in any one of the embodiments of the first aspect.

[0010] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the fire emergency route recommendation method for an outdoor park as described in any one of the embodiments of the first aspect.

[0011] The embodiments of the present application include: in the event of a fire in an outdoor park, first, a target area is determined within the park based on the fire point and the park wind direction information, and a second intersection number is identified for each intersection in each target area; then, path planning is performed based on the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate fire passage path and a candidate escape path for personnel; finally, path conflict detection processing is performed based on the second intersection number based on the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path for personnel, to determine the target fire passage path and the target escape path for personnel with a small degree of conflict to be recommended ; Wherein, the path conflict detection process includes: based on the second intersection number, the first route area number determined from the first intermediate node set and the second route area number determined from the second intermediate node set are binary-coded respectively, and the first route area code and the second route area code are bit-by-bit XORed and converted to decimal to obtain the first XOR result; in the route area determined to overlap according to the first XOR result, the first route node number determined from the first intermediate node set and the second route node number determined from the second intermediate node set are binary-coded, bit-by-bit XORed and converted to decimal in sequence, and the number of path conflict nodes is determined according to the second XOR result. Thus, when a fire occurs in an outdoor park, escape routes and fire passage routes with a small degree of conflict can be quickly and automatically planned and recommended; reliable references are provided in fire emergency management to facilitate park managers to make decisions, thereby improving the efficiency of fire emergency management. That is to say, this application can quickly and automatically plan and recommend escape routes and fire passage routes with low conflict levels when a fire occurs in an outdoor park, providing a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 It is a schematic diagram of the system architecture of a park monitoring system provided by an embodiment of the present application;

[0013] Figure 2 This is a schematic diagram of the steps of a method for recommending a fire emergency path for an outdoor park provided by an embodiment of the present application;

[0014] Figure 3 It is a schematic diagram of an outdoor park divided into regions and marked with region numbers and first intersection numbers provided by an embodiment of the present application;

[0015] Figure 4 It is a schematic diagram of a target area marked with a second intersection number when the park wind direction information is southeast wind, provided by an embodiment of the present application;

[0016] Figure 5 This is an embodiment of the present application. Figure 1 Specific step diagram of step S130;

[0017] Figure 6 This is an embodiment of the present application. Figure 5 Specific step diagram of step S133;

[0018] Figure 7 This is a specific flowchart of binary encoding and path conflict detection processing provided by an embodiment of the present application;

[0019] Figure 8 It is a schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0020] In order to make the objectives, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments.

[0021] It should be understood that in the description of the present application, the orientation descriptions, such as up, down, front, back, left, right, etc., indicating orientations or positional relationships, are based on the orientations or positional relationships shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.

[0022] It should be noted that although a logical order is shown in the flowchart in the description of the present application, in some cases, the steps shown or described may be performed in an order different from that in the flowchart. In the description of the present application, a number of means one or more, and a plurality of means two or more. The description of "first" and "second" is only used for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0023] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0024] The present application provides a fire emergency path recommendation method for an outdoor park, an electronic device, and a computer-readable storage medium, and relates to the technical field of fire emergency management. The method includes: determining a target area within the park based on the fire point and the park wind direction information, and marking a second intersection number for each intersection in each target area; performing path planning based on the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate fire passage path and candidate personnel escape path; performing path conflict detection processing based on the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate personnel escape path based on the second intersection number to determine the fire passage target path and the personnel escape target path with a small degree of conflict to be recommended; it can provide a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management.

[0025] The embodiments of the present application are further described below in conjunction with the accompanying drawings.

[0026] like Figure 1 As shown, a park monitoring system provided by an embodiment of the present application includes: a controller, a smoke alarm electrically connected to the controller, a wind measuring instrument, a park entrance monitor, an intersection monitor, and a display unit.

[0027] Among them, smoke alarms are installed in places where fire is prone to occur within the park, such as buildings, large facilities and equipment. The smoke alarm is used to send a smoke alarm signal to the controller when smoke is detected to notify the park management personnel of a fire within the park.

[0028] Wind measuring instruments are set up around the outdoor park to collect and record the actual park wind direction in the area where the outdoor park is located in real time and report it to the controller.

[0029] The park entrance monitor is set at the park entrance, and is used to monitor and shoot the park entrance in real time, collect park entrance images, and upload the park entrance images to the controller, so that the controller can determine the entrance traffic flow according to the park entrance images. It is understandable that each park entrance is equipped with at least one park entrance monitor. An appropriate number of park entrance monitors can be selected for installation and configuration according to the number of park entrances of the outdoor park.

[0030] The intersection monitor is set at the intersection of the park road. The intersection refers to the exits at both ends of a road, the intersection of multiple roads, the fork on the road, the right-angle turn of a road, the intersection of a straight road and a turning road, etc. The intersection monitor is used to monitor and shoot real-time intersections and roads, collect intersection images, and upload the intersection images to the controller so that the controller can determine the traffic flow at the intersection based on the intersection images. It is understandable that each intersection is equipped with at least one intersection monitor. The appropriate number of intersection monitors can be selected for installation and configuration according to the number of intersections in the outdoor park.

[0031] The display unit is used to display the entrance monitoring screen collected by the park entrance monitor, the intersection monitoring screen collected by the intersection monitor, and the park's three-dimensional emergency path diagram, so that the park management personnel can conduct a more comprehensive supervision of the park situation.

[0032] The controller is used to execute the fire emergency path recommendation method provided in the embodiment of the present application, which can quickly and automatically plan and recommend escape paths and fire passage paths with low conflict levels when a fire occurs in an outdoor park, providing a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management.

[0033] Those skilled in the art will appreciate that the system structure shown in the figure does not constitute a limitation on the embodiments of the present application, and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.

[0034] The system embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment.

[0035] Those skilled in the art will appreciate that the system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0036] Based on the above system structure, various embodiments of the fire emergency path recommendation method for the outdoor park of the present application are proposed below.

[0037] The fire emergency path recommendation method for an outdoor park in the embodiment of the present application can be applied to Figure 1 In the controller of the park monitoring system shown in FIG. Figure 2As shown, the fire emergency route recommendation method for the outdoor park may include but is not limited to steps S110 to S130.

[0038] Step S110: Determine a target area within the park based on the fire point and the park wind direction information, and identify a second intersection number for each intersection in each target area.

[0039] Step S120: Path planning is performed according to the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate firefighting path and a candidate escape path.

[0040] Step S130: Based on the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path, path conflict detection processing is performed based on the second intersection number to determine the fire passage target path and the escape target path with a small degree of conflict to be recommended; the path conflict detection processing includes: based on the second intersection number, the first route area number determined from the first intermediate node set and the second route area number determined from the second intermediate node set are binary-encoded respectively, and based on the obtained first route area code and the second route area code, a first XOR operation result is obtained by bit-by-bit XOR operation and decimal conversion; in the route area determined to overlap according to the first XOR operation result, the first route node number determined from the first intermediate node set and the second route node number determined from the second intermediate node set are binary-encoded, bit-by-bit XOR operation and decimal conversion are performed in sequence, and then the number of path conflict nodes is determined according to the obtained second XOR operation result.

[0041] Through steps S110 to S130, in the event of a fire in an outdoor park, first, a target area is determined within the park based on the fire point and the park wind direction information, and a second intersection number is identified for each intersection in each target area; then, path planning is performed based on the fire point, at least one target entrance determined based on the traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate fire passage path and a candidate escape path for personnel; finally, path conflict detection processing is performed based on the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path for personnel based on the second intersection number to determine the target fire passage path and the candidate escape path for personnel with a small degree of conflict to be recommended. Target path; wherein, the path conflict detection process includes: based on the second intersection number, the first route area number determined from the first intermediate node set and the second route area number determined from the second intermediate node set are binary-encoded respectively, and the first route area code and the second route area code are bit-by-bit XORed and converted to decimal to obtain the first XOR result, and in the route area determined to overlap according to the first XOR result, the first route node number determined from the first intermediate node set and the second route node number determined from the second intermediate node set are binary-encoded, bit-by-bit XORed and converted to decimal in sequence, and the number of path conflict nodes is determined according to the obtained second XOR result. Thus, when a fire occurs in an outdoor park, escape routes and fire passage routes with a small degree of conflict can be quickly and automatically planned and recommended; reliable references can be provided in fire emergency management to facilitate park managers to make decisions, thereby improving the efficiency of fire emergency management. Therefore, the present application can quickly and automatically plan and recommend escape routes and fire passage routes with a small degree of conflict when a fire occurs in an outdoor park, provide a reliable reference for fire emergency management, and thus improve the efficiency of fire emergency management.

[0042] In one embodiment, step S110 is further described. Step S110 includes but is not limited to steps S111 to S114 .

[0043] Step S111: determine the fire point within the park range, and divide the park range into eight non-overlapping candidate areas based on a two-dimensional rectangular coordinate system established with the fire point as the origin.

[0044] Step S112: a different area number is identified for each candidate area, and a different first intersection number is identified for each intersection within the park.

[0045] Step S113: determining a plurality of target areas from the candidate areas according to the acquired park wind direction information.

[0046] Step S114: renumbering each intersection in each target area according to the area number and the first intersection number, and identifying a second intersection number.

[0047] To further illustrate step S111, the specific process of determining the fire point within the park is: responding to the smoke alarm signal emitted by the smoke alarm; determining the coordinate position information of the smoke alarm from the smoke alarm signal; and determining the coordinate position information as the fire point. The specific process of dividing the park into eight candidate areas is: establishing a two-dimensional rectangular coordinate system with the fire point as the origin, dividing the entire park into four quadrants; rotating the two-dimensional rectangular coordinate system 45 degrees clockwise or clockwise, dividing each quadrant into two candidate areas, and obtaining eight non-overlapping candidate areas such as Figure 3 Step S110 determines eight candidate areas in the park range of the fire point and the outdoor park, laying a data foundation for subsequent processing.

[0048] To further explain step S112, in one embodiment, different English letters are used as region numbers to identify eight candidate regions one by one, such as Figure 3 Area A to Area H shown; using non-repeating Arabic numerals as the first intersection number to identify different intersections one by one, such as Figure 3 The intersection 1, intersection 2, etc. are shown. By identifying the candidate areas and intersections, it is easy to find the corresponding areas by number, which is convenient for management. Figure 3 and Figure 4 In the figure, hollow dots represent intersections, solid dots represent fire points, dotted lines are area dividing lines, and solid lines are roads in the park.

[0049] Specifically, the park wind direction information in step S113 is determined by the actual park wind direction detected by the wind measuring instrument. The actual park wind direction refers to the wind direction in the field of meteorological monitoring, and the meteorological wind direction indicates the direction from which the wind blows. The park wind direction information includes: east wind, south wind, west wind, north wind, northeast wind, southeast wind, southwest wind, northwest wind, northwest by north wind, northwest by west wind, southeast by south wind, southeast by east wind, southwest by west wind, southwest by south wind, northeast by east wind, northeast by north wind.

[0050] Specifically, step S113 includes the following situations.

[0051] When the wind direction information of the park is southeast wind, the two candidate areas (Area A and B) on both sides of the northwest axis are discarded, and the remaining six candidate areas (Area C, Area D, Area E, Area F, Area G, and Area H) are determined as target areas, such as Figure 4As shown. When the park wind direction information is southwest wind, the two candidate areas (area C and area D) on both sides of the northeast axis are discarded, and the remaining six candidate areas are determined as target areas. When the park wind direction information is northwest wind; the two candidate areas (area E and area F) on both sides of the southeast axis are discarded, and the remaining six candidate areas are determined as target areas. When the park wind direction information is northeast wind, the two candidate areas (area G and area H) on both sides of the southwest axis are discarded, and the remaining six candidate areas are determined as target areas.

[0052] When the wind direction information of the park is east wind, the two candidate areas (i.e., area A and area H) on both sides of the axis in the west direction are discarded, and the remaining six candidate areas are determined as target areas. When the wind direction information of the park is south wind, the two candidate areas (area B and area C) on both sides of the axis in the north direction are discarded, and the remaining six candidate areas are determined as target areas. When the wind direction information of the park is westerly, the two candidate areas (area D and area E) on both sides of the axis in the east direction are discarded, and the remaining six candidate areas are determined as target areas. When the wind direction information of the park is north wind, the two candidate areas (area G and area F) on both sides of the axis in the south direction are discarded, and the remaining six candidate areas are determined as target areas.

[0053] When the wind direction information of the park is northwest by north wind, a candidate area (area F) located in the south of the southeast axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is northwest by west wind, a candidate area (area E) located in the east of the southeast axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is southeast by south wind, a candidate area (area B) located in the north of the northwest axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is southeast by east wind, a candidate area (area A) located in the west of the northwest axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is southwest by west wind, a candidate area (area D) located in the east of the northeast axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is southwest by south wind, a candidate area (area C) located in the north of the northeast axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is northeast by east wind, a candidate area (area H) located west of the southwest axis is discarded, and the remaining seven candidate areas are determined as target areas. When the wind direction information of the park is northeast by north wind, a candidate area (area G) located south of the southwest axis is discarded, and the remaining seven candidate areas are determined as target areas.

[0054] It is understandable that when a fire occurs in an outdoor park, the wind may blow the burning combustibles to other places, causing obstacles to the escape of personnel and the passage of fire trucks; the wind also affects the direction of the fire spread, the flow direction and speed of the smoke and harmful gases generated by the combustion, making the coverage of the smoke and harmful gases larger, causing difficulties for the evacuation of personnel and fire rescue. Therefore, the embodiment of the present application uses the wind direction information of the park to predict the diffusion direction of the fire, smoke, and harmful gases through step S113, thereby eliminating the candidate areas in the diffusion direction of the fire, smoke, and harmful gases, and determining multiple target areas that will be used to plan candidate escape paths for personnel and candidate fire passage paths; laying the foundation for subsequent path planning processing.

[0055] In step S114, each intersection in each target area is renumbered according to the area number and the first intersection number to generate a second intersection number. Specifically, the second intersection number includes: the area number and the first intersection number; thereby indicating the area where the intersection is located. Figure 4 As shown, a new second intersection number C19 is generated for the intersection with the first intersection number 19. Then, the corresponding intersection is identified by the second intersection number, which lays the foundation for the subsequent selection of candidate nodes and path conflict detection; and the intersections not identified with the second intersection number are no longer selected to participate in the subsequent processing. Therefore, by identifying the second intersection number, it is avoided that the intersections in the non-target area are mistakenly classified as candidate nodes.

[0056] In some embodiments, the traffic flow information includes: the entrance traffic flow of each park entrance and the intersection traffic flow. Before performing step S120: "According to the fire point, at least one target entrance determined based on the traffic flow information, and multiple candidate nodes determined from the intersection, path planning is performed to obtain at least one candidate path for fire travel and candidate path for personnel escape", the fire emergency path recommendation method for the outdoor park also includes but is not limited to step S210.

[0057] Step S210: determining at least one target entrance from the park entrances according to the entrance traffic flow of each park entrance, and determining a plurality of candidate nodes from the intersections marked with the second intersection number according to the intersection traffic flow of each intersection.

[0058] In some embodiments, step S210 is further described to include but not limited to steps S211 to S214.

[0059] Step S211: When the smoke alarm signal is issued, the park entrance image is acquired through the park entrance monitor, and the intersection image is acquired through the intersection monitor.

[0060] Step S212: performing a first image recognition process on the park entrance image to determine the entrance traffic flow; performing a second image recognition process on the intersection image to determine the intersection traffic flow.

[0061] Step S213: Determine at least one target entrance from the park entrances according to a first comparison result between the entrance traffic flow and a first preset threshold.

[0062] Step S214: determining a plurality of candidate nodes from the intersection according to a second comparison result between the traffic flow at the intersection and the second preset threshold.

[0063] Specifically, the first image recognition process includes: preprocessing the park entrance image to obtain a preprocessed park entrance image. Identifying vehicles and pedestrians in the preprocessed park entrance image to obtain the number of vehicles and pedestrians. Determining the traffic congestion score based on the number of vehicles, for example, if the number of vehicles is 5, the traffic congestion score is 5 points. Determining the pedestrian congestion score based on the number of pedestrians, for example, if the number of pedestrians is 30, the pedestrian congestion score is 30 points. Using a preset calculation formula, based on the preset first weight coefficient W1 and second weight coefficient W2 whose sum is 1, the traffic congestion score S1, and the pedestrian congestion score S2, the entrance traffic flow Q1 is calculated. Among them, the preset calculation formula is: Q1=W1*S1+W2*S2; specifically, the first weight coefficient is 0.6, and the second weight coefficient is 0.4.

[0064] It can be understood that, compared with the first image recognition processing, the second image recognition processing has the same specific process as the first image recognition processing except for the different processing objects, and will not be described in detail here.

[0065] It is understandable that the first preset threshold and the second preset threshold can be set based on experience, and no specific limitation is made here.

[0066] Specifically, step S213 includes: determining all park entrances with entrance traffic flow less than or equal to the first preset threshold as target entrances; when the number of entrances with entrance traffic flow less than or equal to the first preset threshold is 0, determining the entrance with the smallest entrance traffic flow as the target entrance.

[0067] Specifically, step S214: determine all intersections whose traffic flow is less than or equal to the second preset threshold as candidate nodes; when the number of intersections whose traffic flow is less than or equal to the second preset threshold is 0, sort the intersections from small to large according to the traffic flow, and select the intersections in the front half as candidate nodes.

[0068] Through steps S211 to S214, at least one target entrance and multiple candidate nodes are determined, laying a data foundation for subsequent path planning.

[0069] According to some embodiments of the present application, step S120 is further described, and step S120 includes but is not limited to steps S121 to S122.

[0070] Step S121: With the target entrance as the first starting point and the fire point as the first end point, a first path planning process is performed according to the candidate nodes to obtain at least one candidate fire travel path with a total traffic flow less than a preset traffic flow threshold; wherein each candidate fire travel path includes: a first intermediate node set, a first starting point and a first end point.

[0071] Step S122: At the same time, taking the fire point as the second starting point and the target entrance as the second end point, a second path planning process is performed according to the candidate nodes to obtain at least one candidate escape path for personnel whose total path length is less than a preset length threshold; wherein each candidate escape path for personnel includes: a second intermediate node set, a second starting point and a second end point.

[0072] Specifically, step S121: taking the target entrance as the first starting point and the fire point as the first end point, path planning is performed according to the candidate nodes to obtain all passable first candidate paths; then, the total traffic flow of the first candidate path is obtained by summing up the intersection traffic flow and the entrance traffic flow of the candidate nodes on the first candidate path, and the first candidate path with a total traffic flow less than a preset traffic flow threshold is determined as a fire passage candidate path.

[0073] Specifically, step S122: taking the fire point as the second starting point and the target entrance as the second end point, performing path planning according to the candidate nodes to obtain all passable second candidate paths; then, according to the length of the road section determined by the two intersections and passed recorded in the database, the total path length of the second candidate path is counted, and the second candidate path whose total path length is less than the preset length threshold is determined as the candidate path for personnel escape.

[0074] Specifically, the first intermediate node set of candidate fire-fighting paths is recorded as N1, for example, N1={E6, E5}; the second intermediate node set of candidate escape paths is recorded as N2, for example, N2={E5, E6}. It can be understood that in the first intermediate node set and the second intermediate node set, the section between two adjacent intermediate nodes is a passable intermediate path; the order of the intermediate nodes also indicates the direction of travel of the planned path. It should be noted that actual roads may have one-way and two-way traffic restrictions, but for fire emergency considerations, this application does not consider the original road traffic restrictions in the park when planning roads, but plans candidate escape paths for personnel based on the requirements of the total path length, and plans candidate fire-fighting paths based on the requirements of the total traffic flow.

[0075] It is understandable that there are many ways to plan the intermediate path based on the determined starting point, end point, and candidate nodes, and this application will not go into details here.

[0076] It is understandable that when there is only one target entrance, a candidate fire passage path and a candidate escape path are planned between the fire point and the only target entrance. When there are multiple target entrances, a candidate fire passage path and a candidate escape path are planned between the fire point and each target entrance.

[0077] Through steps S121 to S122, a candidate fire-fighting route with a total traffic flow less than a preset traffic flow threshold is obtained, so as to ensure that the fire truck can reach the fire point smoothly and quickly to carry out rescue work; the route with a total path length less than a preset length threshold is determined as a candidate escape route for personnel, so as to ensure that personnel can leave the park in a shorter distance, thereby ensuring personnel safety to a certain extent.

[0078] According to some embodiments of the present application, Figure 5 As shown, step S130 is further described, especially the path conflict detection process performed between the candidate fire passage path and the candidate escape path. Among them, according to the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path, the path conflict detection process is performed based on the second intersection number to determine the fire passage target path and the escape target path with a small conflict degree to be recommended, including but not limited to steps S131 to S135.

[0079] Step S131: Calculate the total traffic flow of each candidate fire-fighting path, sort the candidate fire-fighting paths in ascending order of the total traffic flow, and obtain sorted candidate fire-fighting paths.

[0080] Step S132: Determine a candidate firefighting passage path to be tested in order from the sorted candidate firefighting passage paths.

[0081] Step S133: Perform binary coding processing and path conflict detection processing based on the second intersection number between the first intermediate node set and each second intermediate node set of the candidate fire passage path to be tested, and obtain the number of path conflict nodes between the first intermediate node set and each second intermediate node set.

[0082] Step S134: Continue to obtain the first intermediate node set of the next candidate fire passage path to be tested for binary encoding processing and path conflict detection processing until all candidate fire passage paths are detected, and the number of path conflict nodes of each first intermediate node set and each second intermediate node set is obtained.

[0083] Step S135: compare the number of all path conflict nodes with the preset number threshold one by one, and determine a pair of fire escape candidate paths and personnel escape candidate paths whose number of path conflict nodes is less than the preset number threshold as a pair of fire escape target paths and personnel escape target paths with a small degree of conflict.

[0084] Specifically, in step S131, the total traffic flow of the candidate fire path is obtained by summing up the intersection traffic flow and entrance traffic flow of the intermediate nodes (that is, the candidate nodes) on the candidate fire path; the candidate fire paths are sorted in order from small to large according to the total traffic flow, so that the candidate fire paths can be traversed in an orderly manner for path collision detection later.

[0085] It can be understood that through steps S134 to S135, when all the candidate fire passage paths are traversed, the number of path conflict nodes between the first intermediate node of each candidate fire passage path and the second intermediate node set of each candidate escape path can be obtained; after comparing the number of all path conflict nodes with the preset number threshold, at least one pair of fire passage target paths and personnel escape target paths with a small degree of conflict can be determined.

[0086] It should be emphasized that, regardless of the starting point and the end point, when the number of path conflict nodes is 0, it means that the nodes passed by the fire escape target path and the personnel escape target path do not overlap at all, and there is no conflict. The smaller the number of path conflict nodes, the smaller the degree of conflict.

[0087] Through steps S131 to S135, a firefighting target path and a personnel escape target path with a small degree of conflict can be obtained, providing a reliable reference for fire emergency management, thereby improving the efficiency of fire emergency management.

[0088] According to some embodiments of the present application, Figure 6 As shown, step S133 includes but is not limited to steps 301 to S306.

[0089] Step S301: According to the second intersection number of each intermediate node in the first intermediate node set, at least one first route area number is statistically determined.

[0090] Step S302: According to the second intersection number of each intermediate node in the second intermediate node set, at least one second route area number is statistically determined.

[0091] Step S303: Binary-encode each first route area number and each second route area number respectively, convert the first route area number into the first route area code, and convert the second route area number into the second route area code.

[0092] Step S304: performing bit-by-bit XOR operation and decimal conversion processing on the first-path region code and the second-path region code to obtain a first XOR operation result between each first-path region code and each second-path region code.

[0093] Step S305: determining the overlap of the path areas of the first intermediate node set and the second intermediate node set according to the first XOR operation results.

[0094] Step S306: When the route area overlaps, the number of path conflict nodes is determined to be 0.

[0095] It can be understood that the first intermediate node set includes at least one intermediate node, and the second intermediate node set includes at least one intermediate node; and each intermediate node is marked with a second intersection number. Specifically, the first route area number refers to: the area number of the second intersection number of the intermediate node of the first intermediate node set; the second route area number refers to: the area number of the second intersection number of the intermediate node of the second intermediate node set.

[0096] The first route area code and the second route area code are obtained through step S303, so as to facilitate the subsequent verification of route area overlap based on the first route area code and the second route area code; when it is determined that there is no overlapping route area, node conflict detection for intermediate nodes will no longer be continued to reduce the overall time consumption of path planning processing.

[0097] Example 1: When the first route area number includes: E and F; the process of binary conversion of the first route area number is specifically: according to the ASCII code table, determine that the decimal value of the letter E in the ASCII code is 69, convert the decimal value 69 into the binary code 1000101, and 1000101 is the first route area code of the first route area number E. Similarly, according to the ASCII code table, determine that the decimal value of the letter F in the ASCII code is 70, convert the decimal value 70 into the binary code 1000110, and 1000110 is the first route area code of the second route area number F.

[0098] Step S304 specifically includes: performing bit-by-bit XOR operation on the obtained first path area code and the second path area code to obtain the XOR operation value, and then performing decimal conversion processing to convert the binary XOR operation value into a decimal value, and this decimal value is the first XOR operation result. Among them, the operation rule of the bit-by-bit XOR operation is: if the two values ​​are the same, the result is 0; if the two values ​​are different, the result is 1. By adopting the bit-by-bit XOR operation and decimal conversion operation with simple operation rules and convenient operation, it is convenient to perform conflict area detection more quickly.

[0099] Example 2: When the first path area number and the second path area number to be tested are both E (1000101), a bit-by-bit XOR operation is performed: ; Then convert the binary number 0000000 to the decimal value 0; that is, the result of the first XOR operation is 0.

[0100] Example 3: When the first path area to be tested is numbered E (1000101) and the second path area to be tested is numbered F (1000110), a bitwise XOR operation is performed: ; Then convert the binary number 0000011 to the decimal value 3; that is, the result of the first XOR operation is 3.

[0101] According to some embodiments of the present application, step S305 includes but is not limited to steps S3051 to S3504.

[0102] Step S3051: When the result of the first XOR operation is 0, it is determined that the corresponding first pathway region code and the second pathway region code are the same, and it is determined that the pathway region indicated by the first pathway region code overlaps with the pathway region indicated by the second pathway region code.

[0103] Step S3052: When the first XOR operation result is not 0, it is determined that the corresponding first path region code and the second path region code are different, and it is determined that the path region indicated by the first path region code and the path region indicated by the second path region code do not overlap.

[0104] Step S3053: traverse all the first XOR operation results and count the number of overlapping areas.

[0105] Step S3054: Determine the overlap of the route areas of the first intermediate node set and the second intermediate node set according to the number of overlapping areas.

[0106] Through step S3051 to step S3052, an overlap region discrimination mechanism based on the first XOR operation result is established. Referring to Example 2 and Example 3, it can be understood that by judging whether the first XOR operation result is 0, it is determined whether the path region indicated by the first path region code and the path region indicated by the second path region code overlap; using a simple overlap region discrimination rule is conducive to quickly judging the overlap of the path regions.

[0107] When all the first XOR operation results are traversed through step S3053 to step S3054, the number of first XOR operation results equal to 0 is counted, that is, the number of area overlaps is obtained.

[0108] Specifically, the overlapping situations of the route areas include: non-overlapping route areas and overlapping route areas.

[0109] Example 4: When the number of overlapping areas is 0, it is determined that there are no overlapping areas between the candidate fire escape paths and the candidate escape paths; when the number of overlapping areas is 3 and not 0, it is determined that there are three overlapping areas between the candidate fire escape paths and the candidate escape paths.

[0110] According to some embodiments of the present application, Figure 6 As shown, after step S305, the method further includes but is not limited to steps S307 to S312.

[0111] Step S307: When the route area overlaps, the area overlap number is obtained.

[0112] Step S308: Determine the first path node number to be tested according to the area overlap number and the second intersection number of each intermediate node in the first intermediate node set.

[0113] Step S309: Determine the second path node number to be tested according to the area overlap number and the second intersection number of each intermediate node in the second intermediate node set.

[0114] Step S310: Binary-encode each first pathway node number and each second pathway node number respectively, convert the first pathway node number into the first pathway node code, and convert the second pathway node number into the second pathway node code.

[0115] Step S311: performing bit-by-bit XOR operation and decimal conversion processing on the first path node code and the second path node code to obtain a second XOR operation result between each first path node code and the second path node code.

[0116] Step S312: Determine the number of path conflicting nodes according to each second XOR operation result.

[0117] The specific process from step S307 to step S309 is: after obtaining the area overlap number of the overlapping route area, in the first intermediate node set to be tested, obtain the second intersection number of the intermediate node whose area number is the same as the area overlap number, and then determine the first intersection number in the second intersection number as the first route node number to be tested; in the second intermediate node set to be tested, obtain the second intersection number of the intermediate node whose area number is the same as the area overlap number, and then determine the first intersection number in the second intersection number as the second route node number to be tested.

[0118] Step S311 specifically includes: performing bit-by-bit XOR operation on the first path node code and the second path node code to obtain an XOR operation value, and then performing a decimal conversion process to convert the binary XOR operation value into a decimal value. By adopting a bit-by-bit XOR operation and a decimal conversion operation with simple operation rules and convenient operation, conflict node detection can be performed more quickly.

[0119] Example 5: When the region overlaps and is numbered E, the intermediate nodes in the first intermediate node set to be tested that are located in region E include: E6, E5; the two first path nodes to be tested are determined to be numbered 6 (0110) and 5 (0101); the intermediate nodes in the second intermediate node set to be tested that are located in region E include: E5, E7; the two second path nodes to be tested are determined to be numbered 5 (0101) and 7 (0111). Perform bit-by-bit XOR operation on the first path node number 5 and the second path node number 5: , convert the binary number 0000 to the decimal value 0; that is, the result of the second XOR operation is 0. Perform a bit-by-bit XOR operation on the first path node number 5 and the second path node number 7: , convert the binary number 0010 to the decimal value 2; that is, the result of the second XOR operation is 2, not 0.

[0120] According to some embodiments of the present application, step S312 includes but is not limited to steps S3121 to S3123.

[0121] Step S3121: When the result of the second XOR operation is 0, it is determined that the first pathway node code and the second pathway node code are the same, and it is determined that the intermediate nodes indicated by the first pathway node code and the second pathway node code in the overlapping pathway region conflict.

[0122] Step S3122: When the result of the second XOR operation is not 0, it is determined that the first pathway node code and the second pathway node code are different, and it is determined that the intermediate nodes indicated by the first pathway node code and the second pathway node code in the overlapping pathway area do not conflict.

[0123] Step S3123: traverse all the second XOR operation results and count the number of path conflict nodes in the overlapping path areas.

[0124] Through step S3121 and step S3122, a conflict node identification mechanism based on the second XOR operation result is established. Using a simple conflict node identification rule is conducive to quickly identifying node conflicts.

[0125] When all second XOR operation results are traversed through step S3123, the number of second XOR operation results equal to 0 is counted, that is, the number of path conflict nodes in the overlapping path area is obtained.

[0126] It should be noted that when there is no overlapping path area between a pair of candidate fire passage paths and candidate escape paths, the conflict degree is minimal; when there is an overlapping path area, the smaller the number of detected path conflict nodes, the smaller the conflict degree between the pair of candidate fire passage paths and candidate escape paths; conversely, the larger the number of path conflict nodes, the greater the conflict degree between the pair of candidate fire passage paths and candidate escape paths. When there is an overlapping path area and the number of path conflict nodes is equal to 0, it means that although the same path area is passed, the nodes in the specific path do not conflict.

[0127] Through step S3121 to step S3123, the specific number of path conflict nodes is obtained, which is used as a reliable parameter to measure the degree of conflict, thereby improving the reliability of path planning.

[0128] Combination Figure 4 and Figure 7 , take an example to illustrate the specific process of binary encoding and path conflict detection based on the second intersection number.

[0129] When the wind direction information of the park is southeast wind, the two candidate areas (area A and area B) on both sides of the northwest axis are discarded. Figure 4 The path planning process is performed in the target area shown in FIG. Figure 7 The candidate fire escape paths shown are: Q1, Q2 and Q3, and the target escape paths for personnel are: L1, L2, L3 and L4.

[0130] When performing binary coding and path conflict detection processing on the candidate fire passage path Q1 and the target escape paths: L1, L2, L3 and L4, first, determine the first path area number and the first path area code of path Q1, and determine the second path area number and the second path area code of paths L1, L2, L3 and L4. Specifically, the decimal value of the letter C in the ASCII code table is 67, which is converted to the binary code 1000011; similarly, the binary code corresponding to the letter D is 1000100, the binary code corresponding to the letter E is 1000101; the binary code corresponding to the letter F is 1000110; the binary code corresponding to the letter G is 1000111.

[0131] Secondly, based on the obtained first route area code and each second route area code, a bit-by-bit XOR operation and decimal conversion processing are performed to obtain a first XOR operation result, and based on the first XOR operation result, the area overlap number is determined to be E; and there is no overlapping route area between path Q1 and path L2, and path Q1 and path L2 are directly determined as a pair of fire travel target paths and personnel escape target paths.

[0132] Then, in the overlapping path area E, the first path node number and the first path node code of the path Q1 and the second path node numbers and the second path node codes of the paths L1, L3 and L4 are determined.

[0133] Next, based on the obtained first path node code and the second path node code, a bitwise XOR operation and a decimal conversion process are performed to obtain a second XOR operation result, and based on the second XOR operation result, it is determined that the number of path conflict nodes between path Q1 and path L1 is 2, the number of path conflict nodes between path Q1 and path L3 is 1, and the number of path conflict nodes between path Q1 and path L4 is 0.

[0134] Finally, when the preset number threshold is 2, three pairs of fire-fighting target paths and personnel escape target paths can be determined: Q1 and L2, Q1 and L3, and Q1 and L4.

[0135] pass Figure 7 From the process shown, we can also know that: the path areas of path Q1 and path L1 are completely consistent, and the intermediate nodes are completely conflicting; the path areas of path Q1 and path L2 are different, and there is no conflict at all; there is an overlapping path area between path Q1 and path L3, and there are path conflict nodes; there is an overlapping path area between path Q1 and path L3, but there are no path conflict nodes, and the degree of conflict is minimal.

[0136] It is understandable that although Figure 4 It is shown that there is still some distance between the fire point and the surrounding intersections E5 and G16, but the buildings in the actual park are generally adjacent to the roads. Therefore, the distance between the fire point and the surrounding intersections is ignored in this application; instead, the focus is on the detection and judgment of the middle path.

[0137] According to some embodiments of the present application, the fire emergency path recommendation list includes a fire passage target path and at least one corresponding personnel escape target path; then after step S130, the method provided by the embodiment of the present application further includes: performing path planning according to the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection, to obtain at least one fire passage candidate path and a personnel escape candidate path; in the initial three-dimensional schematic diagram of the park, using different colors to identify the fire passage target path and the corresponding non-conflicting personnel escape target path according to the fire emergency path recommendation list, to obtain and display the three-dimensional emergency path schematic diagram of the park; in response to the operation of selecting the fire passage target path, according to the fire emergency path recommendation list, highlighting and recommending the corresponding personnel escape target path in the three-dimensional emergency path schematic diagram of the park. This allows park managers to selectively and intuitively view the fire passage target paths and the corresponding recommended personnel escape target paths with a small degree of conflict; improving decision-making efficiency, thereby improving the efficiency of park emergency management.

[0138] like Figure 8 As shown, the present application also provides an electronic device, including:

[0139] The processor 801 may be implemented by a general-purpose central processing unit, a microprocessor, an application-specific integrated circuit, or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0140] The memory 802 may be implemented in the form of a read-only memory, a static storage device, a dynamic storage device, or a random access memory. The memory 802 may store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 802, and the processor 801 calls and executes the fire emergency path recommendation method for an outdoor park in the embodiment of this application;

[0141] Input / output interface 803, used to implement information input and output;

[0142] The communication interface 804 is used to realize the communication interaction between the present apparatus and other devices. The communication can be realized through a wired manner (such as USB, network cable, etc.) or a wireless manner (such as mobile network, WIFI, Bluetooth, etc.);

[0143] A bus 805 that transmits information between various components of the device (e.g., the processor 801, the memory 802, the input / output interface 803, and the communication interface 804);

[0144] The processor 801 , the memory 802 , the input / output interface 803 and the communication interface 804 are connected to each other in communication within the device via a bus 805 .

[0145] An embodiment of the present application also provides a storage medium, which is a computer-readable storage medium. The storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned fire emergency path recommendation method for the outdoor park is implemented.

[0146] As a non-transient computer-readable storage medium, the memory can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage devices. In some embodiments, the memory may optionally include a memory remotely arranged relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof. The device embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and are implemented to be located in one place, or may also be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment.

[0147] It will be appreciated by those skilled in the art that all or some of the steps and systems in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transient medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0148] The above is a specific description of the preferred implementation of the present application, but the present application is not limited to the above-mentioned implementation mode. Technical personnel familiar with the field can also make various equivalent deformations or substitutions without violating the spirit of the present application. These equivalent deformations or substitutions are all included in the scope defined by the present application.

Claims

1. A method for recommending fire emergency routes in an outdoor park, characterized in that: The method comprises: Determine a target area within the park based on the fire point and the park wind direction information, and identify a second intersection number for each intersection in each target area; wherein the second intersection number is generated according to the area number of the target area and the first intersection number, and the second intersection number is used to uniquely identify the intersection in the target area; Performing path planning based on the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate firefighting path and a candidate escape path for personnel; According to the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path, path conflict detection processing is performed based on the second intersection number to determine the target fire passage path and the target escape path with a small degree of conflict to be recommended; wherein the path conflict detection processing includes: based on the second intersection number, the first route area number determined from the first intermediate node set and the second route area number determined from the second intermediate node set are binary-coded respectively, and a first XOR operation result is obtained based on the obtained first route area code and the second route area code. In the route area determined to overlap according to the first XOR operation result, the first route node number determined from the first intermediate node set and the second route node number determined from the second intermediate node set are binary-coded, bit-by-bit XOR operation and decimal conversion are performed in sequence, and the number of path conflict nodes is determined according to the obtained second XOR operation result; The path conflict detection process also includes: after the first XOR operation result is obtained by performing bit-by-bit XOR operation and decimal conversion based on the obtained first path area code and the second path area code, the path area overlap situation of the first intermediate node set and the second intermediate node set is determined according to each of the first XOR operation results; wherein, when the first XOR operation result is 0, it is determined that the corresponding first path area code and the second path area code are the same, and it is determined that the path area indicated by the first path area code overlaps with the path area indicated by the second path area code; when the first XOR operation result is not 0, it is determined that the corresponding first path area code and the second path area code are not the same, and it is determined that the path area indicated by the first path area code does not overlap with the path area indicated by the second path area code; traverse all the first XOR operation results and count the number of area overlaps; determine the path area overlap situation of the first intermediate node set and the second intermediate node set according to the number of area overlaps; when the path area overlap situation is: there is no overlapping path area, it is determined that the number of path conflict nodes is 0.

2. The fire emergency route recommendation method for an outdoor park according to claim 1, characterized in that: The method of performing path conflict detection based on the first intermediate node set of each candidate fire passage path and the second intermediate node set of each candidate escape path and the second intersection number to determine a fire passage target path and a personnel escape target path with a small degree of conflict to be recommended includes: Calculating the total traffic flow of each of the candidate fire-fighting paths, and sorting the candidate fire-fighting paths in ascending order of the total traffic flow to obtain sorted candidate fire-fighting paths; Determining a candidate fire-fighting passage path to be tested in order from the sorted candidate fire-fighting passage paths; Between the first intermediate node set and each of the second intermediate node sets of the candidate fire passage path to be tested, binary encoding processing and path conflict detection processing based on the second intersection number are performed to obtain the number of path conflict nodes between the first intermediate node set and each of the second intermediate node sets; Continue to obtain the first intermediate node set of the next candidate fire passage path to be tested for binary encoding processing and path conflict detection processing, until all the candidate fire passage paths are detected, and obtain the number of path conflict nodes of each first intermediate node set and each second intermediate node set; All the numbers of the path conflict nodes are compared one by one with the preset number threshold, and a pair of the candidate fire escape paths and the candidate personnel escape paths whose number of path conflict nodes is less than the preset number threshold are determined as a pair of the target fire escape paths and the target personnel escape paths with a small degree of conflict.

3. The fire emergency route recommendation method for an outdoor park according to claim 2, characterized in that: The binary encoding process and the path conflict detection process based on the second intersection number are performed between the first intermediate node set and each of the second intermediate node sets of the candidate fire passage path to be tested to obtain the number of path conflict nodes between the first intermediate node set and each of the second intermediate node sets, including: Statistically determining at least one first route area number according to the second intersection number of each intermediate node in the first intermediate node set; Statistically determining at least one second route area number according to the second intersection number of each intermediate node in the second intermediate node set; Binary-encode each of the first route area numbers and each of the second route area numbers, convert the first route area number into a first route area code, and convert the second route area number into a second route area code; Performing bit-by-bit XOR operation and decimal conversion processing on the first path area code and the second path area code to obtain a first XOR operation result between each of the first path area code and each of the second path area code; The overlap of the route areas of the first intermediate node set and the second intermediate node set is determined according to each of the first XOR operation results.

4. The fire emergency route recommendation method for an outdoor park according to claim 3, characterized in that: After determining the overlap of the route areas of the first intermediate node set and the second intermediate node set according to the first XOR operation result, the method further includes: When the path area overlaps, there are overlapping path areas, obtaining the area overlap number; Determine the first path node number to be tested according to the area overlap number and the second intersection number of each intermediate node in the first intermediate node set; Determine the second path node number to be tested according to the area overlap number and the second intersection number of each intermediate node in the second intermediate node set; Binary-encode each of the first pathway node numbers and each of the second pathway node numbers, convert the first pathway node number into a first pathway node code, and convert the second pathway node number into a second pathway node code; Performing bit-by-bit XOR operation and decimal conversion processing on the first pathway node code and the second pathway node code to obtain a second XOR operation result between each of the first pathway node code and the second pathway node code; The number of the path conflicting nodes is determined according to each of the second XOR operation results.

5. The fire emergency route recommendation method for an outdoor park according to claim 4, characterized in that: The determining the number of the path conflicting nodes according to each of the second XOR operation results includes: When the result of the second XOR operation is 0, it is determined that the first pathway node code and the second pathway node code are the same, and it is determined that the intermediate nodes indicated by the first pathway node code and the second pathway node code conflict in the overlapping pathway area; When the second XOR operation result is not 0, it is determined that the first pathway node code and the second pathway node code are different, and it is determined that the intermediate nodes indicated by the first pathway node code and the second pathway node code in the overlapping pathway area do not conflict; All the second XOR operation results are traversed, and the number of the path conflict nodes in the overlapping path area is counted.

6. The fire emergency route recommendation method for an outdoor park according to claim 1, characterized in that: The path planning is performed according to the fire point, at least one target entrance determined based on traffic flow information, and multiple candidate nodes determined from the intersection to obtain at least one candidate firefighting path and a candidate escape path for personnel, including: Taking the target entrance as the first starting point and the fire point as the first end point, performing a first path planning process according to the candidate nodes, and obtaining at least one candidate fire passage path whose total traffic flow is less than a preset traffic flow threshold; wherein each of the candidate fire passage paths includes: a first intermediate node set, the first starting point, and the first end point; At the same time, taking the fire point as the second starting point and the target entrance as the second end point, a second path planning process is performed according to the candidate nodes to obtain at least one candidate escape path for personnel whose total path length is less than a preset length threshold; wherein each of the candidate escape paths for personnel includes: a second intermediate node set, the second starting point and the second end point.

7. The fire emergency route recommendation method for an outdoor park according to claim 1, characterized in that: The fire emergency path recommendation list includes a fire passage target path and at least one corresponding personnel escape target path; After determining the firefighting target path and the personnel escape target path with a small conflict degree to be recommended, the method further includes: Generate a fire emergency path recommendation list according to the fire passage target path and the personnel escape target path; In the initial three-dimensional schematic diagram of the park, the fire emergency path target paths and the corresponding non-conflicting personnel escape target paths are marked with different colors according to the fire emergency path recommendation list, and the three-dimensional emergency path schematic diagram of the park is obtained and displayed; In response to the operation of selecting the fire escape target path, the corresponding personnel escape target path is highlighted and recommended in the three-dimensional emergency path schematic diagram of the park according to the fire emergency path recommendation list.

8. An electronic device, characterized in that: It includes at least one control processor and a memory for communicating with the at least one control processor; the memory stores instructions that can be executed by the at least one control processor, and the instructions are executed by the at least one control processor so that the at least one control processor can execute the fire emergency path recommendation method for an outdoor park as described in any one of claims 1 to 7.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the fire emergency route recommendation method for an outdoor park as described in any one of claims 1 to 7.

Images