Complex simulation system whole process network fidelity calculation method

Through the full-process network fidelity calculation method, combined with the adversarial ability of the hypernetwork and OODA ring, dynamically evaluate the importance of each node and ring of a complex simulation system, solving the problem of the failure to accurately evaluate the dynamic changes of complex simulation systems in the existing technology. The fidelity problem achieves a more accurate simulation process evaluation.

CN118917100APending Publication Date: 2024-11-083RD GENERAL DESIGN DEPT CHINA AEROSPACE SCI & IND CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411092896.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-09
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

Existing complex simulation systems fail to fully consider the dynamic changes of the system when calculating network fidelity, resulting in inaccurate evaluation results.

Method used

The full-process network fidelity calculation method is used to calculate the fidelity and importance of each simulation moment of complex simulation systems, and combine the hypernetwork structure and the confrontation ability of OODA rings to dynamically evaluate the importance, thereby quickly and accurately assessing the network fidelity of the entire simulation process.

Benefits of technology

The accuracy and fidelity evaluation of complex simulation systems under dynamic changes is achieved, and the accuracy and objectivity of the evaluation are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917100A_ABST
    Figure CN118917100A_ABST
Patent Text Reader

Abstract

The invention relates to a whole-process network fidelity calculation method for a complex simulation system, belongs to the technical field of simulation, and solves the problem of inaccurate fidelity calculation in the prior art. The method comprises the following steps: for each simulation moment of a complex simulation system, calculating the fidelity of the system at the current simulation moment based on the fidelity of each simulation node; calculating the importance degree of each simulation moment of each simulation stage based on the key simulation moment of each simulation stage in the whole simulation process; and calculating the whole process network fidelity based on the fidelity of the system at each simulation moment and the importance of each simulation moment. Accurate and objective evaluation of the whole-process network fidelity of the complex simulation system is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of simulation technology, and in particular to a method for calculating the network fidelity of a complex simulation system throughout the entire process. Background Art

[0002] In the process of evolution, complex simulation system networks need to constantly observe and collect data, make directional adjustments to environmental changes, and make decisions and take actions based on this. The fidelity of the simulation system reflects a certain relationship between the simulation and the real world. However, due to the complexity of the real world, it is impossible to reproduce the entire simulation object during the simulation process, and it is impossible to calculate the fidelity by completely comparing the two. For complex simulation systems, an evaluation index system is usually built to evaluate fidelity through indicators. However, complex simulation systems are constantly changing during the simulation process, and the fidelity will also change over time. The existing methods do not take into account the dynamic changes of the system, so the fidelity evaluation results are inaccurate. Summary of the invention

[0003] In view of the above analysis, an embodiment of the present invention aims to provide a method for calculating the network fidelity of a complex simulation system throughout the entire process, so as to solve the problem of inaccurate fidelity calculation in existing methods.

[0004] On the one hand, an embodiment of the present invention provides a method for calculating the network fidelity of a complex simulation system in the whole process, comprising the following steps:

[0005] For each simulation moment of the complex simulation system, the fidelity of the system at the current simulation moment is calculated based on the fidelity of each simulation node;

[0006] Calculate the importance of each simulation moment in each simulation stage based on the key simulation moments in each simulation stage during the entire simulation process;

[0007] The whole process network fidelity is calculated based on the system fidelity at each simulation moment and the importance of each simulation moment.

[0008] Based on the further improvement of the above method, the importance of each simulation moment is calculated in the following way:

[0009] For each simulation phase, determine the initial importance of the key simulation moments of the simulation phase;

[0010] Calculating the initial importance of other simulation moments based on the distance between other simulation moments and the key simulation moment in the simulation phase;

[0011] The initial importance of each simulation moment in the simulation phase is normalized, and the final importance of each simulation moment is obtained based on the normalized importance and the weight of the simulation phase.

[0012] Based on the further improvement of the above method,

[0013] For each simulation stage, 1 / T0 is used as the initial importance of the key simulation moment of the simulation stage;

[0014] Based on the formula η i =1 / (T0+Δt i ) calculates the initial importance of other simulation moments in this simulation phase, where Δt i =|T0-t i |, T0 represents the key simulation moment of this simulation stage, t i Represents the i-th other simulation moment in this simulation phase.

[0015] Based on the further improvement of the above method, the whole process network fidelity is calculated based on the fidelity of the system at each simulation moment and the importance of each simulation moment in the following way:

[0016]

[0017] Among them, Ft i represents the fidelity of the system at the ith simulation moment, wt i represents the importance of the i-th simulation moment, y j It represents the fidelity of the ith node in the system at the current simulation moment, and TN represents the number of simulation moments.

[0018] Based on the further improvement of the above method, for each simulation moment of the complex simulation system, the fidelity of the system at the current simulation moment is calculated based on the fidelity of each simulation node using the following formula:

[0019]

[0020] Among them, Y represents the credibility of the system against the simulation system at the current moment, ω j represents the importance of the jth node in the system at the current moment, y j represents the credibility of the jth node in the system at the current moment, and M is the number of nodes in the system at the current moment.

[0021] Based on the further improvement of the above method, the importance of each node in the system at the current simulation time is obtained in the following way:

[0022] Constructing a hypernetwork structure of the current complex simulation system, searching for OODA loops based on the hypernetwork, and calculating the initial comprehensive confrontation capability of each OODA loop;

[0023] For each node, treat it as a failed node and update the super network based on the network cascade failure analysis; calculate the updated comprehensive confrontation capability of each OODA loop based on the updated super network;

