A method for dynamically adjusting command relationship in case of battle damage of command node

Abstract

The present application relates to the technical field of command and control structure adjustment, and particularly relates to a method for adjusting command relationship under the condition of war damage of a command node. The present application divides the adjustment of command relationship into three sub-problems, first, finding the platform node that loses command after the damage of the command node, then re-distributing the decision-making authority for the platform node that loses command, completing the recovery of topological connectivity, and finally adjusting the command and control structure, completing the dynamic optimization and adjustment of the command decision-making authority. The present application reduces the time complexity of the solution and improves the solution speed of the adjustment scheme of command relationship.

Description

Technical Field

[0001] This invention relates to the field of command and control structure adjustment technology, specifically to a method for adjusting command relationships in the event of battle damage to command nodes. Background Technology

[0002] In complex and ever-changing battlefield environments, when unexpected events such as node damage occur, the command and control system needs to adaptively adjust its structure within a limited time to address the impact of these events on operational effectiveness. The focus of research on command and control structure adjustment is to establish rapid, on-the-spot adjustment models to adapt to dynamic changes in the battlefield environment, maintain a competitive advantage, and ultimately achieve operational objectives. Commonly used adjustment methods for the dynamic adjustment of command relationships include those based on greedy search algorithms, artificial bee colony algorithms, and nested simulated annealing algorithms.

[0003] However, existing methods for dynamically adjusting command relationships rarely consider the issue of command node succession after the destruction of a primary command node. Therefore, situations may arise where the system loses its highest-level command after the destruction of a primary command node. Furthermore, current adjustment methods do not break down the complex problem of command relationship adjustment into multiple sub-problems; instead, they directly utilize intelligent optimization algorithms to solve the problem. This results in long solution times and non-unique optimization results, limiting their applicability in actual combat. Summary of the Invention

[0004] The technical problem solved by this invention is to overcome the shortcomings of existing technologies and provide a method for dynamically adjusting command relationships in the event of command node damage. This method can effectively and quickly adjust the command relationships of the command and control system under such circumstances. It utilizes graph theory to model the command and control system and applies nonlinear programming and integer programming from programming theory to adjust the structure of the command and control system. Compared with traditional dynamic adjustment problems of command relationships, the method of this invention considers the succession problem of command nodes after their destruction and takes into account more realistic constraints, including adjustment time constraints and matching constraints between combat resources.

[0005] The technical solution of this invention is:

[0006] A method for dynamically adjusting command relationships in the event of battle damage to command nodes, the method comprising the following steps:

[0007] Step 1: Initialize the information of each node in the command and control system and the command relationship information between each node;

[0008] Step 2: Obtain the damaged node number information in real time and change the status value of the acquired damaged node from 1 to 0. Then determine the type of the acquired damaged node. If the damaged node type is a primary command node, cancel the command relationship between the damaged node and the secondary command node. Then select one secondary command node to upgrade to a primary command node and cancel the command relationship between the upgraded secondary command node and the platform node. Then establish the command relationship between the upgraded secondary command node and the remaining secondary command nodes. If the damaged node type is a secondary command node, cancel the command relationship between the damaged node and the platform node.

[0009] Step 3: Locate the platform node that has lost command within the command and control system;

[0010] Step 4: Obtain the output value of each secondary command node with a status value of 1 for each platform node that lost command in Step 3;

[0011] Step 5: Perform initial allocation. During the initial allocation, each secondary command node with a status value of 1 selects the platform node with the highest value based on the output value obtained in Step 4. If the same platform node is selected by two or more secondary command nodes, the platform node is assigned to the secondary command node with the highest output value. If the output values ​​are the same, the platform node is assigned to the secondary command node with the smaller number.

[0012] Step 6: Based on the bid value of the secondary command nodes that did not win the bid for each unselected platform node, calculate the maximum and second-largest revenue values ​​for each unselected platform node, process the maximum and second-largest revenue values ​​to obtain the updated bid value, and use the updated bid value to update the bid value of the corresponding platform node.

[0013] Step 7: Calculate the sum of the maximum revenue values ​​of all unselected platform nodes. If the sum of the maximum revenue values ​​is positive, perform a secondary distribution and proceed to Step 8; if the sum of the maximum revenue values ​​is negative, end the distribution.

