Printer Friendly

Combat Network Synchronization of UCAV Formation Based on RTBA Model.

1. Introduction

Since the control theory and intelligent technology have acquired significant advances, research on multiple unmanned combat aerial vehicles (UCAVs) has attracted more and more attentions in recent years. The cooperative problems [1], control command problems [2-4], mission assignment problems [5-7], and route planning problems [8, 9] have become the focus among researchers. The structure of UCAV formation has also been focused on in recent years. The frequent exchanging information among different UCAVs during the mission process needs a robust and efficient structure to keep the systems up. A robust status needs an adaptive structure both in physical level and in functional level and an efficient job among UCAVs needs a consistent recognition towards the same combat situation.

Many researches concerned about the UCAV formation have assumed that all the UCAV units had their information completely shared, and the communication interruptions from both the enemies and the measurement errors are neglected, such as [10, 11]. But, in real combat, the UCAV units can only get limited information about the situation due to the limitations of current communicating abilities. Just a few references have described the UCAV model with a local knowledge mastered by the combat units. Reference [12] has designed a new distributed auction algorithm based on the neighbor knowledge. Reference [13] puts forward a cooperative missile guiding rule based on the local communication and the features of heterogeneous structure. Reference [14] gives a new distributed auction algorithm with a limited communication ability. Though these researches have brought us many valuable results which may be useful to solve some problems in real society, the researches on topology structure and the dynamic model still need to be analyzed.

Route Temporary Blindness (RTB) problem [15] which may lead to communication interruption may also be very important to have an effect on the robustness of the UCAV formation. The communication among UCAVs during the continuous mission executing process may lead to RTB problem, and the RTB problem may force the formation to upgrade its structure. In order to get an optimal UCAV formation, we put forward a method in this study to solve the RTB problem and get an optimal structure with efficient synchronized features.

The paper is organized as follows: Section 1 is introduction. Section 2 presents the dynamic topology model of UCAV formation and its node survival model. Section 3 describes the rout blindness problem and its solution. Section 4 puts forward an optimal algorithm aiming at finding a better structure with a more stable and synchronized features. Section 5 gives the simulation results and Section 6 is conclusion.

2. Dynamic Topology Modeling of UCAV Net Constructing

In order to solve the cooperative problems in UCAV cooperation, we need to better understand the structure of the UCAV formation both in physical and in functional levels. The structure of UCAV formation can be described as G = (P, F), P is the variable set of physical structure which can be described as P = (V, E, C), V is the set of UCAV nodes, and E means the connections between different nodes. Each edge [e.sub.i]; [member of] E can find two relative nodes ([v.sub.j], [v.sub.k]) in V. C is the feature set of UCAV formation, Cn(k) e C (n = 1, 2, ..., [n.sub.max]; k = 1, 2, ..., [f.sub.max]), max is the maximum number of UCAVs, and [k.sub.max] is the maximum number of the kinds of UCAV features. F is the variable set of functional structures which is constructed as F = (M, R), M is the number of kinds of different missions, and R represents a set of logic relationships between different functional nodes.

2.1. Physical and Functional Networks. The fast developed technologies have greatly expanded the functions of UCAVs, and different cooperative relationships may bring various functional UCAV formations to satisfy the continuously changing missions. In order to efficiently complete the given missions, we need to analyze the relationships of the net constructing structures between physical and functional levels in UCAV formations.

From Figure 1, we can see that one SoS (system of systems) of UCAV can be divided into several parts according to the needs of missions, such as fight network, interception network, support network, management network, and communication network. The latter one is communication network which can be regarded as the physical network and other networks are functional networks which are in close relationships with the physical network. For most real UCAV systems, their functional connections and physical connections are not equivalent.

2.1.1. Heterogeneity of UCAVs. For UCAV formation, each single UCAV has its own special features which match different kinds of functional networks, we suppose that there are N kinds of UCAVs, and the number of UCAVs k is [absolute value of [R.sub.k]], the state space is [S.sub.k], and the relative action state is [A.sub.k]. Then the mapping formula can be described as

[mathematical expression not reproducible]. (1)

The transforming description can be seen in Figure 2.

In Figure 2, E means the environment, and the other variables can be found in Section 2. Figure 2 is a typical OODA ring which can also reflect the transforming process of constructing the physical net to complete the task of functional net. A stable and static physical net can be useful to keep the high efficiency of UCAV formation. But, in real combat, the dynamic environment and other continuous changing factors may need a dynamic structure to support UCAV formation.

2.1.2. Time-Varying Features of UCAV Structure. According to the analysis in Section 1, it is easy to understand the importance of a dynamic structure of UCAV formation. The description of the dynamic model can be seen in Figure 3.