[0024] Based on the initial comprehensive confrontation capability and the updated comprehensive confrontation capability of each OODA loop, the importance of the failed node is obtained.

[0025] Based on the further improvement of the above method, the importance of the failed node is calculated using the following formula:

[0026]

[0027]

[0028] in, Indicates that the i-th target node T i The initial comprehensive confrontation capability of the target j-th OODA loop, Indicates that the i-th target node T i The updated comprehensive confrontation capability of the target j-th OODA loop, Indicates that the i-th target node T i is the weight of the jth OODA loop of the target, Value(v) represents the importance of node v, N T represents the number of target nodes in the complex simulation system, Indicates the number of OODA loops where the i-th target node is located.

[0029] Based on the further improvement of the above method, the following formula is used to calculate the i-th target node T i The weight of the jth OODA loop of the target is:

[0030]

[0031] in, Represents the target node T i The weight of Indicates that the i-th target node T i The initial comprehensive confrontation capability of the j-th OODA loop of the target.

[0032] Based on the further improvement of the above method, the initial comprehensive confrontation capability of each OODA loop is calculated in the following way:

[0033]

[0034] Among them, P op represents the target damage probability of the OODA loop, Q oprepresents the stability of the topological structure of the OODA loop, w1 and w2 represent the weights of the target damage probability and topological structure stability of the OODA loop respectively.

[0035] Based on the further improvement of the above method, the following formula is used to calculate the target damage probability of the OODA loop:

[0036]

[0037] Among them, P Ai represents the comprehensive damage probability of the i-th action node in the OODA loop to the target node in the OODA loop, and k represents the number of action nodes in the OODA loop;

[0038] The following formula is used to calculate the comprehensive damage probability of the action node to the target node in the OODA loop:

[0039] P A =P S→D ×P D→A ×P h ×P d

[0040] Among them, P S→D Indicates the quality of target intelligence information received by the action node, P D→A Indicates the correctness of the accusation information received by the action node, P h represents the probability of the action node hitting the target node in the OODA loop, P d represents the conditional damage probability of the action node to the target node, P A Represents the comprehensive damage probability of the action node to the target node in the OODA loop.

[0041] Compared with the prior art, the present invention calculates the fidelity of the system at each simulation moment according to the fidelity of the simulation nodes, and then calculates the importance of each simulation moment, that is, the weight. Based on the fidelity of the system at each simulation moment and the corresponding importance, the network fidelity of the entire simulation process can be quickly and accurately evaluated.

[0042] In the present invention, the above-mentioned technical solutions can also be combined with each other to achieve more preferred combination solutions. Other features and advantages of the present invention will be described in the subsequent description, and some advantages can become obvious from the description, or can be understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained through the contents particularly pointed out in the description and the drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings are only used for the purpose of illustrating specific embodiments and are not to be considered as limiting the present invention. In the entire drawings, the same reference symbols represent the same components;

[0044] Figure 1 The present invention is a flowchart of a method for calculating the network fidelity of a complex simulation system throughout the entire process. DETAILED DESCRIPTION

[0045] The preferred embodiments of the present invention are described in detail below in conjunction with the accompanying drawings, wherein the accompanying drawings constitute a part of this application and are used together with the embodiments of the present invention to illustrate the principles of the present invention, but are not used to limit the scope of the present invention.

[0046] A specific embodiment of the present invention discloses a method for calculating the network fidelity of a complex simulation system in the whole process, such as Figure 1 As shown, the following steps are included:

[0047] S1. For each simulation moment of the complex simulation system, the fidelity of the system at the current simulation moment is calculated based on the fidelity of each simulation node;

[0048] S2, calculating the importance of each simulation moment of each simulation stage based on the key simulation moments of each simulation stage in the whole simulation process;

[0049] S3. The whole process network fidelity is calculated based on the fidelity of the system at each simulation moment and the importance of each simulation moment.

[0050] It should be noted that the complex simulation system is, for example, a system confrontation simulation system.

[0051] Compared with the prior art, the method for calculating the network fidelity of the entire process of a complex simulation system provided in this embodiment calculates the fidelity of the system at each simulation moment based on the fidelity of the simulation nodes, and then calculates the importance of each simulation moment, that is, the weight. Based on the fidelity of the system at each simulation moment and the corresponding importance, the network fidelity of the entire simulation process can be quickly and accurately evaluated.

[0052] There are four types of nodes in the complex simulation system: sensor nodes S, which are used to collect raw situation information, process situation information to generate intelligence information, such as radars and reconnaissance satellites; command and control nodes D, which make decisions based on intelligence information, specify confrontation plans, and command and control confrontation activities. The command and control center is the command and control node; action nodes, which receive command and control information and intelligence information, execute decisions, and influence targets; target nodes, which are the confrontation targets in the system confrontation simulation system.

[0053] Specifically, in step S1, the fidelity of the system at the current simulation moment is calculated based on the fidelity of each simulation node in the following manner:

[0054]

[0055] Among them, Y represents the fidelity of the system at the current simulation time, ω j represents the importance of the jth node in the system at the current simulation time, y j It represents the fidelity of the jth node in the system at the current simulation moment, and M is the number of nodes in the system at the current moment.

[0056] During implementation, the fidelity of each node can be evaluated based on the simulation data of each node using an existing simulation fidelity evaluation method.

[0057] As the simulation system continues to change, the importance of each node will change, and its contribution to the fidelity of the entire system will also change. Therefore, it is necessary to calculate the importance of each node in the system at each simulation moment, so as to more objectively evaluate the fidelity of the system.