[0014] Step 8: Each secondary command node with a status value of 1 selects the platform node with the highest output value for command based on the output value of each platform node. If the same platform node is selected by two or more secondary command nodes, the platform node is assigned to the secondary command node with the highest output value. If the output values ​​are the same, the platform node is assigned to the secondary command node with the smaller number.

[0015] In step 8, the platform nodes include those that have been selected and those that have not been selected. The output value of the selected platform nodes is the output value in step 4, and the output value of the unselected platform nodes is the output value updated in step 6.

[0016] Step 9: Repeat steps 6-8 until all platform nodes are assigned secondary command nodes;

[0017] Step 10: Use the Hungarian algorithm to adjust the command relationship in the command and control system where all platform nodes are commanded by the secondary command node, and complete the dynamic adjustment of the command relationship in the event of command node loss.

[0018] In step 1, the nodes include command nodes and platform nodes. Command nodes are divided into primary command nodes and secondary command nodes. Platform nodes include sensor nodes and weapon nodes. Node information includes: node number, node type, node location coordinates, node command capability value, and node status value.

[0019] Among them, the node command capability value is the quantified value of the node command capability; the node state value is the current state of the node, and the initialized node state value is 1.

[0020] Command relationship information includes: the command relationship between primary command nodes and secondary command nodes, and the command relationship between secondary command nodes and platform nodes. The command relationship is represented by the adjacency matrix of the command and control system structure.

[0021] In step 2, when selecting a secondary command node to upgrade to a primary command node, the secondary command node must meet the following conditions: a large command capability value, close proximity to other secondary command nodes, and a small number of platform nodes currently under command.

[0022] In step 3, a platform node that has lost command is one in which the value of the column containing the platform node in the adjacency matrix is ​​0.

[0023] In step 4, the output value is:

[0024]

[0025] Suppose there are M platform nodes and N secondary command nodes, i = 1, 2, 3, ..., N, j = 1, 2, 3, ..., M;

[0026] Where, ρ i Let θ represent the number of platform nodes currently commanded by secondary command node i. i Let θ(TDM) be the command capability value of secondary command node i. ij () represents the command capability of secondary command node i over platform node j;

[0027] In step 6, the updated output value is:

[0028]

[0029] in, To maximize profit, The second largest profit value is given by ε, which is a constant value, ε>0;

[0030] In step 10, when adjusting the command relationship using the Hungarian algorithm, an efficiency matrix is ​​used for adjustment. The efficiency matrix is ​​a weighted sum of the adjustment cost function and the adjustment time function.

[0031] The adjustment cost function is:

[0032]

[0033] in, To adjust the command relationship between the secondary command node i and the platform node j, if the secondary command node i commands the platform node j, then otherwise

[0034] To adjust the command relationship between secondary command node i and platform node j, if secondary command node i commands platform node j, then otherwise

[0035] The time adjustment function is:

[0036] T j =deg(TDM) j )+deg'(TDM j )

[0037] Among them, deg(TDM) j ) represents the degree of platform node j before adjustment, deg'(TDM) j () represents the degree of platform node j after adjustment;

[0038] The degree of a vertex is the number of edges connecting it. The number of edges originating from a vertex is the out-degree of that vertex, and the number of edges ending at a vertex is the in-degree of that vertex. The sum of the out-degree and in-degree is the degree of that vertex.

[0039] The efficiency matrix is: X[i][j]=ω1NP ij trans +ω2T j , where ω1 is the adjustment cost coefficient and ω2 is the adjustment time coefficient.

[0040] Beneficial effects

[0041] (1) This invention divides the damage of command nodes into two situations: damage of primary command nodes and damage of secondary command nodes. In the case of damage of primary command nodes, the issue of upgrading and replacing secondary command nodes is considered first before adjusting the command relationship. In the case of damage of secondary command nodes, the command relationship is adjusted directly. This is consistent with actual combat situations and has strong applicability.

[0042] (2) This invention divides the command relationship adjustment into three sub-problems. First, it identifies the platform nodes that have lost command after the command node is damaged. Then, it redistributes decision-making authority for the platform nodes that have lost command, restoring topological connectivity. Finally, it adjusts the command and control structure to achieve dynamic optimization of command decision-making authority. This invention reduces the time complexity of the solution and improves the solution speed of the command relationship adjustment scheme.