Figure 3 shows the dynamic process of the transformation in the net constructing structure. During different time areas, the physical structure is different due to the needs of the missions and the features of each UCAV. P(t) is the time-varying function of physical structure which is driven by the missions. Different missions may stimulate different physical structure which can affect the style of functional structure F(t) greatly. The results coming from functional structure may also reaffect the physical construction. The physical structure will change at time [t.sub.n] (n = 1, 2, ..., N), and y in Figure 3 means the unexpected missions which may cause the changes of the physical structure. In particular, time between [t.sub.k] and [t.sub.k+1] is not a constant, and it depends on the needs of the relative missions.

Formula (2) can describe the dynamic process:

P(t) = P (t) + [DELTA]P, T [member of] ([t.sub.k], [t.sub.k+1]), k = 1, 2, ..., N

P([t.sub.k+1]) = T(P([t.sub.k])), k = 1, 2, ..., N

P([t.sub.0]) = ([V.sub.0], [E.sub.0], [C.sub.0]). (2)

From formula (2), we can see that, during the stable stage, the physical structure keeps a stable status without considering the error AP, which can be described as [DELTA]P = f([DELTA]V, [DELTA]X, [DELTA]Y, [DELTA]Z), [DELTA]V, [DELTA]X, [DELTA]Y, and [DELTA]Z are the velocity and position errors of each UCAV. At time [t.sub.k], k = 1, 2, ..., N, the physical structure may change due to the new coming missions. T is the transforming function which can help the system to complete the update. P([t.sub.0]) is the initial description of the structure which is decided by the given mission.

2.2. Node Survival Model of Multi-UCAV Formation. According to [16-18], we can conclude some obvious features of complex system. They are as follows:

(i) The component systems achieve well-substantiated purposes independently even if detached from the overall system.

(ii) The whole function of a complex system cannot be easily composed of every single subsystem (1 + 1 > 2).

(iii) It has some intelligent features in some degree which can complete a special mission by predicting the situation using the current information.

From the features we mentioned above, we can regard the UCAV formation as a complex system. Then the vulnerability feature should be analyzed in order to keep the system stable.

The failure probability function can be described as [19]

[W.sub.[alpha]]([k.sub.i]) = [k.sup.[alpha].sub.i]/[[summation].sup.N.sub.i=1] [k.sup.[alpha].sub.i], (-[infinity] < [alpha] < [infinity]), (3)

where [k.sub.i] denotes the degree of the node i and [alpha] can be regarded as the measure of the knowledge on the network structure. There are four kinds of conditions:

(i) [alpha] < 0, which means that the attacker masters more information about the nodes with low degree. Node with low degree may be more vulnerable and the attacker may use the low-node-first attack strategy.

(ii) [alpha] > 0, which means that the attacker masters more information about the nodes with high degree. Node with high degree may be more vulnerable and the attacker may use the high-node-first attack strategy.

(iii) [alpha] = 0, which means the random attack.

(iv) [alpha] = [infinity], which means the deliberate attack.

3. Description of Route Temporary Blindness Problem in UCAV

In Figure 1, the importance of physical and functional structure of UCAV formation has been described. We can easily find that the physical network is the foundation of the whole mission. And a proper physical structure is the most important factor for the formation to complete the given mission. And, in this paper, we regard the communication network as the physical network. Thus, the Route Temporary Blindness problem comes.

3.1. Problem Statement. When cooperating with other UCAVs during a mission, a single UCAV needs the information from its neighbors. A stable and reliable neighbor may be of great importance to keep the stable status of the whole structure.

The Route Temporary Blindness problem may be caused in different stages:

(1) During relatively stable stage, the problem may be caused by [DELTA]P. The accumulated errors in position may disturb the normal prediction of the single UCAV, and the deviated position within an information updated cycle may lead to the overranging of the communication radius. Then the chosen neighbor node may be unavailable and the communication in next cycle may be broken.

(2) At the mission transforming moment, the problem may be caused by the change of the dynamic physical structure. The vulnerability of the nodes in different mission processes may get different values which may cause the changes in position and connection among UCAVs. When a mission changes, the highest degree neighbor may change from the most vulnerable node to the least vulnerable node. So the neighbor needs to be changed in order to protect the formation from the future temporary blindness problem.

From Figure 4, St means the UCAV node in formation, [S.sub.0] is the node which has been researched on, and ([x.sub.i], [y.sub.i], [z.sub.i], [v.sub.i], [D.sub.i]) is the information communicated between [S.sub.0] and its neighbors. [x.sub.t], [y.sub.t], and [z.sub.i] are the position information, [v.sub.i] is the velocity, and Dt is the degree of its neighbors.

3.2. RTBA Model

3.2.1. Route Temporary Blindness Physical Avoidance (RTBPA) Model. In order to avoid the RTB phenomenon, we need to predict the future position of the UCAV. Assume [DELTA]T = [t.sub.k] - [t.sub.k-1] = c[DELTA]t, [DELTA]t is one of the intervals between [t.sub.k] and [t.sub.k-1], and c means the number of the intervals. We regard the whole process as a combination of uniform motion and accelerated motion. If the information at time [t.sub.k-1] is given, then the position in X direction at time [t.sub.k] obeys Gauss distribution.