[0058] Specifically, the importance of each node in the system at the current simulation time is obtained in the following way:

[0059] S11, constructing a hypernetwork structure of the complex simulation system at the current moment, searching for OODA loops based on the hypernetwork, and calculating the initial comprehensive confrontation capability of each OODA loop;

[0060] S12, for each node, treat it as a failed node, and update the super network based on the network cascade failure analysis; calculate the updated comprehensive confrontation capability of each OODA loop based on the updated super network;

[0061] S13. Based on the initial comprehensive confrontation capability and the updated comprehensive confrontation capability of each OODA loop, the importance of the failed node is obtained.

[0062] As a complex network organization structure, the hypernetwork can connect and interact multiple subnetworks to form a larger and more complex network system. This form of network organization can provide more powerful, flexible and collaborative functions, and is suitable for application scenarios that require scale expansion and functional integration. Modeling the system confrontation simulation system based on the hypernetwork theory can overcome the limitations of general complex network models in modeling and characterizing the network structure and functional characteristics of the simulation system. During implementation, the hypernetwork modeling idea is used to construct the hypernetwork of the system confrontation simulation system in accordance with the principle of "units are condensed into points, relationships are abstracted into edges, and systems are transformed into networks."

[0063] During implementation, each simulation entity in the simulation system is a node in the super network. The relationship between entities is abstracted as an edge in the network. The simulation entities in the simulation system are of different types, and nodes of the same type are divided into a network, and the networks are coupled to form a super network.

[0064] In a complex simulation system, a simulation entity may have multiple node types. For example, an airborne early warning aircraft can not only conduct reconnaissance and surveillance activities on the battlefield environment, but also serve as a command and control center to command and control related confrontation activities. This type of node is called a composite node. The multiple functions of a node may lead to multiple associations between the same node pair, which is not conducive to a clear description of the specific functions of the node in the confrontation process. In view of this situation, based on the idea of ​​super-network, the composite node is abstracted into multiple network nodes according to its function for description during implementation. For example, the airborne early warning aircraft can be abstracted into a sensor node S and a command and control node D to describe its reconnaissance and surveillance capabilities and command and control capabilities respectively.

[0065] During implementation, the interaction edges in the complex simulation system include: the reconnaissance and surveillance link T→S for sensor nodes to monitor target nodes and collect target intelligence, the target intelligence sharing link S→S between sensor nodes, the intelligence support link S→D for sensor nodes to send target intelligence information to command nodes, the intelligence support link S→A for sensor nodes to send target intelligence information to action nodes, the collaborative decision-making link D→D for intelligence sharing and decision-making collaboration between command nodes at the same level, the command and control link D→D for upper-level command nodes to send command information to their lower-level command nodes, the command and control link D→A for command and control nodes to send command information to action nodes, and the damage link A→T for action nodes to carry out physical attacks or electronic interference on target nodes.

[0066] Nodes in different networks are connected through these links to form a super network. The node set V in the constructed super network is expressed as: V = {S, D, A, T}.

[0067] in, represents the set of sensor nodes in the simulation system, N s Indicates the number of sensor nodes; Represents the collection of accusation nodes, N D Indicates the number of accusation nodes; Represents the set of action nodes, N A Indicates the number of action nodes; Represents the target class node set in the simulation system, N T Indicates the number of target class nodes.

[0068] According to the connection relationship between each node, the edges in the hypernetwork are constructed to obtain the adjacency matrix X of the hypernetwork.

[0069] After the hypernetwork is constructed, search for the OOAD loop in the hypernetwork. OODA refers to an adversarial cycle model composed of observation (Obeserve) - judgment (Orient) - decision (Decide) - action (Act), which is used to describe the entire process of adversarial action. In the OODA cycle, information flow plays a vital role, and information flow is constantly circulating in the OODA cycle. Each cycle collects information through observation, forms new actions through positioning and decision-making, and then observes the results again, and then adjusts and updates the collection and analysis of information to form new decisions and actions. The rapidity and flexibility of this cycle make the OODA cycle an effective decision-making model for dealing with complex and dynamic environments.

[0070] According to the OODA loop concept diagram, the completion process of a confrontation mission can be regarded as a cycle, and the process can be briefly described as follows: the reconnaissance and surveillance simulation entity S obtains information about the enemy target, and transmits this information to our command center D through the communication relationship between entities. The command center D processes and analyzes the information obtained, and makes a decision by comprehensively considering the current confrontation situation and the strength of both sides, and issues an action order to the action simulation entity A. After receiving the order, A immediately takes corresponding confrontation measures against the enemy target T. In order to complete a specific confrontation mission, it is necessary to build one or more closed loops formed by the reconnaissance and surveillance entity S, command and control entity D, action entity A, and enemy target entity T in our system, and ensure that these loops can complete their respective confrontation tasks with the highest possible stability.

[0071] The OODA loop in the present invention is an OODA loop in which the starting node and the ending node are the same node and the node type is also a target node. Taking the typical OODA loop in the confrontation process: T→S→D→A→T as an example, the OODA loop indicates that the red party target node is discovered by the blue party reconnaissance node, and the blue party reconnaissance node transmits effective information to the command node through information transmission. The command node processes and analyzes the information and issues a confrontation command to the action node. Finally, the action node implements the confrontation process on the red party target node. Table 1 shows the OODA loop in the present invention.

[0072] Table 1 OODA loop and its meaning

[0073]

[0074]

