Forest grassland fire rescue path planning method and device
By forming road network vector data based on the internal paths of the forest area in forest grassland fire rescue, selecting the starting point and calculating the optimal path, the problem of low practicality of path planning in the existing technology is solved, and more effective rescue path planning is achieved.
Patent Information
- Application Number
- CN202411984991.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-31
- Publication Date
- 2025-04-11
AI Technical Summary
The existing forest and grassland fire rescue path planning method only focuses on the shortest straight line distance, and fails to comprehensively consider factors such as the internal path of the forest area, resulting in the low practicality of the planned rescue path.
Search for nearby firefighting materials, resource equipment and rescue personnel locations through the location of the fire point, form road network vector data based on the internal paths of the forest area, select the starting point, calculate the path and point closest to the starting point, intercept the path closest to the fire point, and repeat the calculation until the path closest to the fire point is reached, forming a rescue planning path.
This method can form an effective rescue planning path based on the internal path of the forest area, improving the practicality and accuracy of path planning.
Smart Images

Figure CN119809076A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field related to intelligent forestry prevention and control, and in particular to a method and device for planning a forest and grassland fire rescue path. Background Art
[0002] Forest and grassland fire rescue refers to the process of taking a series of measures to quickly extinguish the fire, reduce losses, and protect personnel and ecological safety after a forest and grassland fire occurs.
[0003] Forest and grassland fire rescue often requires shortest path planning based on the location of firefighting materials, resources and equipment, and rescue personnel within the range to form a rescue planning path.
[0004] The current rescue planning path is often calculated based on the shortest path planning algorithm. This method often only focuses on the shortest straight-line distance between the starting point and the fire point, and cannot comprehensively consider other path planning factors such as the internal path of the forest area. Therefore, although the planned rescue path has the shortest straight-line distance, it is less practical. Summary of the invention
[0005] The purpose of the present invention is to solve at least one of the deficiencies of the prior art and to provide a method and device for planning a forest and grassland fire rescue path.
[0006] In order to achieve the above object, the present invention adopts the following technical solutions:
[0007] Specifically, a forest grassland fire rescue path planning method is proposed, including the following:
[0008] Step 110, through the location of the fire point, according to the set nearby range conditions, search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range;
[0009] Step 120, forming road network vector data based on the internal path of the current forest area, and pre-selecting a starting point position in the map;
[0010] Step 130: Use the starting point as the starting point for searching, find the internal path closest to the starting point in the road network vector data and record it as the middle path, calculate the point on the middle path closest to the starting point and record it as the middle point, and record the path between the starting point and the middle point as the first road section;
[0011] Step 140, find an internal path that intersects with the middle path and whose intersection is closest to the fire point and is recorded as the current path, and intercept the path between the middle point and the intersection and record it as the second section;
[0012] Step 150, updating the intersection point to the middle point, updating the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeating step 140 until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data;
[0013] Step 160: output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.
[0014] Furthermore, the method further comprises:
[0015] When there is a weather station within the set nearby range of the fire point, the real-time environmental weather will also be displayed synchronously.
[0016] The present invention also proposes a device for planning a forest and grassland fire rescue path, comprising the following:
[0017] The first search module is used to search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range according to the set nearby range conditions through the location of the fire point;
[0018] A starting point location determination module is used to form road network vector data based on the internal path of the current forest area and pre-select the starting point location in the map;
[0019] The second search module is used to search the starting point as the starting point, find the internal path closest to the starting point in the road network vector data and record it as the intermediate path, and calculate the point on the intermediate path closest to the starting point and record it as the intermediate point, and the path between the starting point and the intermediate point is recorded as the first road section;
[0020] The third search module is used to find an internal path that intersects with the middle path and whose intersection is closest to the fire point, record it as the current path, and intercept the path between the middle point and the intersection, record it as the second section;
[0021] A loop execution module is used to update the intersection point to the middle point, update the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeatedly execute the third search module until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data;
[0022] The path planning module is used to output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.
[0023] The beneficial effects of the present invention are:
[0024] The present invention proposes a forest and grassland fire rescue path planning method and device, which forms road network vector data based on the internal path of the current forest area, selects the starting point position on the map, uses the starting point position as the starting point for searching, retrieves the path with the closest distance, calculates the point closest to the starting point on the path, and then starts from the point to retrieve the point that intersects with the path and the intersection point is closest to the fire point, intercepts the internal path between the two points, and repeats the calculation until the path closest to the fire point is calculated, and then calculates the point closest to the fire point on the path to form a rescue planning path. The forest and grassland fire rescue path planning method proposed by the present invention can form an effective rescue planning path based on the internal path of the forest area. BRIEF DESCRIPTION OF THE DRAWINGS
[0025] The above and other features of the present disclosure will become more apparent by describing in detail the embodiments shown in the accompanying drawings. The same reference numerals in the accompanying drawings of the present disclosure represent the same or similar elements. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure. For those skilled in the art, other accompanying drawings can be obtained based on these accompanying drawings without creative work. In the accompanying drawings:
[0026] Figure 1 Shown is a flow chart of a forest and grassland fire rescue path planning method of the present invention;
[0027] Figure 2 The figure shows a schematic diagram of a path generated by a forest and grassland fire rescue path planning method in one embodiment of the present invention. DETAILED DESCRIPTION
[0028] The following will be combined with the embodiments and drawings to clearly and completely describe the concept, specific structure and technical effects of the present invention, so as to fully understand the purpose, scheme and effect of the present invention. It should be noted that the embodiments in this application and the features in the embodiments can be combined with each other without conflict. The same reference numerals used throughout the drawings indicate the same or similar parts.
[0029] Example 1, reference Figure 1 The present invention proposes a forest and grassland fire rescue path planning method, comprising the following steps:
[0030] Step 110, through the location of the fire point, according to the set nearby range conditions, search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range; after generating the rescue path, check the firefighting materials and firefighting rescue personnel positions that can be called within the nearest range of the rescue path to the fire point for command and dispatch work of the rescue command center;
[0031] Step 120, forming road network vector data based on the internal path of the current forest area, and pre-selecting a starting point position in the map;
[0032] Step 130: Use the starting point as the starting point for searching, find the internal path closest to the starting point in the road network vector data and record it as the middle path, calculate the point on the middle path closest to the starting point and record it as the middle point, and record the path between the starting point and the middle point as the first road section;
[0033] Step 140, find an internal path that intersects with the middle path and whose intersection is closest to the fire point and is recorded as the current path, and intercept the path between the middle point and the intersection and record it as the second section;
[0034] Step 150, updating the intersection point to the middle point, updating the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeating step 140 until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data;
[0035] Step 160: output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.
[0036] Reference Figure 2 , the red line is the generated rescue path. In this embodiment 1, through the location of the fire point, according to the set nearby range conditions, the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range are searched and displayed on the map. When there is a weather station within the range, the real-time environmental weather is displayed synchronously. Based on the internal path of the current forest area, the road network vector data is formed, the starting point position is selected on the map, and the starting point position is used as the starting point for searching, and the nearest path is retrieved. After calculating the point closest to the starting point on the path, starting from this point, the point that intersects with the path and the intersection point is closest to the fire point is retrieved, and the internal path between the two points is intercepted. Repeat the calculation until the path closest to the fire point is calculated, and then the point closest to the fire point is calculated to form a rescue planning path.
[0037] Furthermore, the method further comprises:
[0038] When there is a weather station within the set nearby range of the fire point, the real-time environmental weather will also be displayed synchronously.
[0039] The present invention also proposes a device for planning a forest and grassland fire rescue path, comprising the following:
[0040] The first search module is used to search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range according to the set nearby range conditions through the location of the fire point;
[0041] A starting point location determination module is used to form road network vector data based on the internal path of the current forest area and pre-select the starting point location in the map;
[0042] The second search module is used to search the starting point as the starting point, find the internal path closest to the starting point in the road network vector data and record it as the intermediate path, and calculate the point on the intermediate path closest to the starting point and record it as the intermediate point, and the path between the starting point and the intermediate point is recorded as the first road section;
[0043] The third search module is used to find an internal path that intersects with the middle path and whose intersection is closest to the fire point, record it as the current path, and intercept the path between the middle point and the intersection, record it as the second section;
[0044] A loop execution module is used to update the intersection point to the middle point, update the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeatedly execute the third search module until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data;
[0045] The path planning module is used to output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.
[0046] In addition, each functional module in each embodiment of the present invention may be integrated into one processing module, or each module may exist physically separately, or two or more modules may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of software functional modules.
[0047] If the integrated module is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or system that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal and software distribution medium, etc.
[0048] Although the description of the present invention has been quite detailed and specifically describes several described embodiments, it is not intended to be limited to any of these details or embodiments or any particular embodiment, but should be regarded as providing a broad possible interpretation of these claims in view of the prior art by reference to the appended claims, thereby effectively covering the intended scope of the present invention. In addition, the above description of the present invention is based on the embodiments foreseeable by the inventor, and its purpose is to provide a useful description, and those non-substantial changes to the present invention that have not yet been foreseen may still represent equivalent changes to the present invention.
[0049] The above is only a preferred embodiment of the present invention. The present invention is not limited to the above implementation. As long as the technical effect of the present invention is achieved by the same means, it should belong to the protection scope of the present invention. Within the protection scope of the present invention, its technical scheme and / or implementation method can have various modifications and changes.
Claims
1. A forest and grassland fire rescue path planning method, characterized in that: Includes the following: Step 110, through the location of the fire point, according to the set nearby range conditions, search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range; Step 120, forming road network vector data based on the internal path of the current forest area, and pre-selecting a starting point position in the map; Step 130: Use the starting point as the starting point for searching, find the internal path closest to the starting point in the road network vector data and record it as the middle path, calculate the point on the middle path closest to the starting point and record it as the middle point, and record the path between the starting point and the middle point as the first road section; Step 140, find an internal path that intersects with the middle path and whose intersection is closest to the fire point and is recorded as the current path, and intercept the path between the middle point and the intersection and record it as the second section; Step 150, updating the intersection point to the middle point, updating the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeating step 140 until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data; Step 160: output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.
2. A forest and grassland fire rescue path planning method according to claim 1, characterized in that: The method further comprises, When there is a weather station within the set nearby range of the fire point, the real-time environmental weather will also be displayed synchronously.
3. A device for planning a forest and grassland fire rescue path, characterized in that: Includes the following: The first search module is used to search for the location of firefighting materials, resource equipment, rescue personnel, and rescue trajectory routes within the range according to the set nearby range conditions through the location of the fire point; A starting point location determination module is used to form road network vector data based on the internal path of the current forest area and pre-select the starting point location in the map; The second search module is used to search the starting point as the starting point, find the internal path closest to the starting point in the road network vector data and record it as the intermediate path, and calculate the point on the intermediate path closest to the starting point and record it as the intermediate point, and the path between the starting point and the intermediate point is recorded as the first road section; The third search module is used to find an internal path that intersects with the middle path and whose intersection is closest to the fire point, record it as the current path, and intercept the path between the middle point and the intersection, record it as the second section; A loop execution module is used to update the intersection point to the middle point, update the internal path that intersects with the middle path and whose intersection point is closest to the fire point to the middle path, and repeatedly execute the third search module until the internal path that intersects with the middle path and whose intersection point is closest to the fire point is the internal path closest to the fire point in the road network vector data; The path planning module is used to output the first road section and all the second road sections, so that the first road section and all the second road sections together form a rescue planning path.