During kth interval in time [[t.sub.k-1], [t.sub.k]], the position, velocity, and acceleration of UCAV [u.sub.i] in X direction can be described as [x.sub.k], [v.sup.x.sub.k], and [a.sup.x.sub.i], and they have the following relationships:

[v.sup.x.sub.k] = [v.sup.x.sub.0] [k-1.summation over (i=0)] [a.sup.x.sub.i] [DELTA]t,

[x.sub.k] = [x.sub.0] + [kv.sup.x.sub.0] [DELTA]t + 1/2 [k-1.summation over (i=0)](2k - 2i - 1)[a.sup.x.sub.i][DELTA][t.sup.2]. (4)

According to the definition of Gauss distribution, if the position of [u.sub.i]; at [t.sub.k-1] in X direction is given, we can set the Gauss variables of position at [t.sub.k] as: [[mu].sub.x] = E([x.sub.k]), and [[sigma].sup.2.sub.x] = D([x.sub.k]). And, after [DELTA]T = [t.sub.k] - [t.sub.k-1] = m[DELTA]t, we can get the probability

p{([x.sub.k], [y.sub.k]) | ([x.sub.k-1], [y.sub.k-1])} = 1/2[pi][[sigma].sub.x][[sigma].sub.y] exp {-[([x.sub.k] - [[mu].sub.k]).sup.2]/2[[sigma].sup.2.sub.x]} + -([x.sub.k] - [[mu].sub.k]).sup.2/2[[sigma].sup.2.sub.x]}. (5)

Then, we can get the position at [t.sub.k] = [t.sub.k-1] + m[DELTA]t as