[0075] The rapid and effective extraction of OODA loops in the simulation system hypernetwork is the basis for evaluating the importance of nodes based on OODA loops. From the perspective of graph theory, the OODA loop search problem can be described as a subgraph isomorphism problem. In implementation, the VF3 algorithm can be used to search for OODA loops in the hypernetwork.

[0076] On the basis of successful extraction of OODA loop, a reasonable and effective evaluation of its confrontation capability is the premise of evaluating the importance of hypernetwork nodes based on OODA loop. The confrontation capability of OODA loop is mainly reflected in two aspects: 1) the ability of OODA loop to damage enemy targets; 2) the ability of OODA loop to maintain its confrontation capability, that is, the stability of OODA loop topology.

[0077] Under uncertainty, the damage capability of an OODA loop can be expressed as its probability of damage to the enemy target P op The comprehensive probability of damage to the target node by an action node in the OODA loop depends on four factors: 1) The quality of the target intelligence information received by the action node P S→D ; 2) The accuracy of the superior's accusation information D→A ; 3) Under the condition that the target information is completely determined and the superior accusation information is completely correct, the probability P of the action node hitting the target node h ; 4) Under the condition of hitting the target node, the probability P of the action node destroying the target node d .

[0078] Therefore, for a certain action node in a certain OODA loop, the comprehensive probability of damaging the target node in the OODA loop is:

[0079] P A =P S→D ×P D→A ×P h ×P d (2)

[0080] Where k represents the number of action nodes in the OODA loop, P S→D Indicates the quality of target intelligence information received by the action node, P D→A Indicates the correctness of the accusation information received by the action node, P h represents the probability of the action node hitting the target node in the OODA loop, P d It represents the conditional damage probability of the action node to the target node, that is, the probability that the target node will be damaged when the action node hits the target node in the OODA loop.

[0081] Among them, the hit probability P of the action node to the target node h Including the probability P′ that the action node hits the target node by physical attack h and the probability P″ that the action node hits the target node through electronic interference h The conditional damage probability P of the action node to the target node h It consists of two parts: the conditional damage probability P′ of the action node destroying the target through physical attack dand the conditional damage probability P of the action node destroying the target through electronic interference d "And there are

[0082] P h =1-(1-P h′ )(1-P h″ ) (3)

[0083] P d =1-(1-P d′ )(1-P d″ ) (4)

[0084] Among them, P h′ P represents the probability of the action node hitting the target node by physical attack, that is, under the condition that the target information is completely determined and the superior accusation information is completely correct, h″ It represents the probability that the action node hits the target node through electronic interference, that is, under the condition that the target information is completely determined and the superior command information is completely correct. d′ P represents the conditional damage probability of the action node to the target node through physical attack, that is, the probability of the action node damaging the target under the condition that the action node hits the target based on physical attack, d″ The conditional probability of an action node damaging a target node through electronic interference is the probability of the action node damaging the target under the condition that the action node hits the target based on electronic interference.

[0085] The higher the strike accuracy of the action node, the smaller the circular probability deviation, the smaller the area of ​​the strike concentration area, and if the strike area of ​​the target node is larger, the greater the hit probability; the lower the strike accuracy of the action node, the greater the circular probability deviation, the larger the area of ​​the strike concentration area, and if the strike area of ​​the target node is smaller, then it is more difficult for the action node to hit the target node, that is, the lower the hit probability. When the area of ​​the strike concentration area is smaller than the target strike area, it means that the action node will definitely hit the target, that is, the hit probability is 1; when the area of ​​the strike concentration area is larger than the target strike area, the probability of the action node hitting the target depends on the ratio of the target strike area to the area of ​​the strike concentration area. In summary, the relationship between the hit probability of the action node on the target node and its strike accuracy and the strike area of ​​the target node can be described as follows in the following mathematical form:

[0086]

[0087] Among them, τ is the state quantity that describes whether the target node is out of the physical strike range of the action node after the early warning maneuver, Indicates the strike accuracy of the action node, namely the circular error probability (CEP); Indicates the area of ​​the action node's strike concentration area. The smaller the area, the higher the strike accuracy. Indicates the hit area of ​​the target node. AT represents the initial distance between the action node A and the target node T, which can be calculated using the traditional distance calculation formula between two points; and respectively Indicates the maneuvering speed and warning time of the target node; Indicates the effective range of the action node.

[0088] Under the condition of hitting the target, the probability of an action node damaging the target is the probability that its opponent falls into the vulnerable area of ​​the target. Therefore, the conditional damage probability of an action node can be expressed as:

[0089]

[0090] in, Indicates the power of the action node against the unit, with a value range of [0,1]; It represents the sequence of vulnerable areas of target nodes when facing attacks from countermeasures with different powers; Indicates that the target node faces a force of The relative vulnerable area when confronted with the part.

[0091] The probability P″ of an action node hitting the target under electronic jamming h Expressed as

[0092]

[0093] Among them, τ is the state quantity that describes whether the target node is out of the electronic interference range of the action node after the early warning maneuver,

[0094] Indicates the interference frequency band range of the action node, Refers to the target's operating frequency band, Indicates the overlap between the target working frequency band and the action node interference frequency band; Indicates the interference radius of the action node.

[0095] Under the condition of hitting the target, since the present invention mainly considers active suppression interference, its essence is the confrontation between the power of the enemy and the friend. Therefore, the conditional damage probability of the action node to the target node is mainly related to the interference power of the action node and the transmission power of the target node. The ratio of the interference power of the action node to the maximum transmission power of the target node is called the suppression coefficient of the action node to the target node, denoted as ρ, then

[0096]