[0043] (3) In the decision-making authority redistribution stage, the present invention continuously updates the value and allocates the optimal secondary decision-making node to each platform node that has lost command to the greatest extent, thereby improving the combat effectiveness of the command and control system. Attached Figure Description

[0044] Figure 1 Diagram showing the damage to a primary command node;

[0045] Figure 2 A diagram showing the adjustment results after the primary command node was damaged;

[0046] Figure 3 Diagram showing the damage to the secondary command node;

[0047] Figure 4 This is a diagram showing the adjustment results after the secondary command node was damaged. Detailed Implementation

[0048] The present invention will now be described in detail with reference to the accompanying drawings and embodiments.

[0049] Example 1

[0050] like Figure 1 and Figure 2 As shown, a method for dynamically adjusting command relationships in the event of command node damage is described. The command and control system includes one primary command node (ODM1), four secondary command nodes, and fifteen platform nodes. The steps of this method include:

[0051] Step 1: Initialize the information of each node in the command and control system and the command relationship information between each node. The four secondary command nodes are TDM1, TDM2, TDM3 and TDM4. The node command capability values ​​of TDM1, TDM2, TDM3 and TDM4 are 8, 9, 7 and 8 respectively, and the node status value is 1.

[0052] Step 2: The damaged node number obtained at the current moment is ODM1. Change the status value of ODM1 from 1 to 0, cancel the command relationship between the damaged node ODM1 and the secondary command nodes TDM1, TDM2, TDM3, and TDM4. Then select TDM2 to upgrade to the primary command node, cancel the command relationship between TDM2 and platform nodes P6, P7, and P8, and then establish the command relationship between TDM2 and TDM1, TDM3, and TDM4.

[0053] Step 3: The platform nodes that have lost command in the command and control system are P6, P7, and P8.

[0054] TDM1's command capabilities over P6, P7, and P8 are 16, 23, and 13, respectively.

[0055] TDM3's command capabilities over P6, P7, and P8 are 11, 14, and 12, respectively;

[0056] TDM4's command capabilities over P6, P7, and P8 are 17, 13, and 16, respectively.

[0057] Step 4: Obtain the output values ​​of TDM1 for P6, P7, and P8 as 1.375, 2.250, and 1.125, respectively;

[0058] The output values ​​of TDM3 to P6, P7, and P8 are 1.143, 1.571, and 1.286, respectively.

[0059] The output values ​​of TDM4 for P6, P7, and P8 are 1.625, 1.125, and 1.500, respectively.

[0060] Step 5: Assign P6 to TDM4 and P7 to TDM1;

[0061] Step 6: Based on the TDM3 that was not auctioned and the unselected P8, the maximum profit value for the unselected P8 is 1.500, and the second largest profit value is 1.286. The updated TDM3 to P8 offer value is 1.500.

[0062] Step 7: The sum of the maximum payouts of the unselected P8 is 1.500. Since the sum of the maximum payouts is a positive number, a secondary distribution is performed, and the process proceeds to Step 8.

[0063] Step 8: Assign P6 to TDM4 and P7 to TDM1;

[0064] Step 9: Repeat steps 6-8, and finally assign P6 to TDM4, P7 to TDM1, and P8 to TDM3;

[0065] Step 10: Use the Hungarian algorithm to adjust the command relationships in the command and control system where all platform nodes are commanded by secondary command nodes, and finally obtain the adjustment result as follows. Figure 2 As shown, the command relationship is dynamically adjusted in the event of battle damage to the command node.

[0066] Example 2

[0067] like Figure 3 and Figure 4 As shown, a method for dynamically adjusting command relationships in the event of command node damage is described. The command and control system includes one primary command node (ODM1), four secondary command nodes, and fifteen platform nodes. The steps of this method include:

[0068] Step 1: Initialize the information of each node in the command and control system and the command relationship information between each node. The four secondary command nodes are TDM1, TDM2, TDM3 and TDM4. The node command capability values ​​of TDM1, TDM2, TDM3 and TDM4 are 8, 9, 7 and 8 respectively, and the node status value is 1.

