Military simulation optimal path identification method in multi-domain joint combat environment
By building a geographical environment model for multi-domain joint combat environment and optimizing paths using the A* algorithm, combined with the weight adjustment of multiple factors, the problem of inefficient path planning in multi-domain joint combat is solved, and efficient, safe and accurate combat is achieved Path planning has improved the practical level of military simulation training.
Patent Information
- Application Number
- CN202411094604.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-10
- Publication Date
- 2024-11-22
AI Technical Summary
The existing technology is difficult to quickly and accurately plan the optimal path in a multi-domain joint combat environment, and cannot effectively identify the best combat routes, resulting in inefficient path planning and unsatisfactory planning results.
Based on GIS technology, we construct a geographical environment model of multi-domain joint combat environment, analyze natural environmental factors and combat resource distribution, identify key factors and dangerous sources, establish a risk source probability model, and use the A* algorithm to dynamically adjust the heuristic function weight of path nodes. Combining terrain obstacles, enemy combat forces and weather factors, optimize path planning.
It has achieved efficient, safe and precise planning of combat paths in the case of multi-domain joint combat, improved the practical level of military simulation training, and can dynamically adjust the paths to cope with environmental changes and optimize the paths.
Smart Images

Figure CN119005468A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of military simulation technology, and in particular to a method, equipment, device and medium for identifying optimal paths for military simulation in a multi-domain joint combat environment. Background Art
[0002] With the complexity of modern warfare, multi-domain joint operations have become an important trend in military operations. In military training, military simulation, as an effective training method, can simulate the real battlefield environment and improve the actual combat capabilities of trainees. However, how to quickly and accurately plan the optimal path under multi-domain joint operations in military simulation is a major challenge facing current technology. Most existing technologies find it difficult to fully consider the complexity and real-time requirements of multi-domain operations, resulting in inefficient path planning or unsatisfactory planning results, that is, the best combat route cannot be effectively identified. Summary of the invention
[0003] In view of the above problems, this application proposes a method for identifying the optimal path of military simulation in a multi-domain joint combat environment, which includes:
[0004] Constructing a geographical environment model including a multi-domain joint combat environment based on GIS technology, wherein the geographical environment model includes a simulation of natural environmental factors and a simulation of the distribution of combat resources in a multi-domain joint combat environment;
[0005] Analyze the natural environmental factors and the distribution of combat resources and identify the key factors and danger sources that affect the path, and establish corresponding danger source probability models according to different danger sources, wherein the key factors include distance costs, and the danger sources include terrain obstacle danger, enemy combat force danger, and weather factor danger;
[0006] The optimal path is identified based on the A* algorithm, which includes: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, wherein each node corresponds to a map grid in the geographic environment model, and the heuristic function value f n for:
[0007] f n =g n +w*(h n +b)
[0008] Where: f n Represents the heuristic function value of the current nth node; g n is the actual cost value from the starting point to the current nth node;
[0009] g n =P 1n *wp 1n +P2n *wp 2n +P 3n *wp 3n +D
[0010] P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node;
[0011] P 2n is the enemy combat force danger of the current nth node, wp 2n is the weight of the enemy's combat force danger at the current nth node;
[0012] P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node;
[0013] Among them, wp 1n +wp 2n +wp 3n =1;
[0014] D is the distance cost from the starting point to the current nth node;
[0015] W is the weight of the estimated cost value from the current nth node to the end point;
[0016] h n is the estimated cost value from the current nth node to the end point;
[0017] b is the offset.
[0018] According to some embodiments of the present invention, the terrain obstacle hazard P 1n =M n *w 1n +G n *w 2n ;
[0019] M n is the altitude of the current nth node, w 1n is the weight parameter of the altitude at the current nth node, G n is the terrain cost difficulty at the current nth node, w 2n is the weight parameter of the terrain at the current nth node;
[0020] The enemy combat force danger is a radar detection danger, which is used to indicate the danger level detected by the enemy radar at the current nth node. The enemy combat force danger P 2n =L n *w 3n , where Ln is the danger level at the current nth node, w 3n is the danger level coefficient at the current nth node;
[0021] Weather Factors Danger 3n =S n *w 4n , where S n is the weather index at the current nth node, w 4n is the weight coefficient of the weather at the current nth node.
[0022] According to some embodiments of the present invention, identifying the optimal path based on the A* algorithm includes:
[0023] S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited;
[0024] S22. Add the starting node to the closed list, and add the adjacent nodes of the starting node to the open list;
[0025] S23. Calculate the heuristic function value f of the adjacent nodes in the open list, and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list;
[0026] S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node;
[0027] S25. Repeat the above steps to obtain the final optimal path.
[0028] According to some embodiments of the present invention, the method further comprises adjusting the w value according to the distance between the current node and the target end point, so that the w value is inversely proportional to the distance.
[0029] According to some embodiments of the present invention, the method further includes: when the distance between the current node and the target endpoint is greater than a threshold, using a relatively large w value; and when the distance between the current node and the target endpoint is less than or equal to a threshold, using a relatively small w value.
[0030] According to some embodiments of the present invention, the method further includes real-time monitoring of geographical environment changes, and dynamically adjusting the optimal path based on the monitoring results, wherein the geographical environment changes include changes in natural environmental factors and changes in the distribution of combat resources.
[0031] The present application also provides a device for optimal path identification of military simulation in a multi-domain joint combat environment, which includes:
[0032] A geographic environment construction module, which is used to construct a geographic environment model including a multi-domain joint combat environment based on GIS technology. The geographic environment model includes a simulation of natural environmental factors in a multi-domain joint combat environment and a simulation of the distribution of combat resources;
[0033] A hazard probability model module is used to analyze the natural environmental factors and the distribution of combat resources and identify the key factors and hazard sources that affect the path, and establish a corresponding hazard source probability model according to different hazard sources, wherein the key factors include distance costs, and the hazard sources include terrain obstacle hazards, enemy combat force hazards, and weather factor hazards;
[0034] Path planning algorithm module: It identifies the optimal path based on the A* algorithm, including: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, where each node corresponds to a map grid in the geographic environment model, and the heuristic function value is:
[0035] f n =g n +w*(h n +b)
[0036] where f n Represents the heuristic function value of the current nth node; g n is the actual cost value from the starting point to the current nth node;
[0037] g n =P 1n *wp 1n +P 2n *wp 2n +P 3n *wp 3n +D
[0038] P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node;
[0039] P 2n is the enemy combat force danger of the current nth node, wp 2nis the weight of the enemy's combat force danger at the current nth node;
[0040] P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node;
[0041] Among them, wp 1n +wp 2n +wp 3n =1;
[0042] D is the distance cost from the starting point to the current nth node;
[0043] W is the weight of the estimated cost value from the current nth node to the end point;
[0044] h n is the estimated cost value from the current nth node to the end point;
[0045] b is the offset.
[0046] According to some embodiments of the present invention, the path planning algorithm module is further configured to perform the following steps:
[0047] S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited;
[0048] S22. Add the starting node to the closed list, and add the adjacent nodes of the starting node to the open list;
[0049] S23. Calculate the heuristic function value f of the adjacent nodes in the open list, and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list;
[0050] S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node;
[0051] S25. Repeat the above steps to obtain the final optimal path.
[0052] The present application also provides a device for optimal path identification in military simulation in a multi-domain joint combat environment, which includes a processor and a memory; the processor executes the described method based on a computer program stored in the memory.
[0053] The present application also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the described method is executed.
[0054] Through the present invention, efficient, safe and accurate planning of combat paths in multi-domain joint operations can be achieved, thereby improving the actual combat level of military simulation training. BRIEF DESCRIPTION OF THE DRAWINGS
[0055] The above and other objects, features and advantages of the present invention will become more apparent through the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:
[0056] Figure 1 An exemplary flow chart showing a method for identifying an optimal path for military simulation in a multi-domain joint operations environment according to some embodiments of the present invention;
[0057] Figure 2 A flowchart of a method for identifying an optimal path based on an A* algorithm according to some embodiments of the present invention is shown;
[0058] Figure 3a shows a grid map according to some embodiments of the present invention;
[0059] Figure 3b Show Figure 3a Each adjacent node of node A and its f value:
[0060] Figure 3c Show Figure 3a The adjacent node C of node A;
[0061] Figure 3d One of the optimization paths is shown;
[0062] Figure 3e Show the optimal path;
[0063] Figure 4 Path planning effect diagrams according to some embodiments of the present invention are shown;
[0064] Figure 5 The optimal path identification device for military simulation in a multi-domain joint combat environment is shown;
[0065] Figure 6 A military simulation optimal path identification device in a multi-domain joint combat environment according to some embodiments of the present invention is shown. DETAILED DESCRIPTION
[0066] The present invention will be exemplarily described below with reference to the accompanying drawings and in combination with embodiments. It should be noted that the embodiments and features in the embodiments in this application can be combined with each other without conflict. In addition, the described embodiments are only some embodiments of the present invention, not all embodiments.
[0067] In a first aspect, the present application proposes a method for optimal path identification (or planning) of military simulation in a multi-domain joint combat environment. Figure 1 An exemplary flow chart of the method is shown, the method comprising:
[0068] S1. Construct a geographical environment model including a multi-domain joint combat environment based on GIS technology, wherein the geographical environment model includes a simulation of natural environmental factors in the multi-domain joint combat environment and a simulation of the distribution of combat resources.
[0069] The multi-domain joint combat environment includes land, sea, air and network combat environments. The network situation will affect the real-time transmission of battlefield information and various communication qualities during combat.
[0070] The simulation of natural environmental factors can include: simulation of terrain undulations, slopes and terrain features, temperature, humidity, wind speed and precipitation, water bodies, vegetation coverage, soil types and other geographical elements. These elements will affect the adaptability, concealment, route feasibility and movement speed of the troops.
[0071] The simulation of combat resource distribution includes: force distribution simulation, such as the respective positions and numbers of main forces, logistical support and special forces; weapons and equipment simulation, such as the distribution and use of various weapons and equipment, such as radars, tanks, aircraft, mortars, etc.; logistics resource simulation, such as predicting the distribution and supply of logistics resources such as ammunition, fuel, medical facilities, etc.
[0072] S2. Analyze the natural environmental factors and the distribution of combat resources and identify the key factors and hazards that affect the path, and establish corresponding hazard probability models based on different hazard sources. The key factors include distance costs, and the hazards include terrain obstacle hazards, enemy combat force hazards, and weather factor hazards.
[0073] The enemy combat force dangers include, for example, enemy firing points, minefields, radar detection dangers, etc.
[0074] Historical data and expert knowledge can be used to train and verify the hazard source probability model to ensure its accuracy and reliability.
[0075] S3. Identify the optimal combat path from the starting point to the target end point in the simulated geographical environment based on the A* algorithm, including: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, wherein each node corresponds to a map grid in the geographical environment model, and the heuristic function value is:
[0076] f n =g n +w*(h n +b)
[0077] f n It represents the heuristic function value (comprehensive priority) of the current nth node, which can also be understood as the estimated minimum total cost of the current node. n is the actual cost value from the starting point to the current nth node; g n =P 1n *wp 1n +P 2n *wp 2n +P 3n *wp 3n +D
[0078] P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node;
[0079] P 2n is the enemy combat force danger of the current nth node, wp 2n is the weight of the enemy's combat force danger at the current nth node;
[0080] P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node;
[0081] Among them, wp 1n +wp 2n +wp 3n =1;
[0082] D is the distance cost from the starting point to the current nth node. As one of the simplest estimates, the Euclidean distance can be used, and its formula is as follows:
[0083]
[0084] W is the weight of the estimated cost value from the current nth node to the end point;
[0085] h n is the estimated cost value from the current nth node to the end point;
[0086] b is the offset.
[0087] By estimating the cost value h n By adding the weight coefficient w before g n >>h n and g n < <h n In all cases, the heuristic function relies on the actual cost to control the search direction, so that the obtained path is the optimal path. By adjusting the weights of the actual cost and the estimated function cost, the search points can be effectively reduced and the search speed can be improved.
[0088] According to some embodiments of the present invention, the method for identifying the optimal path for military simulation in a multi-domain joint combat environment further includes adjusting the w value according to the distance between the current node and the target end point so that the w value is inversely proportional to the distance.
[0089] According to some embodiments of the present invention, making the w value inversely proportional to the distance includes: using a relatively large w value when the current node is greater than a threshold value from the target endpoint, and using a relatively small w value when the current node is less than or equal to a threshold value from the target endpoint.
[0090] Through the above embodiment, when the current node is far away from the target end point, a relatively large w weight is used, so that the target point can be quickly approached, thereby improving the search speed. When the current node is very close to the target end point, a relatively small w weight is used, so that the optimal path can continue to be found near the target end point.
[0091] According to some embodiments of the present invention, the weight coefficients may vary with the node or with the military target. The variation with the node includes variation according to the geographical factors (simulation of natural environmental factors and distribution of combat resources) at the node, and variation with the military target includes variation in the duration of the operation, the number of captured targets, and the number of enemy targets to be annihilated. The inventors also found in the experiment that when searching for the optimal path on the grid map, the f values of two different nodes in the openlist may be the same, especially when the weight coefficients are relatively fixed. In order to avoid this situation, the inventors added an offset b to the estimation function. The value of b can be a very small value, such as 0.1%, to avoid affecting the calculation error, while making the final calculation results of the originally possible same f values slightly different, thereby greatly reducing the probability of the occurrence of the same f values, and obtaining different f values at different nodes.
[0092] Through the present invention, efficient, safe and accurate planning of combat paths in multi-domain joint operations can be achieved, thereby improving the actual combat level of military simulation training.
[0093] According to some embodiments of the present invention, the method further includes real-time monitoring of geographical environmental changes, and dynamically adjusting the optimal path based on the monitoring results, wherein the geographical environmental changes include changes in natural environmental factors and changes in the distribution of combat resources, such as the movement of obstacles and changes in the enemy situation. The optimal path adjustment also includes re-planning the path when a high-probability danger source or a more optimal path is detected on the path.
[0094] According to some embodiments of the present invention, the method further includes optimizing and adjusting the path according to actual needs and feedback from trainees.
[0095] According to some embodiments of the present invention, the terrain obstacle hazard P 1n =M n *w 1n +G n *w 2n .
[0096] Among them, M n is the altitude of the current nth node, w 1n is the weight parameter of the altitude at the current nth node, G n is the terrain cost difficulty at the current nth node, w 2n It is the weight parameter of the terrain at the current nth node.
[0097] The enemy combat force danger is a radar detection danger, which is used to indicate the danger level detected by the enemy radar at the current nth node. The enemy combat force danger P 2n =L n *w 3n , where L n is the danger level at the current nth node, w 3n is the danger level coefficient at the current nth node.
[0098] Weather Factors Danger 3n =S n *w 4n , where S n is the weather index at the current nth node, w 4n is the weight coefficient of the weather at the current nth node.
[0099] By introducing terrain obstacles and hazards, the troops will be more cautious in avoiding complex terrains such as mountains, rivers, and swamps when identifying or planning paths, reducing the natural obstacles and losses that troops may encounter during their march. This improvement makes the planned paths more in line with the actual battlefield environment, improving the survivability and combat efficiency of the troops; in addition, it also enhances environmental adaptability, making it possible to dynamically adjust the path planning strategy according to the complexity and difficulty of different terrains, thereby improving path safety.
[0100] In military operations, it is crucial to avoid being detected by enemy radars. By introducing radar detection hazards, we can try to avoid the detection range of enemy radars when planning routes and choose more covert routes. This helps to improve the concealment and suddenness of troops and increase the success rate of operations.
[0101] Weather factors such as rain, snow, fog, and sandstorms can have a significant impact on military operations. By introducing weather factors, changes in weather conditions can be fully considered when planning routes, and more suitable routes and combat opportunities can be selected. This helps improve the accuracy and scientificity of decision-making.
[0102] refer to Figure 2 , which shows a flow chart of a method for identifying an optimal path based on an A* algorithm according to some embodiments of the present invention, the method comprising:
[0103] S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited;
[0104] S22. Add the starting node to the closed list, and add the neighboring nodes of the starting node (8 in the figure) to the open list;
[0105] S23. Calculate the heuristic function value f of the adjacent nodes in the open list (8 in the figure), and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list;
[0106] S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node;
[0107] S25. Repeat the above steps to obtain the final optimal path.
[0108] Reference Figure 3a-3e , further examples are given for the above embodiments.
[0109] Figure 3a A grid map according to some embodiments of the present invention is shown, where the starting node is A, the ending node is B, the blue area is an impassable river, and it is assumed that the plan is to depart from the starting point A to the ending point B.
[0110] The process of the A* algorithm according to some embodiments of the present invention includes:
[0111] First, create an open list (or openlist) and a closed list (or closelist). The open list represents the grid nodes that have not been visited yet, and the closed list represents the grid nodes that have been visited.
[0112] The first step is to assume that the starting node is A and add node A to the closelist. At this time, the openlist is empty. We add the eight adjacent nodes of A ( Figure 3a The green part in the middle) is added to the openlist.
[0113] The second step is to calculate the f-values of the eight adjacent nodes in the openlist. The f-value of each node will be saved in the openlist. Figure 3b As shown, each green box represents each adjacent node of the current node A. The numbers inside the green box are:
[0114] The lower left corner is the cost g from the starting point to the current node (the nth node) n
[0115] The lower right corner is the estimated cost value h from the current node to the end point n
[0116] The middle is the comprehensive priority f value of the node, which is calculated as follows:
[0117] f n =g n +w*(h n +b)
[0118] The specific parameters of the formula can be found in the previous description and will not be repeated here.
[0119] In the second step, we know that the node to the right of A is the node with the highest comprehensive priority, so we put the node C into the closelist, such as Figure 3c As shown, we come to node C at this time. According to step 2, if point C is unreachable or already in the closelist, it is ignored.
[0120] Determine whether the adjacent nodes of node C are in the openlist. If the adjacent nodes are not in the openlist, we will add the node to the openlist and calculate the f value. If there is an adjacent node that is already in the openlist, calculate the f value of the node and compare the f values of all nodes in the openlist to determine whether it is the optimal path. If it is the optimal path, re-plan the previous node A as the parent node, and the optimal node in the openlist as the child node of the parent node. The current path is as follows Figure 3d shown.
[0121] Repeat the above steps and calculate the comprehensive optimal f value of the path nodes to obtain the final optimal path, such as Figure 3e shown.
[0122] Figure 4 A diagram showing the effect of path planning according to some embodiments of the present invention is shown. A user sets a starting point and an end point on a map, and the system can intelligently identify or plan an optimal path.
[0123] Figure 5 A device 5000 for optimal path identification in military simulation in a multi-domain joint combat environment is shown, which includes: a geographical environment construction module 5001, a hazard probability model module 5002 and a path planning algorithm module 5003.
[0124] The geographic environment construction module 5001 is used to construct a geographic environment model including a multi-domain joint combat environment based on GIS technology. The geographic environment model includes a simulation of natural environmental factors in the multi-domain joint combat environment and a simulation of the distribution of combat resources.
[0125] The hazard probability model module 5002 is used to analyze the natural environmental factors and the distribution of combat resources and identify the key factors and hazard sources that affect the path, and establish corresponding hazard source probability models based on different hazard sources. The key factors include distance costs, and the hazard sources include terrain obstacle hazards, enemy combat force hazards, and weather factor hazards.
[0126] The path planning algorithm module 5003 identifies the optimal path based on the A* algorithm, including: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, wherein each node corresponds to a map grid in the geographic environment model, and the heuristic function value is:
[0127] f n =g n +w*(h n +b)
[0128] Where: f n Represents the heuristic function value of the current nth node; gn is the actual cost value from the starting point to the current nth node;
[0129] g n =P 1n *wp 1n +P 2n *wp 2n +P 3n *wp 3n +D
[0130] P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node;
[0131] P 2n is the enemy combat force danger of the current nth node, wp 2n is the weight of the enemy's combat force danger at the current nth node;
[0132] P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node;
[0133] Among them, wp 1n +wp 2n +wp 3n =1;
[0134] D is the distance cost from the starting point to the current nth node;
[0135] W is the weight of the estimated cost value from the current nth node to the end point;
[0136] h n is the estimated cost value from the current nth node to the end point;
[0137] b is the offset.
[0138] According to some embodiments of the present invention, the device further comprises a dynamic adjustment and planning module, which is used to dynamically adjust the optimal path or re-plan the path according to the key factors and danger sources monitored in real time.
[0139] According to some embodiments of the present invention, the path planning algorithm module is further configured to perform the following steps:
[0140] S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited;
[0141] S22. Add the starting node to the closed list, and add the adjacent nodes of the starting node to the open list;
[0142] S23. Calculate the heuristic function value f of the adjacent nodes in the open list, and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list;
[0143] S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node;
[0144] S25. Repeat the above steps to obtain the final optimal path.
[0145] In addition, the front surround Figure 5 The details described in the previous figures are also applicable here, and can be implemented by adding corresponding functions in each module. For the sake of simplicity, they will not be repeated here.
[0146] Figure 6 FIG. 5 is a schematic structural diagram of a military simulation optimal path identification device 500 in a multi-domain joint combat environment according to some embodiments of the present invention. Figure 6 As shown, the device includes a processor 51 , a memory 52 and a bus 53 .
[0147] In some instances, the device may also include an input device 501, an input port 502, an output port 503, and an output device 504. The input port 502, the processor 51, the memory 52, and the output port 503 are interconnected through a bus 53, and the input device 501 and the output device 504 are connected to the bus 53 through the input port 502 and the output port 503, respectively, and then connected to other components of the device. It should be noted that the output interface and the input interface here can also be represented by an I / O interface. Specifically, the input device 501 receives input information from the outside, and transmits the input information to the processor 51 through the input port 502; the processor 51 processes the input information based on the computer executable instructions stored in the memory 52 to generate output information, temporarily or permanently stores the output information in the memory 52, and then transmits the output information to the output device 504 through the output port 503; the output device 504 outputs the output information to the outside of the device. The input device 501 and the output device 504 can be, for example, a hand-drawing tablet and a display, respectively, or a touch-screen display all-in-one machine.
[0148] The above-mentioned memory 52 includes a large capacity memory for data or instructions. For example, but not limitation, the memory 52 may include a HDD, a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 52 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 52 may be inside or outside the device. In a specific embodiment, the memory 52 is a non-volatile solid-state memory. In a specific embodiment, the memory 52 includes a read-only memory (ROM). In appropriate cases, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM) or a flash memory or a combination of two or more of these.
[0149] The bus 53 includes hardware, software or both, and multiple components are coupled to each other. For example, but not limitation, the bus 53 may include an accelerated graphics port (AGP) or other graphics bus, an enhanced industrial standard architecture (EISA) bus, a front-side bus (FSB), a hypertransport (HT) interconnect, an industrial standard architecture (ISA) bus, an infinite bandwidth interconnect, a low pin count (LPC) bus, a memory bus, a microchannel architecture (MCA) bus, a peripheral component interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SATA) bus, a video electronics standard association local (VLB) bus or other suitable bus or a combination of two or more of these. Although the embodiments of the present invention describe and illustrate a specific bus, the present invention considers any suitable bus or interconnect.
[0150] The processor 51 executes the above-mentioned optimal path identification method for military simulation in a multi-domain joint combat environment based on the computer program stored in the memory 52.
[0151] According to some further embodiments of the present invention, the computer program may be divided into one or more units in various ways and stored in the memory, and executed by the processor to complete the present invention. The one or more units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the device. The computer program may be divided into one or more units in various ways and stored in the memory, and executed by the processor to complete the present invention. The one or more units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the device. Figure 5 The functions of each module in each embodiment described are divided into multiple modules, or include the aforementioned reference Figure 5 For the sake of simplicity, the various modules in the various embodiments described are not repeated here.
[0152] The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc. The processor is the control center of the device, and various interfaces and lines are used to connect the various parts of the entire device. The device may be a computing device such as a desktop computer, a notebook, a PDA, and a cloud server, or a part thereof. The device may include, but is not limited to, a processor and a memory. Those skilled in the art will appreciate that the schematic diagram is merely an example of a device and does not constitute a limitation on the device.
[0153] The corresponding detailed descriptions of the above references are incorporated herein by reference and will not be repeated here.
[0154] The present application also proposes a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the optimal path identification method for military simulation in the multi-domain joint combat environment described in the above figures.
[0155] The corresponding detailed descriptions made above with reference to the various figures are incorporated herein by reference and will not be repeated here.
[0156] The computer program includes computer program code, which may be in source code form, object code form, executable file or some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc.
[0157] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention. It should be noted that although the structure of the device of the present invention and the method of its operation are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in this specific order, or that all the operations shown must be performed to achieve the desired results. On the contrary, the steps depicted in the flowchart can change the order of execution. Additionally or alternatively, certain steps can be omitted, multiple steps can be combined into one step for execution, and / or one step can be decomposed into multiple steps for execution.
Claims
1. A method for identifying optimal paths for military simulation in a multi-domain joint combat environment, the method comprising: Constructing a geographical environment model including a multi-domain joint combat environment based on GIS technology, wherein the geographical environment model includes a simulation of natural environmental factors and a simulation of the distribution of combat resources in a multi-domain joint combat environment; Analyze the natural environmental factors and the distribution of combat resources and identify the key factors and danger sources that affect the path, and establish corresponding danger source probability models according to different danger sources, wherein the key factors include distance costs, and the danger sources include terrain obstacle danger, enemy combat force danger, and weather factor danger; The optimal path is identified based on the A* algorithm, which includes: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, wherein each node corresponds to a map grid in the geographic environment model, and the heuristic function value f n for: f n =g n +w*(h n +b) Where: f n Represents the heuristic function value of the current nth node; g n is the actual cost value from the starting point to the current nth node; g n =P 1n *wp 1n +P 2n *wp 2n +P 3n *wp 3n +D P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node; P 2n is the enemy combat force danger of the current nth node, wp 2n is the weight of the enemy's combat force danger at the current nth node; P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node; Among them, wp 1n +wp 2n +wp 3n =1; D is the distance cost value from the starting point to the current nth node; W is the weight of the estimated cost value from the current nth node to the end point; h n is the estimated cost value from the current nth node to the end point; b is the offset.
2. The optimal path identification method for military simulation in a multi-domain joint combat environment according to claim 1, wherein: The terrain obstacle hazard P 1n =M n *w 1n +G n *w 2n ; M n is the altitude of the current nth node, w 1n is the weight parameter of the altitude at the current nth node, G n is the terrain cost difficulty at the current nth node, w 2n is the weight parameter of the terrain at the current nth node; The enemy combat force danger is a radar detection danger, which is used to indicate the danger level detected by the enemy radar at the current nth node. The enemy combat force danger P 2n =L n *w 3n , where L n is the danger level at the current nth node, w 3n is the danger level coefficient at the current nth node; Weather Factors Danger 3n =S n *w 4n , where S n is the weather index at the current nth node, w 4n is the weight coefficient of the weather at the current nth node.
3. The optimal path identification method for military simulation in a multi-domain joint operations environment according to claim 1, wherein: The method of identifying the optimal path based on the A* algorithm includes: S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited; S22. Add the starting node to the closed list, and add the adjacent nodes of the starting node to the open list; S23. Calculate the heuristic function value f of the adjacent nodes in the open list, and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list; S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node; S25. Repeat the above steps to obtain the final optimal path.
4. According to the method for identifying the optimal path for military simulation in a multi-domain joint combat environment in claim 1, it also includes adjusting the w value according to the distance between the current node and the target end point so that the w value is inversely proportional to the distance.
5. According to the method for identifying the optimal path of military simulation in a multi-domain joint combat environment in claim 1, it also includes using a relatively large w value when the distance between the current node and the target end point is greater than a threshold, and using a relatively small w value when the distance between the current node and the target end point is less than or equal to a threshold.
6. According to the method for identifying the optimal path for military simulation in a multi-domain joint combat environment according to claim 1, it also includes real-time monitoring of geographical environment changes and dynamically adjusting the optimal path based on the monitoring results, wherein the geographical environment changes include changes in natural environmental factors and changes in the distribution of combat resources.
7. A device for identifying optimal paths for military simulation in a multi-domain joint combat environment, comprising: A geographic environment construction module, which is used to construct a geographic environment model including a multi-domain joint combat environment based on GIS technology. The geographic environment model includes a simulation of natural environmental factors in a multi-domain joint combat environment and a simulation of the distribution of combat resources; A hazard probability model module is used to analyze the natural environmental factors and the distribution of combat resources and identify the key factors and hazard sources that affect the path, and establish a corresponding hazard source probability model according to different hazard sources, wherein the key factors include distance costs, and the hazard sources include terrain obstacle hazards, enemy combat force hazards, and weather factor hazards; Path planning algorithm module: It identifies the optimal path based on the A* algorithm, including: dynamically adjusting the weight factor of the heuristic function of each node on each path according to the key factors and the hazard source probability model, where each node corresponds to a map grid in the geographic environment model, and the heuristic function value is: f n =g n +w*(h n +b) where f n Represents the heuristic function value of the current nth node; g n is the actual cost value from the starting point to the current nth node; g n =P 1n *wp 1n +P 2n *wp 2n +P 3n *wp 3n +D P 1n is the terrain obstacle hazard of the current nth node, wp 1n is the weight of the terrain obstacle hazard of the current nth node; P 2n is the enemy combat force danger of the current nth node, wp 2n is the weight of the enemy's combat force danger at the current nth node; P 3n is the weather risk of the current nth node, wp 3n is the dangerous weight of the weather factor of the current nth node; Among them, wp 1n +wp 2n +wp 3n =1; D is the distance cost value from the starting point to the current nth node; W is the weight of the estimated cost value from the current nth node to the end point; h n is the estimated cost value from the current nth node to the end point; b is the offset.
8. The device according to claim 7, wherein: The path planning algorithm module is also used to perform the following steps: S21. Create an open list and a closed list, the open list represents the grid nodes that have not been visited, and the closed list represents the grid nodes that have been visited; S22. Add the starting node to the closed list, and add the adjacent nodes of the starting node to the open list; S23. Calculate the heuristic function value f of the adjacent nodes in the open list, and save the f value of each node in the open list, compare the f value of each node, and put the node with the smallest f value into the closed list; S24. Determine whether the adjacent node of the node with the smallest f value is in the open list. If the adjacent node is not in the open list, add the adjacent node to the open list, and calculate the f value of the node newly added to the open list; if the adjacent node is already in the open list, recalculate the f value of the adjacent node; compare the f values of all nodes in the open list, take the node with the smallest f value as the node of the optimal path, re-plan the node of the previous optimal path as the parent node, and take the node with the smallest f value in this step as the child node of the parent node; S25. Repeat the above steps to obtain the final optimal path.
9. A device for optimal path identification in military simulation in a multi-domain joint combat environment, comprising a processor and a memory; the processor executes the method described in one of claims 1 to 6 based on a computer program stored in the memory.
10. A computer-readable storage medium storing a computer program, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is performed.
Citation Information
Patent Citations
Similar three-dimensional path planning method based on improved A * algorithm
CN112325892A
Method for generating field maneuvering channel in complex environment based on space grid
CN115795697A
Path planning method and device, electronic equipment and storage medium
CN115862416A
3D optimal surveillance trajectory planning Method and Apparatus for multi-UAVs using particle swarm optimization with surveillance area priority
KR102279956B1
Cited By
Military text recognition method and device and medium
CN119990117A
Military text recognition method, device and medium
CN119990117B