[0097] in, represents the interference power of the action node; Represents the maximum transmission power of the target node. The suppression coefficient determines the effect of suppressive electronic interference to a certain extent. Therefore, for the convenience of research, the conditional damage probability P″ of the action node to the target node under electronic interference can be d Description as follows

[0098]

[0099] Among them, ρ represents the suppression coefficient of the action node on the target node; ρ min Represents the minimum suppression coefficient that can interfere with the target node; ρ max It represents the minimum suppression coefficient that makes the target node lose its ability to resist 100%. min When ρ>ρ, the action node cannot effectively interfere with the target, and the conditional damage probability is 0; max When ρ , the action node completely suppresses the target node, causing the target node to lose its confrontation ability. At this time, the conditional damage probability is 1. min ≤ρ≤ρ max When the suppression coefficient increases, the action node can produce effective electronic interference to the target node, and the probability that the target node loses its confrontation capability increases with the increase of the suppression coefficient.

[0100] Therefore, it is necessary to reasonably evaluate the quality of the target intelligence information received by each action node in the OODA loop. S→D , and the correctness of the accusation information issued by each accusation node P D→A , is the key to describing the destructive capability of the OODA loop.

[0101] The target intelligence information received by the action node is actually the target intelligence information obtained by the sensor node that provides intelligence information support for the action node. The target intelligence information obtained by the sensor node comes from its reconnaissance and monitoring process of the target node on the one hand, and from the intelligence sharing process between sensor nodes on the other hand. Before the sensor nodes share the target intelligence information, the probability of each sensor node detecting and identifying the target node can be obtained. The calculation of the sensor node identification probability can be obtained by referring to the relevant industry standards of the corresponding equipment of each sensor node. This represents the quality of the target intelligence information obtained by each sensor node.

[0102] Through intelligence sharing, each sensor node can obtain the target intelligence information of other sensor nodes. By fusing the target intelligence information from multiple sensor nodes, more accurate, reliable and complete estimation and judgment of target attributes such as target location, state estimation and identity description can be obtained. However, on the other hand, as the number of intelligence sharing increases, the intelligence sharing time continues to grow, and the timeliness of information will gradually decrease, resulting in a decrease in the quality of the final target intelligence information. It can be seen that in the process of intelligence sharing, the information fusion capability of the sensor node and the total duration of the intelligence sharing process jointly determine the quality of the target intelligence information finally obtained by each sensor node. Among them, the information fusion capability mainly represents the ability of the sensor node to mine useful information from the target intelligence information of other nodes. The information fusion capability is only represented by the utilization rate of the sensor node to the intelligence information of other sensor nodes. The information utilization rate is usually obtained by the ratio of the utilized information to the total amount of information obtained, and the value range is 0-1; on the other hand, since the intelligence sharing link represents the intelligence sharing process between two sensor nodes, the number of intelligence sharing links in the OODA loop can represent the total duration of the intelligence sharing process. Based on the above analysis, the intelligence sharing process between two sensor nodes can be described as follows.

[0103] Assume that the sensor node S i and S j There is a monitoring relationship between the two sensor nodes and the target node T, and the target intelligence information is shared between the two sensor nodes. Assume that before sharing, the probability of each sensor node detecting and identifying the target node is P T→Si and P T→Sj , after sharing the target intelligence information, the probability of each sensor node detecting and identifying the target node is as follows:

[0104]

[0105]

[0106] in, and After sharing intelligence, the sensor nodes S i and S j The probability of detecting and identifying the target node T; and They represent the sensor nodes S i and S j information fusion capability, that is, information utilization rate.

[0107] On this basis, the impact of intelligence sharing duration on the quality of intelligence information must also be considered.

[0108] It should be noted that the quality of the target intelligence information received by the action node is P S→DIt is the quality of the target intelligence information obtained by the last sensor node in the current OODA loop.

[0109] Based on this, the quality P of the target intelligence information obtained by the sensor nodes in the OODA loop after intelligence sharing can be calculated. S→D :

[0110]

[0111]

[0112] Among them, the i-th sensor node is the last sensor node in the OODA loop that sends target intelligence information to the accusation node. represents the information utilization rate of the i-th sensor node, R(S i ) represents the serial number set of sensor nodes that share intelligence with the i-th sensor node, represents the probability of the i-th sensor node detecting and identifying the target node, It represents the probability that the i-th sensor node detects and identifies the target node after the intelligence sharing process; λ1 represents the attenuation coefficient of the timeliness of intelligence information. The smaller λ1 is, the faster the attenuation speed of the timeliness of information is; It represents the number of intelligence sharing links in the OODA loop, which to a certain extent represents the duration of the intelligence sharing process.

[0113] For example, if the OODA loop is T→S→S→D→S→D→A→T, then the third sensor node is the last sensor node in the loop to send target intelligence information to the command node.

[0114] In the individual decision-making process, the correctness of the accusation information output by the accusation node is P D It can be expressed as:

[0115]