[0069] Step 2: The damaged node number obtained at the current moment is TDM4, and the status value of TDM4 is changed from 1 to 0, canceling the command relationship between TDM4 and platform nodes P12, P13, P14, and P15;

[0070] Step 3: The platform nodes that have lost command in the command and control system are P12, P13, P14, and P15.

[0071] TDM1's command capabilities over P12, P13, P14, and P15 are 15, 20, 18, and 14, respectively.

[0072] TDM2's command capabilities over P12, P13, P14, and P15 are 14, 20, 17, and 18, respectively.

[0073] TDM3's command capabilities over P12, P13, P14, and P15 are 18, 13, 16, and 12, respectively.

[0074] Step 4: Obtain the output values ​​of TDM1 for P12, P13, P14, and P15 as 1.250, 1.875, 1.625, and 1.125, respectively.

[0075] The output values ​​of TDM2 for P12, P13, P14, and P15 are 1.222, 1.889, 1.556, and 1.667, respectively.

[0076] The output values ​​of TDM3 for P12, P13, P14, and P15 are 2.143, 1.429, 1.857, and 1.286, respectively.

[0077] Step 5: Assign P12 to TDM3 and P13 to TDM1;

[0078] Step 6: Based on the TDM2 that was not auctioned and the unselected P14 and P15, the maximum profit value of the unselected P14 is 1.857, and the second largest profit value is 1.556. The updated TDM2's bid value for P14 is 1.788.

[0079] The maximum payoff for the unselected P15 is 1.667, the second largest payoff is 1.286, and the updated TDM2 payoff for P15 is 2.048.

[0080] Step 7: The sum of the maximum payout values ​​of the unselected P14 and P15 is 3.524. Since the sum of the maximum payout values ​​is a positive number, a secondary distribution is performed, and the process proceeds to Step 8.

[0081] Step 8: Assign P12 to TDM3, assign P13 to TDM1, and assign P15 to TDM2;

[0082] Step 9: Repeat steps 6-8, and finally assign P12 and P14 to TDM3, assign P13 to TDM1, and assign P15 to TDM2.

[0083] Step 10: Use the Hungarian algorithm to adjust the command relationships in the command and control system where all platform nodes are commanded by secondary command nodes, and finally obtain the adjustment result as follows. Figure 4 As shown, the command relationship is dynamically adjusted in the event of battle damage to the command node.

[0084] The above-disclosed embodiments are implemented under the premise of the technical solution of the present invention, and detailed implementation methods and specific operation processes are given. However, the protection scope of the present invention is not limited to the embodiments described. As can be seen from the above, many contents in the present invention can be modified and replaced. The fixed values ​​in this embodiment are only for better illustrating the principle and application of the present invention, so as to make it easier to understand and use. All partial modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solution of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for dynamically adjusting command relationships in the event of battle damage to command nodes, characterized in that... The steps of this method include: Step 1: Initialize the information of each node in the command and control system and the command relationship information between each node; Step 2: Obtain the damaged node number information in real time and change the status value of the acquired damaged node from 1 to 0. Then determine the type of the acquired damaged node. If the damaged node type is a primary command node, cancel the command relationship between the damaged node and the secondary command node. Then select one secondary command node to upgrade to a primary command node and cancel the command relationship between the upgraded secondary command node and the platform node. Then establish the command relationship between the upgraded secondary command node and the remaining secondary command nodes. If the damaged node type is a secondary command node, cancel the command relationship between the damaged node and the platform node. Step 3: Locate the platform node that has lost command within the command and control system; Step 4: Obtain the output value of each secondary command node with a status value of 1 for each platform node that lost command in Step 3; Step 5: Perform initial allocation. During the initial allocation, each secondary command node with a status value of 1 selects the platform node with the highest value based on the output value obtained in Step 4. If the same platform node is selected by two or more secondary command nodes, the platform node is assigned to the secondary command node with the highest output value. If the output values ​​are the same, the platform node is assigned to the secondary command node with the smaller number. Step 6: Based on the bid value of the secondary command nodes that did not win the bid for each unselected platform node, calculate the maximum and second-largest revenue values ​​for each unselected platform node, process the maximum and second-largest revenue values ​​to obtain the updated bid value, and use the updated bid value to update the bid value of the corresponding platform node. Step 7: Calculate the sum of the maximum revenue values ​​of all unselected platform nodes. If the sum of the maximum revenue values ​​is positive, perform a secondary distribution and proceed to Step 8; if the sum of the maximum revenue values ​​is negative, end the distribution. Step 8: Each secondary command node with a status value of 1 selects the platform node with the highest output value for command based on the output value of each platform node. If the same platform node is selected by two or more secondary command nodes, the platform node is assigned to the secondary command node with the highest output value. If the output values ​​are the same, the platform node is assigned to the secondary command node with the smaller number. In step 8, the platform nodes include those that have been selected and those that have not been selected. The output value of the selected platform nodes is the output value in step 4, and the output value of the unselected platform nodes is the output value updated in step 6. Step 9: Repeat steps 6-8 until all platform nodes are assigned secondary command nodes.