[x.sub.k] = predict_pos_x ([x.sub.k-1, [v.sup.x.sub.k-1], [a.sup.x.sub.k-1], [DELTA]T),

[y.sub.k] = predict_pos_y ([y.sub.k-1, [v.sup.y.sub.k-1], [a.sup.y.sub.k-1], [DELTA]T). (6)

3.2.2. Rout Temporary Blindness Functional Avoidance (RTBFA) Model

(a) Analyze the Mission: Positive and Negative Missions. In order to simplify the combat conditions, the missions have been divided into two different types, namely, positive mission [M.sub.P] and negative mission [M.sub.N].

Definition 1. One defines the positive mission as a preplanned mission which may be executed based on the possessed knowledge of the enemy. And the positive mission may have a hiding policy to reveal the information to the enemy as less as possible. In all, when executing a positive mission, the formation may have obtained the priority in combat.

According to Definition 1, one can see that when executing a positive mission, [alpha] = 0 or [alpha] < 0. The enemy may consider random attack policy or low degree node preferential policy. Neighbor node with low degree may become more vulnerable.

Definition 2. Negative mission is an unintentional or partial knowledge possessed mission; it happens when outer threats come out without prediction or inner malfunctions appear in some probability. During negative mission process, the enemy has occupied the combat situation and it has possessed more information of our formation.

Analyzed by Definition 2, when executing a negative mission, [alpha] [right arrow] [infinity] or [alpha] > 0. The enemy may consider deliberate attack policy or high degree preferential policy. Neighbor node with high degree may become more vulnerable.

(b) Measurement of Possessed Information. The detective information is regarded as the possessed information about the enemies, and the detective problem is related to the hypothesis testing problem:

[H.sub.0]: there is no object within the search range.

[H.sub.1]: there exist (an) object(s) within the search range.

Suppose that the probabilities are [P.sub.0] = P([H.sub.0]) and [P.sub.1] = P([H.sub.1]) and the related variables of detective problem are as follows.

(i) Probability of False Alarm (PFA). It is the probability of a false decision which regards an event that did not happen as an event that happened. [P.sub.F] = Pr(u = 1 | [H.sub.0]), and the PFA of airborne pulsed Doppler radar is [20]

[mathematical expression not reproducible], (7)

where R is the amplitude of noise envelope from the detector, [[psi].sub.0] is the mean square value of noise voltage, and [V.sub.T] is threshold voltage.

(ii) Probability of the Right Decision. It is the probability of a right recognition and decision which can be described as

[P.sub.L] = Pr (u = 0 | [H.sub.0]) = 1 - [P.sub.F] =1 - exp (- [V.sup.2.sub.T]/2[[psi].sub.0]). (8)

(iii) Probability of Detection. When an event happened and is correctly decided by the detective facility, the probability can be described as [P.sub.D] = Pr(u = 1 | [H.sub.1]). And the PD of airborne pulsed Doppler radar is

[mathematical expression not reproducible]. (9)

(iv) Probability of Miss. It is the opposite meaning of PFA, that is, when an event did happen while the detective facility decides that it as an event that did not happen. [P.sub.M] = Pr(w = 0 | [H.sub.1]), and the PM of airborne pulsed Doppler radar is

[mathematical expression not reproducible]. (10)

Under condition [H.sub.0], the information Shannon can be regarded as

[I.sub.0] = -[n.summation over (i=1)][p.sub.i][log.sub.2]([p.sub.i]) = - [P.sub.F][log.sub.2]([P.sub.F]) - [P.sub.L][log.sub.2]([P.sub.L]). (11)

And, under condition [H.sub.1], the information Shannon can be regarded as

[I.sub.1] = [n.summation over (i=1)][p.sub.i][log.sub.2]([p.sub.i]) = [P.sub.F][log.sub.2]([P.sub.M]) - [P.sub.D][log.sub.2]([P.sub.D]. (13)

The information Shannon [21] under detection condition is set as the sum of [I.sub.0] and [I.sub.1]:

[I.sub.M] = P([H.sub.0]) x [I.sub.0] + P ([H.sub.1]) x [I.sub.1] = [P.sub.0] x [-[P.sub.F][log.sub.2]([P.sub.F]) - [P.sub.L][log.sub.2]([P.sub.L])] + [P.sub.1] x [-[P.sub.M][log.sub.2]([P.sub.M]) - [P.sub.D][log.sub.2]([P.sub.D])]. (13)

[I.sub.M] reflects the detective information. The bigger [I.sub.M] gets, the more the information is needed. Set an expected value [I.sub.E], and if [I.sub.M] > [I.sub.E], the information is enough and the mission can be regarded as positive mission. If [I.sub.M] < [I.sub.E], the mission can be regarded as a negative mission:

[alpha] = [I.sub.E] - [I.sub.M]. (14)

3.2.3. Avoidance Function

[mathematical expression not reproducible]. (15)

[L.sub.i] is a decision function that measures the effectiveness of the current chosen nodes.

3.3. RTBA Utility Indexes. In order to get a more reliable communicating partner, we set the following indexes.

(i) Continuously connecting feature: [mathematical expression not reproducible], being the set of the neighbors of [u.sub.i].

According to the predicted position of UCAV [u.sub.0] and [u.sub.k], the relative position between the sender and receiver can be described as

[DELTA]d = [square root of ([([x.sub.k] - [x.sub.0]).sup.2] + [([y.sub.k] - [y.sub.0]).sup.2])]. (16)

After [DELTA]T, the positions of the sender and receiver are ([x'.sub.0], [y'.sub.0]) and ([x'.sub.k], [y'.sub.k]).

[DELTA]d' = [square root of ([([x'.sub.k] - [x'.sub.0]).sup.2] + [([y'.sub.k] - [y'.sub.0]).sup.2])], (17)

where [DELTA]d' describes the connecting relationship between UCAV [u.sub.0] and [u.sub.k] after [DELTA]T and [DELTA]T can be regarded as continuously connecting feature.

(ii) Nearer connecting distance: [mathematical expression not reproducible].

The complex index can be described as

[mathematical expression not reproducible] (18)

where [tau] is the reliability weight of neighbor nodes.

The connecting result of each node can be decided by the value of Q, and we can finally get a neighbor matrix m which decides the structure of the formation. According to the features of complex networks, if more than two nodes need to be replaced during the same mission period, then the new nodes choosing order may be very important to the net structure. Different nodes choosing order may lead to different neighbor matrix. [m.sub.i] [member of] M is the neighbor matrix set, and we need to get a proper matrix which can bring a more stable and effective result.

4. Dynamic Topology Optimizing Method Based on Synchrony Features

4.1. The Synchronization of UCAV Formation. Synchronization phenomenon exists widely in nature, such as the synchronization of fireflies glowing and the synchronization of large groups of neurons in human brains and the clapping frequency synchronization [22]. The synchronization phenomenon is also an important concept in UCAV formation and it reflects the recognizing abilities of each node and we give the definition of synchronization in formation.

Definition 3. Synchronization in UCAV formation can be regarded as the agreement on the combat situation by different UCAV nodes. And it can be described by the conformance degree towards the same combat situation.

As one mentioned in Section 3.1, each UCAV node can be regarded as a dynamic system, and there exists coupling effect between two connected nodes. Then the dynamic equation of each node can be given as below:

[[??].sub.i] = F([x.sub.i]) - [sigma][N.summation over (j)][l.sub.ij][Hx.sub.j], i = 1, 2, ..., N, (19)

where [x.sub.i] [member of] [R.sup.d] is a d dimensional state vector and F : [R.sup.d] [right arrow] [R.sup.d] is the dynamic equation which obeys Lipchitz condition [23].

[sigma] is coupling efficient, H describes the different coupling styles among different vibrators, [l.sub.ij] is the element with Laplace features, and [x.sub.i](t) (i = 1, 2, ..., N) is the state of each node.

If any solution to (20) satisfies the following condition, then we can say that the system is a completely synchronized system:

[mathematical expression not reproducible]. (20)

If there exists a real number e which is greater than zero, it constructs the following relationship:

[mathematical expression not reproducible]. (21)

If any solution to the equation above satisfies the following condition, then we can say that the system is a local synchronized system:

[mathematical expression not reproducible]. (22)

The UCAV formation can be regarded as a local synchronization system in this research.

4.2. Indexes of Synchronization in UCAV Formation. The synchronization of UCAV formation is decided by the following three factors [24]:

(i) The dynamic features of each node.

(ii) The net structure, namely, matrix m.

(iii) The coupling effect between different dynamic systems.

According to [24], K = [[lambda].sub.max]/[[lambda].sub.2] can be used to describe the synchronization features. [[lambda].sub.max] describes the robustness towards the communication delay and [[lambda].sub.2] means the second largest eigenvalue which can also be regarded as algebraic connectivity. The synchronization feature of the system is often improved by decreasing the value of K. [[lambda].sub.i] in ascending sort order is the eigenvalue of matrix m. The evaluating function is set as

E(G) = [([[lambda].sub.2]/[[lambda].sub.max]).sub.G][summation over (R)]([w.sub.r][summation over (k)]e([k.sub.i])), (23)

where [([[lambda].sub.2]/[[lambda].sub.max]).sub.G] is used to evaluate the connectivity and delay robustness of UCAV formation, R is the number of kinds of functional nodes, [w.sub.r] means the weight in relation to different kinds of functional nodes, [[summation].sub.R] [w.sub.r] = 1, and [[summation].sub.k]e([k.sub.i]) is the sum of all the nodes' efficiencies. From [25], we can get the node's efficiency model:

[mathematical expression not reproducible]. (24)

where [k.sub.i] is the degree of node i and v and [beta] are the modifying variables according to the situation. In order to get an optimal value, we need to get max(E(G)). Then the optimal function can be set as

max (E(G)) = [([[lambda].sub.2]/[[lambda].sub.max]).sub.G] [summation over (R)] ([w.sub.r] [summation over (k)]][e.sub.r]([k.sub.i]))

s.t. [summation over (R)] [w.sub.r] = 1. (25)

4.3. Dynamic Topology Constructing Method Based on HPSO Method. According to the aforementioned contents, the optimal structure needs to be found in order to keep the stability and synchrony of the UCAV system. The new nodes choosing order has brought more than one kind of net constructing structure. Thus the problem has been simplified as finding a proper sequence.

4.3.1. Calculating Process. According to the problem simplification above, we have changed the complex model into a typical TSP model; thus we use hybrid particle swarm optimization method to solve this problem. The detailed steps can be acquired in Figure 5.

4.3.2. Encoding Method. The length of the code equals the number of nodes which need to find new partners. The codes can be described by natural numbers which should get repeated. If the new nodes choosing order is {1, 2, 5, 6, 9, 7, 8, 3, 4, ..., n}, then the code can be set as {1, 2, 5, 6, 9, 7, 8, 3, 4, ..., n}.

In Figure 6, [mathematical expression not reproducible] is the sequence number which means the sequence of the node [n.sub.r] in r kind of functional node. Different kinds of functional nodes may match different kinds of weights which are very important to the final result.

4.3.3. Code Crossing Rules. In order to accelerate the process of convergence, the crossing rules are brought into the algorithm. And the detailed rules are described in Figure 7.

From Figure 7, the crossing rules are as follows:

(i) Selecting two crossing points in the old code set randomly.

(ii) Exchanging the codes between the crossing points.

(iii) Executing the self-testing process to avoid the repeated codes.

(iv) Rebuilding the codes.

5. Simulation

5.1. Hardware Condition. Hardware condition is as follows: CPU: P4 2.8 GHz, RAM: 1.5 G, and Matlab 2010, NS2.

5.2. Software Settings
Variables                     Values
Simulation range              100 [km.sup.2]
UDP data                      512 Bytes
Transportation fading model   Friis
UCAV communicating distance   1 km
Communication treaty          UDP
Simulation time               200 s
Simulation times              1000


5.3. Evaluation Indexes. In order to verify the effectiveness of RTBA model, we use Packet Delivery Ratio (PDR) and End-to-End Delay (EED) to complete the evaluating process.

5.3.1. Packet Delivery Ratio (PDR): Ratio of Information Received by All the Possible Receiving Nodes to Information Sent by an Exact Sending Node

PDR = [[summation]./sub.n][D.sub.r]/[D.sub.s]. (26)

[D.sub.r] is the information received by a chosen node, [[summation].sub.n] [D.sub.r] describes the information received by n possible chosen nodes. [D.sub.s] describes all the sent information.

5.3.2. Average End-to-End Delay (AEED): The Average Time of Information Transportation from Sender to Receivers

[T.sub.D] = [[summation].sup.n.sub.i=1] ([T.sup.r.sub.i] - [T.sup.s.sub.i]/n), (27)

where [T.sup.r.sub.i] means the time when the i data package is received, [T.sup.s.bu.i] means the time when the i data package is sent, and n is the number of data packages.

5.4. Simulation and Analysis

5.4.1. RTBA Model Analysis. Three models are put forward to compare the PDR values. Here we used RTBA, RTBPA, and normal model to make a comparison while the normal model is the traditional communication model without any restoring strategies. We first assume that the mission has kept a stable status, and the UCAV nodes fly at an increasing velocity.

The initial number of UCAV nodes is 50 in Figure 8(a), and we can find that during a stable status, the RTBA model may have a better PDR value. With the increasing of the velocity of nodes, the robustness of UCAV formation maybe influenced. The continuously increasing velocity may enlarge the error in RTB problem, so the PDR may decrease, but RTBA model still has a better performance than others. And, in this situation, RTBPA model has almost the same performance as RTBA. Figure 8(b) has the same simulating environment but an increasing UCAV number. We set 100 UCAV nodes in the right side. We can easily find that the increasing number of UCAVs may have an obvious superiority. At a relatively low velocity, the normal model may even have a better value than the others, but, with the increasing of the velocity, RTBA model will show its superiority.

In order to describe the performance of models in an unstable status, a sudden threat is designed at time 30 s, and then negative mission [M.sub.N] appears. The velocity of UCAV formation is given as 100 m/s and the PDR values are shown in Figure 9.

Figure 9 reflects the PDR comparison when executing [M.sub.N], and the unexpected threat has influenced the robustness of the formation. After 30 s, the threat has enlarged the potential risk of parts of the nodes, then PDR in all the models have descended. At about 45 s, PDR in RTBA model has bounced back and kept a stable value, while PDR in normal and RTBPA model has not bounced back. The threat has great influences on the functional feature of the nodes; RTB model may have a better self-testing and restoring ability which can be important to keep the robustness of UCAV formation.

AEED can also be used to evaluate the efficiency of a cooperative system. From Figure 10, RTBA model has a relatively low AEED value with the increasing of the velocity. Figure 10(a) has 50 nodes and Figure 10(b) has 100 nodes and Figure 10(a) has an obvious low average value compared to that in Figure 10(b). More nodes may offer more connecting choices, and more choices may shorten the node choosing time, so the average value of AEED is lower. The increasing velocity may enlarge the physical error and the formation in RTBA and RTBPA model has to test the connectivity of the system for many times, and then the value of AEED increases.

Figure 11 shows the average time delay probability in different models after 1000 times' simulations when the formation encounters a sudden threat (negative mission). For simplification, we make the time delay remain at one decimal. In RTBA model, the time delay focus on 0.2 to 0.4 seconds. In RTBPA model, the time delay focus on 0.4 to 0.8 seconds. In normal model, though the time delay shows its random features, it has a greater average value. And we can find the following: [[summation].sub.PRTBA] = 1 [[summation].sub.PRTBPA] < 1 and [[summation].sub.PNormal] < 1 Among 1000 simulations, there exists communicating broken situation in RTBPA and normal models. If a communicating broken problem happens, value of AEED may trend to be infinite and the result may be totally different.

5.4.2. Optimal Synchronized Structure Seeking. The superiority has been analyzed in Section 5.4.1; then the optimal structure should be acquired in Section 5.4.2.

The initial structure can be found in Figure 12 and the values of features can be seen in Table 1.

We assume that, after the appearance of a sudden threat, nodes 2, 6, and 9 may get a higher probability of being attacked, and then a better node choosing order is needed so as to get a better constructing structure.

From Figure 13, HPSO has an obvious better result than PSO, the best node choosing order is as follows: bestSequence = (4 [right arrow] 19 [right arrow] 18 [right arrow] 5 [right arrow] 2 [right arrow] 1 [right arrow] 10 [right arrow] 8 [right arrow] 11 [right arrow] 17), and the optimized structure can be found in Figure 14.

From Figure 14 we can see that the edges among different nodes have increased, and the edges around nodes 2, 6, and 9 have decreased. The whole formation has a flatter structure which contains more cross-grade connections. And the relative values of relative variables are as follows: 1/[[lambda].sub.2] = 1.718, [[lambda].sub.max]/[[lambda].sub.2] = 16.702, e = 44, and E = 0.724. The value of [[lambda].sub.max]/[[lambda].sub.2] has decreased due to the interception of the negative mission. The result can also describe that a flat structure may be proper to improve the synchrony of UCAV formation.

6. Conclusions

Dynamic UCAV formation net constructing problem under RTB situation is solved in this paper. Robustness and synchronization are set as two important indexes to seek for an optimal UCAV formation structure. In order to analyze the influences caused by the combat missions, the mission kinds and mission stages are classified, and a dynamic structure changing mechanism is put forward. RTBA model is given to optimize the functional and physical nodes in order to keep the robustness of the formation. And HPSO method is used to find a proper structure to get an appropriately synchronized features. The dynamic structure constructing problem has been transferred to a node choosing sequence optimizing problem which can be regarded as a TSP problem. Finally, the efficiency of RTBA model has been given according to the comparison with other models and the optimal structure with better robustness and synchronization has been acquired using HPSO method.

From the perspective of net constructing consumption, the optimized formation structure is able to keep a synchronized feature with not many changes in edges. This will be very important to decrease the cost of keeping the connections among different UCAVs.

From the perspective of robustness, the high risky nodes have relatively low probability of being connected in the optimized structure which can be useful to keep the robustness of the formation.

From control and command perspective, edges in formation have increased obviously, and the cross-grade connections have taken a great ratio in the optimized structure. A flatter formation is useful to improve the comprehensive efficiency of UCAV formation.

Combat situation is very important because it can influence the state of UCAV and even the structure of UCAV formation. In this content, combat situation is simple and the scenario is regarded as an absolutely ideal space. A complex scenario may be more credible in real combat situation. Thus we need to pay more attention to this area in order to put the theory into practice.

http://dx.doi.org/10.1155/2016/2630790

Competing Interests

The authors declare that they have no competing interests.

References

[1] C. Pan, W. Ye, J. Chen, and J. Guo, "Cooperative control for UCAVs path planning," in Proceedings of the 8th World Congress on Intelligent Control and Automation (WCICA '10), pp. 5259-5263, Jinan, China, July 2010.

[2] J. Chen and X. Gao, "Modeling and analysis of command and control system in cooperative air combat," Engineering and Applications, vol. 45, no. 10, pp. 195-198, 2009.

[3] A. H. Levis, Time Sensitive Control of Air Combat Operations, Cebter of Excellence in Command, Control, Communication and Intelligence, George MASON University, 1998.

[4] F. D. J. Bowden, Petri Nets and Their Application to Command and Control Systems, Information Technology Division, Electronics and Surveillance Research Laboratory, Salisbury, Australia, 1996.

[5] S. Erkan, M. Kandemir, and G. Giger, "Advanced task assignment for unmanned combat aerial vehicles targeting cost efficiency and survivability," in Proceedings of the 46th AIAA Aerospace Sciences Meeting and Exhibit, Reno, Nev, USA, January 2008.

[6] C. Schumacher, P. Chandler, P. Pachter, and L. Pachter, "Constrained optimization for UAV task assignment," in Proceedings of the AIAA Guidance, Navigation, and Control Conference and Exhibit, Guidance, Navigation, and Control and Co-located Conferences, Providence, RI, USA, August 2004.

[7] D. Zhang, G. Xie, J. Yu, and L. Wang, "Adaptive task assignment for multiple mobile robots via swarm intelligence approach," Robotics and Autonomous Systems, vol. 55, no. 7, pp. 572-588, 2007.

[8] T.-Q. Ni, J.-D. Wang, and Y.-A. Liu, "Application of particle swarm algorithm in route planning of UAV"' Systems Engineering and Electronics, vol. 33, no. 4, pp. 806-810, 2011.

[9] R. J. Szczerba, P. Galkowski, I. S. Glicktein, and N. Ternullo, "Robust algorithm for real-time route planning," IEEE Transactions on Aerospace and Electronic Systems, vol. 36, no. 3, pp. 869-878, 2000.

[10] S.-Q. Tang, C.-Q. Huang, J. Hu, and W.-C. Wu, "Threat equivalent and improved PSO algorithm based real-time method of UCAV route planning," Systems Engineering and Electronics, vol. 32, no. 8, pp. 1706-1710, 2010.

[11] J.-Y. Du, F.-M. Zhang, H.-B. Mao, H.-W. Liu, and J. Yang, "Game theory based multi-UAV cooperative searching model and fast solution approach," Journal of Shanghai Jiaotong University, vol. 47, no. 4, pp. 667-678, 2013.

[12] B. Di, R. Zhou, and Q.-X. Ding, "Distributed coordinated heterogeneous task allocation for unmanned aerial vehicles," Control and Decision, vol. 28, no. 2, pp. 274-278, 2013.

[13] X. K. Bao, Modeling and Analyzing of Networked Operation Synchronization, National University of Defense Technology, Changsha, China, 2009.

[14] M. M. Zavlanos, L. Spesivtsev, and G. J. Pappas, "A distributed auction algorithm for the assignment problem," in Proceedings of the 47th IEEE Conference on Decision and Control (CDC '08), pp. 1212-1217, Cancun, Mexico, December 2008.

[15] D. Medina, F. Hoffmann, F. Rossetto, and C.-H. Rokitansky, "Routing in the airborne internet," in Proceedings of the Integrated Communications, Navigation, and Surveillance Conference (ICNS '10), pp. 11-13, Herndon, Va, USA, May 2010.

[16] X. Huang, Scientific Research on Complex Methodology, Qsinghua University, Beijing, China, 2014.

[17] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, "Complex networks: structure and dynamics," Physics Reports, vol. 424, no. 4-5, pp. 175-308, 2006.

[18] R. John, Dynamic Complexity in System of Systems, Engineering & Technology. Advanced Sytems. Boeing Company, 2007.

[19] L. K. Gallos, R. Cohen, P. Argyrakis, A. Bunde, and S. Havlin, "Stability and topology of scale-free networks under attack and defense strategies," Physical Review Letters, vol. 94, no. 18, Article ID 188701, 4 pages, 2005.

[20] D. Luo, Z. Yang, H. Duan, Z. Wu, and C. Shen, "Heuristic particle swarm optimization algorithm for air combat decision-making on CMTA," Transactions of Nanjing University of Aeronautics & Astronautics, vol. 23, no. 1, pp. 20-26, 2006.

[21] D. Stein, J. Witkoskie, S. Theophanis, and W. Kuklinski, "Random set tracking and entropy based control applied to distributed sensor networks," in Proceedings of the Proceedings of SPIE, vol. 6567, pp. 656709-656722, Beiiing, China, November 2007.

[22] S. Li, Research on the Mechanism of Cascading Dynamics and Behaviors of Complex Networks, Beijing University of POSIS and Telecommunications, 2012.

[23] D. Shi, G. Chen, W. W. K. Thong, and X. Yan, "Searching for optimal network topology with best possible synchronizability," IEEE Circuits and Systems Magazine, vol. 13, no. 1, pp. 66-75, 2013.

[24] M. Jalili, "Enhancing synchronizability of diffusively coupled dynamical networks: a survey," IEEE Transactions on Neural Networks and Learning Systems, vol. 24, no. 7, pp. 1009-1022, 2013.

[25] J. Yan, X.-M. Li, L.-J. Liu, and B. Liu, "Combat network synchronization of air fleet formation," Systems Engineering and Electronics, vol. 36, no. 8, pp. 1566-1572, 2014.

Chengwei Ruan, Haiyan Yang, Lei Yu, and Yingxin Kou

Aeronautics and Astronautics Engineering College, Air Force Engineering University, Xian 710038, China

Correspondence should be addressed to Haiyan Yang; yanghy07@yeah.net

Received 16 July 2016; Accepted 5 September 2016

Academic Editor: Zhao Cheng

Caption: Figure 1: Relationships between physical and functional nodes in UCAV formation.

Caption: Figure 2: State transformation description of UCAV formation.

Caption: Figure 3: Dynamic process description of formation.

Caption: Figure 4: Description of RTB problem.

Caption: Figure 5: Calculating steps.

Caption: Figure 6: Encoding method.

Caption: Figure 7: Crossing method.

Caption: Figure 8: PDR comparison among different models.

Caption: Figure 9: PDR comparison when sudden threat comes at time 30 s.

Caption: Figure 10: AEED comparison among different models.

Caption: Figure 11: AEED probabilities of three models under sudden threats.

Caption: Figure 12: Description of initial net structure.

Caption: Figure 13: Comparison between PSO and HPSO algorithm.

Caption: Figure 14: Optimized structure of UCAV formation.
Table 1: Initialization of UCAV structure.

UCAV number                             21 (20 communication nodes
                                        in relative UCAV platform)

Kinds of functional nodes               4 (1 center command node, 3
                                          c2 nodes, 5 management
                                        nodes, 11 execution nodes)

Mission stage                           2 stable stages, 1 mission
                                          changing stage (sudden
                                           threat comes at 30 s)

[[lambda].sub.max]/[[lambda].sub.2] =   1/[[lambda].sub.2] = 2.447
21.221                                        e = 38 (edges)
COPYRIGHT 2016 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2016 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Research Article
Author:Ruan, Chengwei; Yang, Haiyan; Yu, Lei; Kou, Yingxin
Publication:Mathematical Problems in Engineering
Article Type:Report
Date:Jan 1, 2016
Words:6735
Previous Article:Prediction of Collapse Scope of Deep-Buried Tunnels Using Pressure Arch Theory.
Next Article:Global Chassis Control System Using Suspension, Steering, and Braking Subsystems.
Topics:

Terms of use | Privacy policy | Copyright © 2018 Farlex, Inc. | Feedback | For webmasters