[0116] in, Indicates the superior accusation node D of the control node D up The correctness of the output accusation information is that when the accusation node is the highest accusation node in its OODA loop, That is, when l D =1, P D =P S→D ×η D ;P S→D Indicates the quality of target intelligence information received by the action node; η DIt represents the information utilization capability of the command node D in the current state. The value range is 0-1. The information utilization capability can be approximately calculated according to the task difficulty coefficient. The collaborative decision-making process between the command nodes at the same level is similar to the intelligence sharing process between the sensor nodes. The only difference is that what is shared between the command nodes is the decision opinions of each command node on the same confrontation task, which is essentially the sharing of knowledge. Therefore, the collaborative decision-making process between the command nodes at the same level can be described by analogy with the modeling idea of ​​the intelligence sharing process. Similar to the intelligence sharing process between sensor nodes, the information utilization capability in the collaborative decision-making process is an important factor in determining the correctness of the command information output by each command node. In addition, since the confrontation situation changes rapidly, if the decision-making time is too long, the decision made at the previous moment may not be applicable to the confrontation situation at the current moment, thus missing the opportunity for confrontation. Therefore, the impact of the duration of the collaborative decision-making process on the correctness of the command information must be considered. Since the collaborative decision-making link represents the collaborative decision-making relationship between the command nodes, the number of collaborative decision-making links between the command nodes at the same command level can be used to represent the duration of the collaborative decision-making process between the command nodes at this level.

[0117] Assume that the two command nodes D1 and D2 in the OODA loop can make collaborative decisions, and the information utilization capabilities of the two command nodes in the current state are and After individual decision-making, the correctness of the results output by each command node is and Then after collaborative decision-making, the correctness of the accusation information output by each accusation node is:

[0118]

[0119]

[0120] in, and They respectively represent the correctness of the accusation information output by the accusation nodes D1 and D2 after collaborative decision-making.

[0121] On this basis, considering the impact of the duration of the collaborative decision-making process on the correctness of the accusation information, the final correctness of the accusation information output by each accusation node can be obtained.

[0122] It should be noted that the correctness of the accusation information received by the action node is the correctness of the accusation information output by the last accusation node to send the accusation information, which is specifically expressed as follows:

[0123]

[0124]

[0125] in, Indicates the correctness of the initial output charge information of the i-th charge node, Indicates the charge node D i (D i ∈D op ) After the collaborative decision-making process, the final correctness of the output accusation information, represents the correctness of the initial output accusation information of the jth accusation node, λ2 represents the attenuation coefficient of the timeliness of the accusation information, the smaller λ2 is, the faster the timeliness of the information decays; represents the number of collaborative decision-making links in the corresponding command level in the OODA loop, represents the information utilization capability of the ith accusation node, R(D i ) represents the serial number set of the accusation nodes that make collaborative decisions with the ith accusation node. i It is the last charging node to send charging information to the action node.

[0126] For example, if the OODA loop is T→S→S→D→S→D→A→T, then the second sensor node is the last sensor node in the loop to send target intelligence information to the command node.

[0127] The target damage probability P of any OODA loop op It can be calculated using the following formula:

[0128]

[0129] Among them, P Ai represents the comprehensive damage probability of the i-th action node in the OODA loop to the target node in the OODA loop, and k is the number of action nodes in the OODA loop.

[0130] The adversarial capability of the OODA loop is closely related to the properties of all nodes and edges in the loop. Therefore, maintaining the stability of the topological structure of the OODA loop is the basic condition for maintaining its adversarial capability. The OODA loop consists of four types of nodes, namely target nodes, sensor nodes, command nodes and action nodes, as well as many edges between nodes. The stability of its topological structure is inseparable from the stability of every node and every edge in the loop.

[0131] Since the target node is the object of the OODA loop, its stability is regarded as 1. Therefore, the stability of the sensor node, the command node and the action node in the OODA loop is mainly analyzed. There are two main factors affecting node stability: internal factors and external factors. Among them, internal factors mainly refer to the impact of internal fault factors of the node on the stability of the node; while external factors refer to the impact of the correlation between nodes on the stability of the node, and the latter is mainly considered here. When the node remains stable internally, whether the material resource demand of the node is adequately guaranteed is the main factor affecting its stability. Therefore, the present invention measures the stability of the node by the material guarantee strength of the simulation system for each node. According to the material guarantee needs of the node and the guarantee capabilities of the material guarantee department, the stability of each node can be described as follows:

[0132]

[0133] Among them, Q i Represents the stability of the i-th node in the OODA loop, Indicates the strength of the jth material of the i-th node in the OODA loop. In a special ideal situation, the material guarantee of the i-th node is sufficient, indicating that the i-th node does not need any material resource guarantee, that is, its stability Q i =1.

[0134] The communication link is used to characterize the static connection relationship between nodes. Therefore, when the nodes at both ends are not failed, the stability of the communication link is considered to be 1. The OODA loop mainly involves 7 types of links, namely, reconnaissance and surveillance links, intelligence sharing links, intelligence support links, command and control links, collaborative decision-making links, status reporting links, and damage links. Once the OODA loop is formed, the reconnaissance and surveillance relationship and damage relationship of other nodes in the loop to the target node are established and unchanged. Therefore, the stability of the reconnaissance and surveillance link and the damage link is considered to be 1. In addition, the intelligence sharing link, intelligence support link, command and control link, collaborative decision-making link, and status reporting link all characterize the information interaction relationship between nodes, which is essentially the information transmission process between nodes. Therefore, the stability of the above 5 types of links mainly depends on the information transmission capacity between the nodes at both ends. The number of effective communication paths between nodes is an effective indicator to characterize the stability of information interaction between nodes. Therefore, the stability calculation method of the information interaction link is as follows.

[0135]

[0136] Among them, Q ij represents the stability of the link between the i-th node and the j-th node, and α represents the coefficient of the influence of the number of effective communication paths between nodes in the OODA loop on the stability of the link, CL ijIt represents the number of valid communication paths between the i-th node and the j-th node of the OODA loop.

[0137] For an OODA loop, its topological stability Q op It is expressed as:

[0138]