2. The method for dynamically adjusting command relationships in the event of battle damage to command nodes according to claim 1, characterized in that: After all platform nodes are assigned secondary command nodes, the Hungarian algorithm is used to adjust the command relationships in the command and control system where all platform nodes are commanded by secondary command nodes.

3. A method for dynamically adjusting command relationships in the event of battle damage to a command node, as described in claim 1 or 2, characterized in that: The nodes include command nodes and platform nodes. Command nodes are divided into primary command nodes and secondary command nodes. Platform nodes include sensor nodes and weapon nodes. Node information includes: node number, node type, node location coordinates, node command capability value, and node status value.

4. The method for dynamically adjusting command relationships in the event of battle damage to command nodes according to claim 3, characterized in that: The node command capability value is a quantified value of the node's command capability; the node state value is the current state of the node, and the initialized node state value is 1.

5. A method for dynamically adjusting command relationships in the event of battle damage to a command node, as described in claim 1 or 2, characterized in that: In step 1, the command relationship information includes: the command relationship between the primary command node and the secondary command node, and the command relationship between the secondary command node and the platform node. The command relationship is represented by the adjacency matrix of the command and control system structure.

6. A method for dynamically adjusting command relationships in the event of battle damage to a command node, as described in claim 1 or 2, characterized in that: In step 2, when selecting a secondary command node to upgrade to a primary command node, the secondary command node must meet the following conditions: a large command capability value, close proximity to other secondary command nodes, and a small number of platform nodes currently under command.

7. A method for dynamically adjusting command relationships in the event of battle damage to command nodes, as described in claim 1 or 2, characterized in that: In step 3, a platform node that has lost command is one in which the value of the column containing the platform node in the adjacency matrix is ​​0.

8. A method for dynamically adjusting command relationships in the event of battle damage to a command node, as described in claim 1 or 2, characterized in that: In step 4, the output value is: Suppose there are M platform nodes and N secondary command nodes, i = 1, 2, 3, ..., N, j = 1, 2, 3, ..., M; Where, ρ i Let θ represent the number of platform nodes currently commanded by secondary command node i. i Let θ(TDM) be the command capability value of secondary command node i. ij ) represents the command capability of the secondary command node i over the platform node j.

9. A method for dynamically adjusting command relationships in the event of battle damage to a command node, as described in claim 1 or 2, characterized in that: In step 6, the updated output value is: in, To maximize profit, The second largest return value is ε, which is a set constant, ε>

0.

10. A method for dynamically adjusting command relationships in the event of battle damage to command nodes, as described in claim 1, characterized in that: In step 10, when adjusting the command relationship using the Hungarian algorithm, an efficiency matrix is ​​used for adjustment. The efficiency matrix is ​​a weighted sum of the adjustment cost function and the adjustment time function. The adjustment cost function is: in, To adjust the command relationship between the secondary command node i and the platform node j, if the secondary command node i commands the platform node j, then otherwise To adjust the command relationship between secondary command node i and platform node j, if secondary command node i commands platform node j, then otherwise The time adjustment function is: T j =you(TDM j )+you'(TDM j ) Among them, deg(TDM) j ) represents the degree of platform node j before adjustment, deg'(TDM) j () represents the degree of platform node j after adjustment; The efficiency matrix is: X[i][j]=ω1NP ij trans +ω2T j , where ω1 is the adjustment cost coefficient and ω2 is the adjustment time coefficient.

Images