[0139] Among them, Q i Indicates the stability of the i-th node in the OODA loop, with a value range of [0,1]; N op Indicates the number of nodes in the OODA loop; Q ij represents the link l between the i-th node and the j-th node ij The stability of the value range is [0,1], and when l ij = 0, Q i =1.

[0140] Then, the initial comprehensive confrontation capability of each OODA loop is calculated in the following way:

[0141]

[0142] Among them, P op represents the target damage probability of the OODA loop, Q op represents the stability of the topological structure of the OODA loop, w1 and w2 represent the weights of the target damage probability and topological structure stability of the OODA loop respectively.

[0143] After obtaining the comprehensive importance of the OODA loop, to evaluate the importance of a certain node in it, we can refer to the idea of ​​node deletion and describe it by the changes in the comprehensive confrontation capability of the OODA loop of the entire network before and after deleting the node (even if the node fails).

[0144] Considering the characteristics of the simulation system, we cannot only delete the nodes to be evaluated and the edges directly connected to the nodes to be evaluated, which is likely to lead to a low final evaluation result, because the failure of some nodes may cause cascading failures of other nodes and edges. Therefore, in order to achieve a comprehensive and effective evaluation of node value, it is necessary to perform cascading failure analysis on the hypernetwork of the simulation system.

[0145] After deleting the nodes to be evaluated, the relevant failed nodes are analyzed through cascading failure analysis, and then these nodes and directly connected edges are deleted from the super network to update the super network. The updated comprehensive confrontation capability of each OODA loop is calculated based on the updated super network. It should be noted that if an OODA loop has a failed node, the comprehensive confrontation capability of the OODA loop is considered to be 0. Otherwise, its comprehensive confrontation capability is re-evaluated according to the above process to obtain the updated comprehensive confrontation capability.

[0146] According to the comprehensive confrontation capabilities of each OODA loop before and after the node v to be evaluated is deleted, the support degree of the node to be evaluated for each OODA loop can be calculated, which is expressed as follows:

[0147]

[0148] in, Indicates the node v to be evaluated with the i-th target node T i is the support of the jth OODA loop of the target, Indicates that the i-th target node T i The initial comprehensive confrontation capability of the target j-th OODA loop, Indicates that the i-th target node T i The updated comprehensive confrontation capability of the target j-th OODA loop.

[0149] Based on the support of the node v to be evaluated for each OODA loop, the importance evaluation result of the node to be evaluated is obtained:

[0150]

[0151] in, Indicates the node v to be evaluated with the i-th target node T i is the support of the jth OODA loop of the target, Indicates that the i-th target node T i is the weight of the jth OODA loop of the target, Value(v) represents the importance evaluation result of node v, Indicates that the i-th target node T i is the number of the jth OODA loop of the target, N T Indicates the number of target nodes.

[0152] Take the i-th target node T i The weight of the j-th OODA loop for the target is:

[0153]

[0154] in, Represents the target node T i The weight of Indicates that the i-th target node T i The jth OODA loop for the target Initial comprehensive confrontation capability. It can be evaluated by existing methods such as expert scoring.

[0155] During implementation, each node can be deleted in turn, and the importance of the node can be evaluated based on the changes in the comprehensive confrontation capability of the OODA loop in the network before and after deleting the node.

[0156] As the system confrontation simulation system continues to change, the importance of each node will change. The fidelity of the system at each moment can be calculated by formula (1).

[0157] The network fidelity of the entire simulation system process is a comprehensive consideration of the system fidelity at each simulation moment. The fidelity of each simulation moment has different effects on the fidelity of the entire simulation process of the system.

[0158] The whole simulation process includes one or more simulation stages, each simulation stage has at least one key simulation moment, and the importance of each simulation moment of each simulation stage is calculated based on the key simulation moment of each simulation stage in the whole simulation process.

[0159] Specifically, the importance of each simulation moment is calculated in the following way:

[0160] For each simulation phase, determine the initial importance of the key simulation moments of the simulation phase;

[0161] Calculating the initial importance of other simulation moments based on the distance between other simulation moments and the key simulation moment in the simulation phase;

[0162] The initial importance of each simulation moment in the simulation phase is normalized, and the final importance of each simulation moment is obtained based on the normalized importance and the weight of the simulation phase.

[0163] Specifically, for each simulation stage, 1 / T0 is used as the initial importance of the key simulation moment of the simulation stage;

[0164] Based on the formula η i =1 / (T0+Δt i ) calculates the initial importance of other simulation moments in this simulation phase, where Δt i =|T0-t i |, T0 represents the key simulation moment of this simulation stage, t i Represents the i-th other simulation moment in this simulation phase.

[0165] During implementation, the critical simulation moments of the simulation phase can be manually specified or determined by evaluating the simulation results using existing methods.

[0166] For example, if the critical simulation moment of a simulation stage is T0, its initial importance is determined as 1 / T0, and the other moments of the simulation stage are represented as t={t1, t2, …, t n}, then the initial importance of the i-th other simulation moment can be calculated as:

[0167] η i =1 / (T0+Δt i ) (27)

[0168] Among them, Δt i =|T0-t i |.

[0169] Obviously, according to the definition, the closer to time T0, the greater the importance, and the farther away, the lower the importance, which is in line with the actual situation.

[0170] After obtaining the initial importance at each moment in the simulation stage, the initial importance is normalized:

[0171]

[0172] Among them, nt s represents the number of simulation moments in the sth simulation stage, wt i Represents the normalized importance.

[0173] Based on the normalized importance and the weight of the simulation stage, the final importance wt of each simulation moment is obtained. i =wt i ×β s , where β s represents the weight of the sth simulation stage.

[0174] Based on the fidelity of the system at each simulation moment and the importance of each simulation moment, the following formula is used to calculate the network fidelity of the entire process:

[0175]

[0176] Among them, Ft i represents the fidelity of the system at the ith simulation moment, wt i represents the importance of the i-th simulation moment, y j It represents the fidelity of the ith node in the system at the current simulation moment, and TN represents the number of simulation moments.

[0177] Based on the system fidelity and corresponding importance at each simulation moment, the network fidelity of the entire simulation process can be quickly and accurately evaluated.

[0178] Those skilled in the art will appreciate that all or part of the processes of the above-mentioned embodiments can be implemented by instructing related hardware through a computer program, and the program can be stored in a computer-readable storage medium, wherein the computer-readable storage medium is a disk, an optical disk, a read-only storage memory, or a random access memory, etc.

[0179] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by any technician familiar with the technical field within the technical scope disclosed by the present invention should be covered within the protection scope of the present invention.

Claims

1. A method for calculating the network fidelity of a complex simulation system throughout the entire process. It is characterized in that The following steps are involved: For each simulation moment of the complex simulation system, the fidelity of the system at the current simulation moment is calculated based on the fidelity of each simulation node; Calculate the importance of each simulation moment in each simulation stage based on the key simulation moments in each simulation stage during the entire simulation process; The whole process network fidelity is calculated based on the system fidelity at each simulation moment and the importance of each simulation moment.

2. According to the method for calculating the whole process network fidelity of a complex simulation system as described in claim 1, It is characterized in that The importance of each simulation moment is calculated as follows: For each simulation phase, determine the initial importance of the key simulation moments of the simulation phase; Calculating the initial importance of other simulation moments based on the distance between other simulation moments and the key simulation moment in the simulation phase; The initial importance of each simulation moment in the simulation phase is normalized, and the final importance of each simulation moment is obtained based on the normalized importance and the weight of the simulation phase.

3. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 2, It is characterized in that For each simulation stage, 1 / T 0 The initial importance of the critical simulation moments as part of this simulation phase; Based on the formula η i =1 / (T 0 +Δt i ) calculates the initial importance of other simulation moments in this simulation phase, where Δt i =|T 0 -t i |, T 0 represents the critical simulation moment of this simulation phase, t i Represents the i-th other simulation moment in this simulation phase.

4. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 1, It is characterized in that The whole process network fidelity is calculated based on the fidelity of the system at each simulation moment and the importance of each simulation moment in the following way: Among them, Ft i represents the fidelity of the system at the ith simulation moment, wt i represents the importance of the i-th simulation moment, y j It represents the fidelity of the ith node in the system at the current simulation moment, and TN represents the number of simulation moments.

5. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 1, It is characterized in that For each simulation moment of the complex simulation system, the fidelity of the system at the current simulation moment is calculated using the following formula based on the fidelity of each simulation node: Among them, Y represents the credibility of the system against the simulation system at the current moment, ω j represents the importance of the jth node in the system at the current moment, y j represents the credibility of the jth node in the system at the current moment, and M is the number of nodes in the system at the current moment.

6. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 5, It is characterized in that The importance of each node in the system at the current simulation time is obtained in the following way: Constructing a hypernetwork structure of the current complex simulation system, searching for OODA loops based on the hypernetwork, and calculating the initial comprehensive confrontation capability of each OODA loop; For each node, treat it as a failed node and update the super network based on the network cascade failure analysis; calculate the updated comprehensive confrontation capability of each OODA loop based on the updated super network; Based on the initial comprehensive confrontation capability and the updated comprehensive confrontation capability of each OODA loop, the importance of the failed node is obtained.

7. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 6, It is characterized in that The importance of the failed node is calculated using the following formula: in, Indicates that the i-th target node T i The initial comprehensive confrontation capability of the target j-th OODA loop, Indicates that the i-th target node T i The updated comprehensive confrontation capability of the target j-th OODA loop, Indicates that the i-th target node T i is the weight of the jth OODA loop of the target, Value(v) represents the importance of node v, N T represents the number of target nodes in the complex simulation system, Indicates the number of OODA loops where the i-th target node is located.

8. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 7, It is characterized in that The following formula is used to calculate the i-th target node T i The weight of the jth OODA loop of the target is: in, Represents the target node T i The weight of Indicates that the i-th target node T i The initial comprehensive confrontation capability of the target j-th OODA loop.

9. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 7, It is characterized in that The initial comprehensive confrontation capability of each OODA loop is calculated in the following way: Among them, P op represents the target damage probability of the OODA loop, Q op represents the stability of the OODA loop topology, w 1 and w 2 They represent the weights of target damage probability and topological structure stability of the OODA loop respectively.

10. The method for calculating the network fidelity of the whole process of a complex simulation system according to claim 9, It is characterized in that The target destruction probability of the OODA loop is calculated using the following formula: Among them, P Ai represents the comprehensive damage probability of the i-th action node in the OODA loop to the target node in the OODA loop, and k represents the number of action nodes in the OODA loop; The following formula is used to calculate the comprehensive damage probability of the action node to the target node in the OODA loop: P A =P S→D ×P D→A ×P h ×P d Among them, P S→D Indicates the quality of target intelligence information received by the action node, P D→A Indicates the correctness of the accusation information received by the action node, P h represents the probability of the action node hitting the target node in the OODA loop, P d represents the conditional damage probability of the action node to the target node, P A Represents the comprehensive damage probability of the action node to the target node in the OODA loop.