• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Distributed intelligent self-organized mission planning of multi-UAV for dynamic targets cooperative search-attack

    2020-01-09 01:04:40ZiyangZHENPingZHUYixuanXUEYuxuanJI
    CHINESE JOURNAL OF AERONAUTICS 2019年12期

    Ziyang ZHEN, Ping ZHU, Yixuan XUE, Yuxuan JI

    College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China

    Abstract This article studies the cooperative search-attack mission problem with dynamic targets and threats, and presents a Distributed Intelligent Self-Organized Mission Planning (DISOMP)algorithm for multiple Unmanned Aerial Vehicles (multi-UAV). The DISOMP algorithm can be divided into four modules: a search module designed based on the distributed Ant Colony Optimization (ACO) algorithm, an attack module designed based on the Parallel Approach (PA)scheme, a threat avoidance module designed based on the Dubins Curve (DC) and a communication module designed for information exchange among the multi-UAV system and the dynamic environment. A series of simulations of multi-UAV searching and attacking the moving targets are carried out, in which the search-attack mission completeness, execution efficiency and system suitability of the DISOMP algorithm are analyzed.The simulation results exhibit that the DISOMP algorithm based on online distributed down-top strategy is characterized by good flexibility, scalability and adaptability, in the dynamic targets searching and attacking problem.

    KEYWORDS Ant Colony Optimization(ACO);Cooperative control;Mission planning;Search-attack integration;Self-organized;Unmanned Aerial Vehicle(UAV)

    1. Introduction

    With the development of the automation technology, the Unmanned Aerial Vehicle (UAV) system is becoming increasingly complex and powerful. The UAVs are expected to gradually enter the air force’s main battle weapon and will partly replace some of the jet fighters and bomber, to account for most of the air defense and strike missions. According to the observe-orient-decide-act model, the Air Force Research Laboratory divided the UAV’s autonomy capability into 10 levels.1Nowadays, the UAVs gradually rose from the tactical level to the strategic level.The multi-UAV cooperative control techniques play an important role, which include the task assignment,2path planning and replanning,3mission planning,4formation and reconfiguration,5communication network6and so on. In addition, the development of multi-UAV cooperative control techniques was investigated to promote further research.7

    The centralized control architecture and the distributed control architecture are two types of the cooperative control architectures for multi-UAV.8Along with the improvement of UAV’s performance, the distributed control architecture with superiorities of higher reliability, less computation and communication has been a research focus.4-6Therefore, the distributed control architecture is utilized in this paper. The specific strategies for the cooperative mission planning problem are mainly divided into two kinds: top-down scheme and down-top scheme. Although the top-down scheme based on the hierarchical decomposition strategy can effectively reduce the difficulty and complexity of the problem, it will consume large computation and communication costs when the battlefield situation changes dynamically. In contrast, the downtop scheme based on the self-organized strategy emphasizes each individual’s dynamic response to the environment, and thus is more reliable and flexible. Several self-organized down-top schemes with simple calculation and good robustness have been presented based on the swarm intelligence.Ref.9surveyed the heterogeneous flying self-organized networks structure, and presented a variety of distributed gateway-selection algorithms. Ref.10proposed a fast and coupled solution for cooperative mission planning of multi-UAV with a distributed genetic algorithm.

    Therefore, this work aims to solve the cooperative searchattack mission planning problem of multi-UAV in the dynamic environment with moving targets, and a novel self-organized down-top method is proposed. Different from the results in the literature, the main contributions are as follows.

    (1) The multi-UAV cooperative search-attack integration problem for the dynamic targets in an uncertain environment is investigated, which has not been well addressed in the literature. Refs.11-18investigated the multi-UAV cooperative search-attack problem with stationary targets. Ref.19studied the cooperative search planning and task allocation of the multi-UAV for the moving targets. Ref.20and Ref.21mainly focused on the search task for moving targets. Ref.22developed a new cooperative network platform of multi-UAV surveillance,and carried out some experiments of recognition and tracking of multiple moving targets.Furthermore,thepracticalconstraintsofUAV’s maneuverability, collision avoidance and threat avoidance are considered in this search-attack integration problem, and this is what many references ignore or do not research thoroughly.

    (2) For the cooperative search-attack mission planning problem, a Distributed Intelligent Self-Organized Mission Planning (DISOMP) algorithm is originally presented in this paper. For the cooperative search problem, there are some algorithms presented, such as optimal search theory,15, grid based search algorithm,16probabilistic decision making scheme,12,17,19heuristic algorithm,11,13,18,20-22and predictive algorithm.14The proposed DISOMP algorithm is constituted by a search module designed by the distributed Ant Colony Optimization (ACO) algorithm, an attack module designed by the Parallel Approach (PA) guidance method, a threat avoidance module designed based on the Dubins Curve (DC) scheme, and a communication module for information exchange among the multi-UAV system.This combinatorial optimization scheme can effectively solve the search-attack integration mission planning problem in the uncertain dynamic environment. Furthermore, the mission completeness, mission execution efficiency and multi-UAV system suitability of the DISOMP algorithm are deeply investigated. All above contribute to the practical applications of the DISOMP algorithm.

    The rest of this paper is organized as follows. In Section 2,the multi-UAV cooperative search-attack mission planning problem is described. In Section 3, the DISOMP algorithm composed of a search module, an attack module, a threat avoidance module and a communication module is proposed.In Section 4, simulations are conducted to verify the effectiveness of the DISOMP. Finally, a conclusion is given in Section 5.

    2. Cooperative search-attack problem description

    In this section,the search-attack mission in uncertain environment will be modeled, the search-attack mission planning problem will be defined, and the constraints of search-attack mission planning model will be given.

    2.1. Search-attack mission in uncertain environment

    The illustration of the search-attack mission in uncertain environment is given in Fig. 1.

    (1) Mission area discretization

    Discretize and rasterize the mission area L×W in a twodimensional plane. There is a cooperative multi-UAV system including some isomorphic UAVs, targets (such as moving ground or air vehicles) and threats (such as environmental obstacles, enemy radars and fire points) in the mission area.The UAVs move between the grids in the discrete space with the constraints of maneuverability, collision avoidance and threat avoidance.

    (2) UAV’s property and motion parameters

    Fig.1 Illustration of search-attack mission area.

    Assume that the UAVs in a multi-UAV system are isomorphic, and each UAV takes the same search sensors and attack weapons, and can execute the search and attack missions.There are NuUAVs. Let the projection radius of UAV detection range in the mission area be RS,the maximal turning angle of UAV be φmax, the speed of UAV be Vu, and the step displacement of UAV be d. The detection range and the next possible positions of the UAV are illustrated in Fig. 1, noted by a semi-circle and some deep color grids.

    (3) Dynamic targets and threats There are NTdynamic moving targets and Ntthreats in the mission area, noted by the triangles and the circles in Fig. 1, respectively (Labelled as 1,2,...,Nt/NT). The targets move in straight lines or curves with random directions, with the speed of VT. The radius of the threat is Rt. All above information is unknown in advance for the multi-UAV system. The task of the multi-UAV system is to search and attack these targets and guarantee that UAVs do not enter the threatened area.

    2.2. Search-attack mission planning problem

    The multi-UAV cooperative search-attack integration mission for dynamic targets can be transformed to be a mission planning problem.

    Definition 1(Target search mission).When a target is in the detection range of UAV, the target is considered to be searched, which is described as where RSis the detection range, and r is the distance between the UAV and the target. The surveillance coverage rate is calculated as the ratio of grids which have been searched to all the grids in mission area, and is expressed by

    where nodex,y=0 means that the grid (x,y) has not been searched,while nodex,y=1 means that the grid(x,y)has been searched.The search mission goal is to increase the coverage of the mission area in order to find more targets, and therefore,the surveillance coverage rate is taken as the search benefit JS, that is

    Definition 2(Target attack mission).When a UAV seeks out a target, it will fly to track the target. When the target is in its attack range, the target is considered to be attacked, which is described as

    where RAis the attack range. The attack benefit is calculated as the total value of the targets which have been attacked,and is calculated by

    where NT0is the total number of targets which have been attacked and valuelis the value of the l-th target. The attack mission goal is to maximize the attack benefit, that is

    Definition 3 (Centralized search-attack mission planning model).Suppose that there is a central processor to make decision for the search-attack mission, then the mission planning model can be defined as deciding the UAVs’ flight paths to search and attack the moving targets, by maximizing the following performance index function:

    where ω ∈ {0 ,1},ω=1 indicates that the UAV is performing a search mission, ω=0 indicates that the UAV is performing an attack mission,U is the decision input which represents the UAV’s position at the next time instant, and C is a constraint set of the mission planning model.

    Definition 4 (Distributed search-attack mission planning model). Suppose that each UAV is an independent individual with a separate processor to build its own solution, then the centralized search-attack mission planning model can be transformed to be a distributed model.The distributed search index Eq.(3)and attack index Eq.(6)are respectively decomposed as

    where μiis the weight coefficient of the i-th UAV. Then the centralized optimization model Eq. (7) can be decomposed as

    where Xiis the state vector of the i-th UAV,Tiadjoinis the set of UAVs which communicate with the i-th UAV, and Ciis the constraint set of the i-th UAV, which will be given in the next subsection.

    2.3. Constraints of search-attack mission planning model

    The constraints of the mission planning model for multi-UAV mainly include the maneuverability constraints Cm, collision avoidance constraints Ccand threat avoidance constraints Ct. Then the constraints set Ciin Eq. (9) can be expressed as Ci={Cm, Cc, Ct}.

    (1) Maneuverability constraints. The maximum turning angle φmaxof each UAV which limits its turning radius and rate is considered and expressed by

    where φi(k) is the turning angle of the i-th UAV at time k.

    (2) Collision avoidance constraints. A safe distance dminbetween two UAVs is considered to avoid the collision, which is expressed by

    where dij(k) is the distance between the i-th UAV and the j-th UAV at time k.

    (3)Threat avoidance constraints.A safe distance Rminfrom the threat(such as obstacle,fire and radar)to the UAV is considered.The distance between the UAV and the threat’s center should not be shorter than the radius of the threat, which is expressed by

    where dil(k) is the distance between the i-th UAV and the l-th threat.

    3. Design of DISOMP for cooperative search-attack problem

    The mission will be accomplished by online planning the flight paths of multi-UAV through the information interaction between the UAVs and the battlefield environment. This section will design the DISOMP algorithm for the dynamic targets cooperative search-attack problem.

    3.1. Configuration of DISOMP

    Each UAV in the multi-UAV system is equipped with a separate processor to deal with its local tasks,which contain targets search mission, attack mission and communication with other adjacent UAVs. The configuration of the DISOMP algorithm is shown in Fig. 2, which is composed of a search module, an attack module, a threat avoidance module and a communication module. Design details of the modules are given in the following.

    3.2. Search module based on ACO

    All UAVs take the same search sensors to search the mission area, according to Definition 1. When a target is in the detection range of UAV, the target is considered to be discovered.ACO is an intelligent optimization algorithm with global optimization performance, versatility characteristics.23Based on the ACO algorithm, the waypoint of each UAV is online generated by maximizing the distributed search-attack mission planning performance index Eq. (9) with the constraints Eqs. (10)-(12).

    (1) Simulative relation between ant agent and UAV. In the search module,an UAV is simulated as an ant agent,and thus the ant agent is assumed to have the positioning, perception,memory, movement, combat, communication and selfrenewal capabilities as the UAV platform, while being subject to the UAV’s performance constraints. The UAV flying is simulated as the ant agent moving. An iteration of the ACO algorithm is equal to a decision of the UAV for mission planning, and also equal to a flight step of the UAV. The cooperative search mission problem is simulated as the distributed optimal path searching problem.

    Fig.2 Configuration of DISOMP algorithm.

    (2) Local pheromone update mechanism. When the ant agent completes a state transition,it needs to update the pheromone concentration according to the position distribution of the whole ant colony. The pheromone concentration of grids which have been searched should be reduced to avoid excessive search of a certain area. The information of the j-th ant agent at time kjas is known to the i-th ant agent can be expressed as

    Then the local pheromone update mechanism of the i-th ant agent is described by

    (3) Global pheromone update mechanism. Due to the uncertainty of the environment, such as new target appearing in the area which has been searched, a global enhancement of the pheromone is needed after some intervals. The global pheromone update mechanism is described by

    where F ∈ (0 ,1) is the uncertainty coefficient and Δτg0is the global pheromone update coefficient.

    (4)State transition rule.The transition rule of the ant agent is designed as

    where α and β denote the importance factors of pheromone concentration and heuristic visibility, respectively. The heuristic is represented as the surveillance coverage rate, and hence η=P. GRID(k+1) is the set of candidate grids at the next time, and grid*(k+1) is the decided grid from the candidate grid set according to the transition rule.

    (5) Optimal path generation procedure. The movement of the ant agent is influenced by its own state and the states of the adjacent ant agents. First, the ACO parameters and the mission area are initialized. Second, the local pheromone of the searched area is updated according to Eqs. (13)-(16), and the global pheromone of the mission area is updated according to Eq. (17). Third, the ant agent moves according to the state transition rule Eq.(18),and the optimal flight path is obtained by the ACO algorithm.

    (6) Convergence analysis. Different from the convergence definition of the classical ACO algorithm, the convergence of the DISOMP is defined as the ant’s surveillance coverage rate.If the surveillance coverage rate can finally reach a stable level with certain iterations,the distributed ACO algorithm is considered to be convergent.11If the ant agent is surrounded by the searched grids,it will fall into excessive local searching.Correspondingly,for the DISOMP algorithm,when the coverage rate keeps invariant for the iteration threshold It, the ant agent should move to the nearest unsearched area. This scheme ensures that the coverage rate of the mission area can always reach to 100%. Therefore, the DISOMP algorithm is convergent.

    3.3. Attack module based on PA

    Based on the PA guidance method, the UAV can track and strike the moving target,according to Definition 2.The attack mission is divided into two steps: target tracking and target striking.

    (1) Target tracking. As shown in Fig. 3, the target line azimuth q is the angle of target line and the baseline, σuis the angle between UAV’s velocity vector and the baseline, σTis the angle between the target’s velocity vector and the baseline,ψu(yù)is the angle between the target line and the UAV’s velocity vector,and ψTis the angle between the target line and the target’s velocity vector. The PA guidance method requires that the target line of sight should be kept moving in parallel along the given direction during the guidance process, and thus the azimuth velocity of the target line is controlled to be zero.Therefore, the PA guidance method is expressed by

    Then the guide command of the UAV is computed by

    Fig.3 Illustration of parallel approach scheme.

    (2) Target striking. From the PA guidance law Eq. (20), it is found that when the target is in a linear motion, the UAV can attack the target in any direction and the straight trajectory can be obtained as long as the velocity ratio Vu/VTis constant.When the target is in a complex maneuver, ψu(yù)needs dynamic change.

    3.4. Threat avoidance module based on DC

    When a threat is detected by the UAV,the UAV performs the mission to avoid the threat, which includes two steps: one is the threat judgment and the other is the safe path generation based on DC.

    (1) Threat judgment. When the threat is discovered by the UAV, the UAV will judge whether it is necessary to avoid the threat, according to the relative distance and direction between the UAV and the threat. The UAV moves forward and simultaneously detects the environment to continue the mission. Judge whether the candidate grid can successfully avoid the threat. If it is possible to enter the threatened area in the next step, that is d ≥dil-λRT, then the UAV will generate a safe path based on the DC, as shown in Fig. 4.

    (2) Safe path generation based on DC. The Dubins Curve was originally proposed by Dubins in 1961 and has been widely used in aircraft path planning.24There are normally four types of paths generated by the DC: two circumscribed paths and two inscribed paths.The shortest one will be chosen as the optimal path.As shown in Fig.5,PS(xs,ys)is the initial position with velocity Vs, PF(xf,yf) is the final position with velocity Vf,Rsis the radius of the initial circle,Rfis the radius of the final circle, the dotted line is the inscribed path and the solid line is the circumscribed path.Then the solution γ of DC scheme can be expressed as PS(xs,ys,ψs)→γPF(xf,yf,ψf).According to the Euclidean geometry method, the safe path can be obtained by the following steps8: (A) Figure out the center coordinates of the initial circle Os(xcs,ycs) and the final circle Of(xcf,ycf); (B) Draw a circle, when it is the inscribed DC, the radius of the cycle is Rf+Rs; when it is the circumscribed DC,the radius of the cycle is|Rf-Rs|;(C)The tangent point on the final circle is the exit point PNof the optimal path,and the tangent point on the initial circle is the entry point PX;(D)Finally draw an arc from PSto PXwith the center Os,connect PXand PN,draw an arc from PNto PFwith the center Of,and then the safe optimal path is generated.

    3.5. Communication module

    The communication module runs throughout the entire mission process,which is responsible for the information exchange of the UAV’s moving positions and directions. Each UAV needs to communicate with the adjacent UAVs at set intervals,as shown in Eqs. (15) and (16). The exchanged information mainly includes its own state information used for the collision avoidance and the cooperative control. Moreover, there also exits information exchange between the dynamic environment and the UAVs, as shown in Eq. (17).

    Fig.4 UAV threat detection diagram.

    Fig.5 Circumscribed and inscribed DC.

    4. Simulation study

    In order to verify the effectiveness of the DISOMP algorithm for the dynamic target cooperative search-attack problem, the numerical simulations are carried out based on the MATLAB R2014b software with the computer processor Intel(R)Xeon(R)CPU E3-1230 v5@3.40 GHz, RAM 8.00 GB, and 64-bit WINDOWS 10 operating system.

    4.1. Search-attack mission scene and parameters

    (1)Mission area and target information.Divide the mission area 20 km×20 km into the discrete grids 1000×1000.There are 9 targets moving in the area,whose initial positions,values and moving directions are given in Table 1 and Fig.6,and the moving speeds of the targets are 20 m/s (1 grid distance per unit time).However,the information of the targets is unknown in advance for the UAVs.

    (2) UAV motion parameters. Two homogenous UAVs are sent to the mission area. The first UAV (UAV1) is initially located at position (8, 12) km and the second UAV (UAV2)is initially located at position (8, 8) km, respectively. The UAV’s maximum turning angle φmax=45°, the moving speed Vu=200 m/s(10 grids per unit time),and the detection radius Rs=600 m (30 grids).

    (3) ACO algorithm parameters. The number of the ant agent is equal to the number of the UAVs. The description and value of important system parameters are given in Table 2.

    (4) DISOMP algorithm steps. According to the configuration of DISOMP algorithm shown in Fig. 2, the steps are described in the following:

    Table 1 Target information.

    Fig.6 Target movement diagram.

    Table 2 Description and value of system parameters.

    Step 1. Initialize the multi-UAV system and the mission area.

    Step 2. Based on the exchange information among the multi-UAV system and the dynamic environment, the UAV moves along the optimal path obtained by the ACO algorithm,computes the surveillance coverage rate and detects the mission area.

    Step 3.If there is a target detected,the UAV tracks the target based on the PA guidance method, strikes the target and computes the attack benefit, and then the algorithm goes to Step 5.

    Step 4. If there is a threat detected and it is necessary to avoid the threat after judgment, the UAV avoids the threat based on the DC scheme,and then the algorithm goes to Step 5.

    Step 5.Judge whether the mission is finished.If it is not finished, go back to Step 2, otherwise the mission is finished.

    (5) Complexity analysis. According to the DISOMP algorithm,each UAV has a separate processor to solve its own local optimization problem.The information of other UAVs can be obtained through communication. Therefore, each local optimization problem is mainly related to the state and decision input of the local UAV, which greatly reduces the complexity of the problem. Based on the distribution strategy, the local pheromone update mechanism combined with global pheromone update mechanism is proposed,which avoids the problem of reducing the algorithm efficiency due to excessive communication and pheromone update. Therefore, the DISOMP algorithm takes less time consumption than traditional ACO.

    4.2. Mission completeness analysis of DISOMP

    In order to analyze the mission completeness of DISOMP for the dynamic targets search-attack problem, the mission is divided into the following six sub-missions. The simulation results are shown in Fig. 7(a)-(f), where the dotted (solid) triangle represents the starting (ending) position of the target,and the hexagonal star represents the target that has been destroyed.

    Sub-mission 1. the goal is to search and attack the first target. Fig. 7(a) shows that UAV2 discovers target 3 after flying 21 steps, attacks and successfully destroys the moving target after flying 25 steps.

    Sub-mission 2. the goal is to search and attack the second target. Fig. 7(b) shows that UAV1 discovers target 5 after flying 93 steps, attacks and successfully destroys the moving target after flying 97 steps.

    Sub-mission 3.the goal is to search and attack the third target. Fig. 7(c) shows that UAV1 discovers target 6 after flying 161 steps, attacks and successfully destroys the moving target after flying 165 steps.

    Sub-mission 4. the goal is to search and attack the fourth target. Fig. 7(d) shows that UAV2 discovers target 7 after flying 172 steps,attacks and successfully destroys the moving target after flying 175 steps.

    Sub-mission 5.the goal is to search and attack the fifth target. Fig. 7(e) shows that UAV2 discovers target 8 after flying 491 steps, attacks and successfully destroys the moving target after flying 495 steps.

    Sub-mission 6.the goal is to search and attack all the targets until the UAV reaches its flying range.Fig.7(f)shows that the two UAVs discover 6 targets until they reach their flying range(1000 steps limited).

    Above all, the DISOMP algorithm can search and attack most of the dynamic targets. The mission completeness is mainly determined by the number of the UAVs, the performance(including the flight,detection and attack performance)of the UAV and the motion performance of the dynamic targets.

    4.3. Mission execution efficiency analysis of DISOMP

    In order to analyze the efficiency of the DISOMP algorithm for the dynamic targets search-attack problem, the Scan-Search (SS) algorithm25as a traditional searching method is compared with the DISOMP algorithm. Two algorithms’ iteration numbers are 500.

    (1) Algorithm 1 (SS algorithm). The cooperative searchattack mission response results based on the SS algorithm are shown in Fig. 8(a). UAV1 discovers and attacks the moving targets 4, while UAV2 discovers and attacks the moving targets 4.

    (2) Algorithm 2 (DISOMP algorithm). The cooperative search-attack mission response results based on DISOMP algorithm are shown in Fig.8(b).UAV1 discovers and attacks the moving target 6 and target 8, while UAV2 discovers and attacks the moving target 3, target 5 and target 7.

    (3) Comparison results. The simulation of DISOMP algorithm is carried out 20 times, the comparison results of which are given in Fig. 9. It is found that the UAVs with SS algorithm can search and attack 2 targets, while the UAVs with DISOMP algorithm can search and attack 2.5 targets on average. Therefore, the average efficiency of the DISOMP algorithm is much greater than that of the SS algorithm.Furthermore, the SS algorithm is an ergodic algorithm, and thus the efficiency will be degraded when the targets are far from the UAVs. However, as an optimization algorithm, the DISOMP algorithm is operated by minimizing a performance index Eq.(9),which guides the UAVs directly to the area with higher surveillance coverage rate and attack benefit.Therefore,the efficiency of the DISOMP algorithm will not be influenced by the positions of the targets.

    Fig.7 Cooperative search-attack mission response results of DISOMP.

    (4) Real-time performance. The DISOMP algorithm is an online decision-making algorithm, and therefore the real-time performance is very important.However,there is little uniform quantitative criterion to evaluate the time consumption performance of the mission planning algorithm. The time consumptions under different iterations of the DISOMP algorithm are calculated as given in Table 3.It is found that one iteration of the DISOMP algorithm for an UAV takes 90 ms on average.The mission planning belongs to the decision making (upper level) so that its cycle is definitely greater than the navigation and control (lower level). Theoretically, if the interval time between two decisions is greater than the time consumption of each decision, the real-time requirement can be satisfied.Therefore, the time consumption 90 ms for each iteration is reasonable for online applications.results of performing 20 times. It shows that two UAVs can search and attack 2.5 targets on average, while three UAVs can search and attack 3.3 targets on average. Therefore, the new UAV can fast adapt to the multi-UAV system and will improve the mission execution speed.

    Fig.8 Cooperative search-attack mission response results.

    Fig.9 Mission execution efficiency comparison between DISOMP and SS.

    Table 3 Time consumption analysis.

    Case 2. New UAV enters during mission process. Assume that a new UAV (UAV3) is initially located at the position(14, 12) km and joins into the multi-UAV system at the 172th iteration. The search-attack mission response results are shown in Fig.12.The black dashed line indicates the flight path of new UAV during the mission.The fifth target(target 8)is quickly detected after 253 iterations,which is faster than the

    Table 4 Mission response results of Case 1.

    4.4. Multi-UAV system suitability analysis of DISOMP

    In order to further verify the multi-UAV system suitability of the DISOMP algorithm, four cases are considered, including adding a new UAV at the beginning, adding a new UAV during the process of mission execution,considering the randomly moving targets and considering the threats.

    Case 1. New UAV enters at the beginning. A new UAV(UAV3) entering to the multi-UAV system needs to establish a new communication topology.Assume that the UAV3 is initially located at the coordinate (14, 12) km, and the mission execution results are given in Table 4 and Fig. 10, where it is found that six targets sorted by the order are detected and attacked by UAV3 and UAV2. However, UAV1 does not detect any target and there are still three targets which have not been detected, mainly because the targets are moving and the mission area is large. Fig. 11 shows the simulation case of two UAVs(493 iterations).It can be seen that the DISOMP algorithm based multi-UAV system is flexible and scalable.

    Fig.10 Mission response results of Case 1.

    Fig.11 Comparison results of Case 1.

    Case 3.Targets move randomly.Assume that target 1,target 4, target 6 and target 8 are moving randomly, while the other targets are moving straightly. The cooperative search-attack mission response results are shown in Fig. 13, where target 2 is attacked by UAV1 at the 391th iteration and target 1 is attacked by UAV2 at the 458th iteration.These results exhibit the good mission adaptability of the DISOMP algorithm for the cooperative search-attack mission in the presence of randomness.

    Case 4. Threats appear in mission area. Assume that there are three threats in the mission area, which should be avoided by the UAVs for safety. The threats can be considered as the circular areas. The center coordinates of threat 1, threat 2 and threat 3 are(12,6)km,(4,14)km and(16,16)km,respectively. The radii of threat 1, threat 2 and threat 3 are 3.6 km,3 km and 1 km, respectively. The cooperative search-attack mission response results are shown in Fig.14.Target 1 and target 3 are searched and attacked by UAV2 at the 37th iteration and 158th iteration,respectively.It can be seen that the UAVs can effectively avoid the threats and continue to execute the search and attack mission,which shows the good environmental adaptability of the DISOMP algorithm for the cooperative search-attack mission in the presence of threats.

    Fig.12 Mission response results of Case 2.

    Fig.13 Mission response results of Case 3.

    Fig.14 Mission response results of Case 4.

    5. Conclusions

    A novel distributed down-top scheme for the cooperative search-attack integration mission problem with dynamic targets and threats is developed for the multi-UAV system. The DISOMP algorithm is composed of search, attack, avoidance and communication modules.The thorough simulation results show that the DISOMP algorithm has high mission completeness, execution efficiency and system suitability. It contributes to making the multi-UAV system flexible, scalable and adaptive to the environment and mission changes. In a word, it is an online mission planning algorithm which is suitable for the practical applications.

    Moreover, the DISOMP algorithm can be extended to the cooperative search-attack mission problem of the UAV swarm or the heterogeneous multi-UAV system.For the UAV swarm,a reliable and flexible communication topology needs to be designed.For the heterogeneous multi-UAV system,a cooperative task allocation strategy is very important.

    Acknowledgements

    This work was supported in part by National Natural Science Foundation of China (Nos. 61741313, 61673209, and 61533008), Jiangsu Six Peak of Talents Program, China (No.KTHY-027), Postgraduate Research & Practice Innovation Program of Jiangsu Province, China (No. KYCX18_0303).

    日日摸夜夜添夜夜爱| 久久综合国产亚洲精品| 亚洲精品久久国产高清桃花| 国产单亲对白刺激| 久久久欧美国产精品| 99视频精品全部免费 在线| 男女下面进入的视频免费午夜| 欧美性感艳星| 熟女人妻精品中文字幕| 淫妇啪啪啪对白视频| 99久久九九国产精品国产免费| 日本五十路高清| 国产成人福利小说| 国内精品宾馆在线| 午夜精品一区二区三区免费看| 精品不卡国产一区二区三区| 久久久久久久久大av| 男女视频在线观看网站免费| 久久久久久久久久久丰满| 看免费成人av毛片| 一a级毛片在线观看| 亚洲av一区综合| 一级黄片播放器| 99热精品在线国产| 日韩av不卡免费在线播放| 哪里可以看免费的av片| 狂野欧美白嫩少妇大欣赏| 别揉我奶头 嗯啊视频| 免费看光身美女| 色综合色国产| 中文资源天堂在线| 最近手机中文字幕大全| 国产精品久久视频播放| 中国国产av一级| 欧美性感艳星| 一个人观看的视频www高清免费观看| 国模一区二区三区四区视频| 男人和女人高潮做爰伦理| 欧美中文日本在线观看视频| 波多野结衣巨乳人妻| 国产黄片美女视频| 国产精品久久久久久精品电影| 亚洲国产精品成人综合色| 成年女人毛片免费观看观看9| 久久久久免费精品人妻一区二区| 亚洲精品成人久久久久久| 综合色丁香网| 干丝袜人妻中文字幕| 欧美日本视频| 亚洲精品一区av在线观看| 噜噜噜噜噜久久久久久91| 热99re8久久精品国产| 国产伦精品一区二区三区四那| 国产高潮美女av| 国产国拍精品亚洲av在线观看| 一本一本综合久久| 亚洲人成网站在线观看播放| 国产 一区精品| 欧洲精品卡2卡3卡4卡5卡区| 日本一本二区三区精品| 精品一区二区三区视频在线观看免费| 亚洲内射少妇av| 能在线免费观看的黄片| 色5月婷婷丁香| 日本与韩国留学比较| 国产精品爽爽va在线观看网站| 精品人妻熟女av久视频| 亚洲中文日韩欧美视频| 亚洲精品日韩av片在线观看| 两个人视频免费观看高清| 久久草成人影院| 欧美一级a爱片免费观看看| 国产精品不卡视频一区二区| 搡老岳熟女国产| 亚洲综合色惰| 禁无遮挡网站| 中文字幕av在线有码专区| 亚洲av中文av极速乱| 狂野欧美激情性xxxx在线观看| 秋霞在线观看毛片| 成人永久免费在线观看视频| 国产精品av视频在线免费观看| 久久午夜福利片| 国产精品永久免费网站| 亚洲成人久久性| 久久精品影院6| 国产精品嫩草影院av在线观看| 中文字幕久久专区| 欧美一区二区精品小视频在线| 色哟哟·www| 狂野欧美白嫩少妇大欣赏| 日韩成人伦理影院| 国产真实伦视频高清在线观看| 两个人视频免费观看高清| 精品久久久久久成人av| 亚洲中文字幕一区二区三区有码在线看| 国产精品一区二区三区四区久久| 一级黄片播放器| 亚洲,欧美,日韩| 日韩中字成人| 免费观看人在逋| 国产美女午夜福利| 日韩欧美一区二区三区在线观看| 久久精品91蜜桃| 国产熟女欧美一区二区| 人人妻人人澡欧美一区二区| avwww免费| 亚洲内射少妇av| 欧美性感艳星| 欧美色视频一区免费| 天堂影院成人在线观看| 91午夜精品亚洲一区二区三区| 狂野欧美激情性xxxx在线观看| 久久久国产成人精品二区| 人妻制服诱惑在线中文字幕| 亚洲欧美成人综合另类久久久 | 日韩欧美精品v在线| 婷婷亚洲欧美| 久久人人精品亚洲av| 色哟哟·www| 国产精品久久久久久av不卡| 欧美3d第一页| 大又大粗又爽又黄少妇毛片口| 亚洲经典国产精华液单| 人人妻人人澡欧美一区二区| 国产黄a三级三级三级人| 午夜老司机福利剧场| 免费看日本二区| 午夜免费男女啪啪视频观看 | 午夜亚洲福利在线播放| 最近2019中文字幕mv第一页| 久久人妻av系列| 国产精品国产高清国产av| 久久欧美精品欧美久久欧美| 国产私拍福利视频在线观看| 99久久无色码亚洲精品果冻| 国产单亲对白刺激| 美女被艹到高潮喷水动态| 高清午夜精品一区二区三区 | 高清日韩中文字幕在线| 哪里可以看免费的av片| 美女内射精品一级片tv| 久久精品夜色国产| 精品99又大又爽又粗少妇毛片| 亚洲中文日韩欧美视频| 国产精品一区二区三区四区免费观看 | 两个人的视频大全免费| 婷婷六月久久综合丁香| 亚洲av一区综合| 性插视频无遮挡在线免费观看| 麻豆乱淫一区二区| 老女人水多毛片| 少妇的逼水好多| 在线观看66精品国产| 国产午夜精品久久久久久一区二区三区 | 亚洲av成人av| 精品午夜福利视频在线观看一区| 高清午夜精品一区二区三区 | 99热6这里只有精品| 久久鲁丝午夜福利片| 男女做爰动态图高潮gif福利片| 久久久久久国产a免费观看| 毛片一级片免费看久久久久| 午夜激情欧美在线| 一本精品99久久精品77| 色5月婷婷丁香| 日本与韩国留学比较| 99久久无色码亚洲精品果冻| 中文字幕av在线有码专区| 少妇丰满av| 1024手机看黄色片| 中文资源天堂在线| 国产精品一区二区三区四区久久| 欧美极品一区二区三区四区| 91久久精品电影网| 18禁在线无遮挡免费观看视频 | 久99久视频精品免费| 亚洲三级黄色毛片| 一a级毛片在线观看| 99久国产av精品国产电影| 国产av麻豆久久久久久久| 美女大奶头视频| 亚洲婷婷狠狠爱综合网| 国产午夜精品论理片| 国内揄拍国产精品人妻在线| 精品无人区乱码1区二区| 国产黄片美女视频| 偷拍熟女少妇极品色| 久久久久久久久久久丰满| 日本免费一区二区三区高清不卡| 欧美xxxx黑人xx丫x性爽| a级一级毛片免费在线观看| 国产一区二区在线观看日韩| 精品无人区乱码1区二区| 亚洲色图av天堂| 国产欧美日韩精品亚洲av| 亚洲精品456在线播放app| 九九在线视频观看精品| av在线天堂中文字幕| 亚洲图色成人| 日本与韩国留学比较| 亚洲va在线va天堂va国产| 久久久欧美国产精品| 久久婷婷人人爽人人干人人爱| 别揉我奶头~嗯~啊~动态视频| 国产精品乱码一区二三区的特点| 女生性感内裤真人,穿戴方法视频| 午夜精品国产一区二区电影 | 亚洲欧美日韩无卡精品| 午夜爱爱视频在线播放| .国产精品久久| 国产精品爽爽va在线观看网站| 色尼玛亚洲综合影院| 久久久久久九九精品二区国产| 一夜夜www| 精品一区二区三区av网在线观看| 男女下面进入的视频免费午夜| 国产精品一区www在线观看| 国产精品国产高清国产av| 亚洲精品粉嫩美女一区| 成年av动漫网址| 精品人妻偷拍中文字幕| 亚洲欧美日韩卡通动漫| 国产69精品久久久久777片| 精品一区二区三区视频在线| 男人的好看免费观看在线视频| 老司机福利观看| 搡老熟女国产l中国老女人| 亚洲激情五月婷婷啪啪| 十八禁网站免费在线| 男人的好看免费观看在线视频| 晚上一个人看的免费电影| 全区人妻精品视频| 床上黄色一级片| 国产精品一二三区在线看| 免费av不卡在线播放| 成年女人永久免费观看视频| 国产在视频线在精品| 人人妻人人澡欧美一区二区| 国产精品美女特级片免费视频播放器| 亚洲人成网站在线播放欧美日韩| 一个人观看的视频www高清免费观看| 成人精品一区二区免费| 国产精品人妻久久久影院| 国产单亲对白刺激| 国产av在哪里看| 毛片女人毛片| 久久久久国产网址| 国产精品女同一区二区软件| 精品久久久久久久人妻蜜臀av| 99热网站在线观看| 精品久久久久久成人av| 一级a爱片免费观看的视频| 麻豆国产av国片精品| h日本视频在线播放| 嫩草影院精品99| av在线老鸭窝| 国产蜜桃级精品一区二区三区| 成年免费大片在线观看| 日韩人妻高清精品专区| 最近在线观看免费完整版| 少妇高潮的动态图| 一夜夜www| 真人做人爱边吃奶动态| 国产亚洲91精品色在线| 国产 一区 欧美 日韩| 亚洲欧美日韩无卡精品| 国产日本99.免费观看| 精品一区二区三区人妻视频| 亚洲精品影视一区二区三区av| av在线亚洲专区| 变态另类丝袜制服| 精品一区二区三区av网在线观看| 我的女老师完整版在线观看| 色尼玛亚洲综合影院| 国产真实伦视频高清在线观看| 亚洲欧美中文字幕日韩二区| 成人亚洲欧美一区二区av| 最近中文字幕高清免费大全6| 成人精品一区二区免费| 国产一区二区亚洲精品在线观看| 国产色婷婷99| 亚洲av免费在线观看| 老司机福利观看| 国产av在哪里看| 在线免费十八禁| 插逼视频在线观看| 欧美xxxx黑人xx丫x性爽| 不卡视频在线观看欧美| 国产黄色小视频在线观看| 真人做人爱边吃奶动态| 国产精品三级大全| 中文字幕久久专区| 久久精品影院6| 国产综合懂色| 91av网一区二区| 亚洲婷婷狠狠爱综合网| 欧美最黄视频在线播放免费| 亚洲欧美成人精品一区二区| 99热精品在线国产| 亚洲成人久久性| 亚洲精品亚洲一区二区| 国产av在哪里看| 免费大片18禁| 成人鲁丝片一二三区免费| 波多野结衣巨乳人妻| 亚洲av中文av极速乱| 岛国在线免费视频观看| 国内久久婷婷六月综合欲色啪| 成人亚洲欧美一区二区av| 国产亚洲91精品色在线| 久久久国产成人精品二区| 永久网站在线| 日韩亚洲欧美综合| 12—13女人毛片做爰片一| 插阴视频在线观看视频| 一级黄色大片毛片| 成人无遮挡网站| 亚洲av五月六月丁香网| 女人十人毛片免费观看3o分钟| 亚洲无线观看免费| 欧美性猛交黑人性爽| 免费观看精品视频网站| 天堂√8在线中文| av在线老鸭窝| 国产高清视频在线观看网站| 亚洲三级黄色毛片| 变态另类丝袜制服| 99久久精品一区二区三区| 黑人高潮一二区| 日韩欧美国产在线观看| av免费在线看不卡| 又爽又黄a免费视频| 成人国产麻豆网| 女的被弄到高潮叫床怎么办| 网址你懂的国产日韩在线| 日日干狠狠操夜夜爽| 国产在线男女| 久久欧美精品欧美久久欧美| 麻豆久久精品国产亚洲av| 亚洲最大成人av| 一级av片app| 免费观看在线日韩| 中国国产av一级| 又爽又黄a免费视频| 精品人妻偷拍中文字幕| а√天堂www在线а√下载| 国产伦精品一区二区三区四那| 嫩草影视91久久| 日本爱情动作片www.在线观看 | 国产高潮美女av| 亚洲七黄色美女视频| 国产 一区 欧美 日韩| 亚洲人成网站在线播放欧美日韩| 99九九线精品视频在线观看视频| 内地一区二区视频在线| 一区二区三区高清视频在线| 噜噜噜噜噜久久久久久91| 国产视频内射| 网址你懂的国产日韩在线| 国产精品一区二区三区四区久久| 一级黄片播放器| 变态另类成人亚洲欧美熟女| 国国产精品蜜臀av免费| 亚洲精品456在线播放app| 色哟哟哟哟哟哟| 国产成人a∨麻豆精品| 国产毛片a区久久久久| 日日干狠狠操夜夜爽| 少妇熟女aⅴ在线视频| 一夜夜www| 国产成人freesex在线 | 国产亚洲精品综合一区在线观看| 高清日韩中文字幕在线| 国产一区二区三区在线臀色熟女| 狂野欧美激情性xxxx在线观看| 免费看日本二区| 国产午夜福利久久久久久| 亚洲精品影视一区二区三区av| 特级一级黄色大片| 激情 狠狠 欧美| 乱码一卡2卡4卡精品| 人人妻,人人澡人人爽秒播| 亚洲精品久久国产高清桃花| 久久精品国产亚洲av天美| 一区二区三区高清视频在线| 一夜夜www| 啦啦啦韩国在线观看视频| 自拍偷自拍亚洲精品老妇| 在线免费观看不下载黄p国产| 精品一区二区三区人妻视频| 狠狠狠狠99中文字幕| 日韩大尺度精品在线看网址| 3wmmmm亚洲av在线观看| 日韩高清综合在线| 人妻丰满熟妇av一区二区三区| 午夜a级毛片| 性欧美人与动物交配| 欧美日韩一区二区视频在线观看视频在线 | 91麻豆精品激情在线观看国产| 久久国内精品自在自线图片| 国产精品一区二区免费欧美| 久久99热这里只有精品18| 俺也久久电影网| 内射极品少妇av片p| 我要看日韩黄色一级片| 在线国产一区二区在线| 亚洲精品粉嫩美女一区| 久久人妻av系列| 久久精品夜夜夜夜夜久久蜜豆| 色视频www国产| 久久欧美精品欧美久久欧美| 午夜爱爱视频在线播放| 亚洲成人av在线免费| 露出奶头的视频| 亚洲av中文字字幕乱码综合| 国产亚洲91精品色在线| 色av中文字幕| 日本黄色视频三级网站网址| 国产伦在线观看视频一区| 国产精品一及| 99久国产av精品| av在线蜜桃| 国产高清激情床上av| 99热6这里只有精品| 成年女人看的毛片在线观看| 卡戴珊不雅视频在线播放| 久久久久免费精品人妻一区二区| 99久久成人亚洲精品观看| 国产精品久久久久久久电影| 在线观看美女被高潮喷水网站| 99热这里只有是精品50| 男人舔女人下体高潮全视频| 桃色一区二区三区在线观看| 人妻夜夜爽99麻豆av| 18禁在线无遮挡免费观看视频 | 久久精品影院6| 国产精品一区二区免费欧美| 欧美性猛交黑人性爽| 午夜免费男女啪啪视频观看 | 成人精品一区二区免费| 日本与韩国留学比较| 国产三级中文精品| 最近中文字幕高清免费大全6| 一级毛片aaaaaa免费看小| 国产蜜桃级精品一区二区三区| 免费看av在线观看网站| 一区二区三区高清视频在线| 国产女主播在线喷水免费视频网站 | 麻豆国产97在线/欧美| 色哟哟·www| 欧美潮喷喷水| 美女xxoo啪啪120秒动态图| 国产毛片a区久久久久| 俺也久久电影网| 久久久久久九九精品二区国产| 久久精品国产亚洲网站| 国内揄拍国产精品人妻在线| 精品久久久噜噜| 噜噜噜噜噜久久久久久91| 天天一区二区日本电影三级| 男插女下体视频免费在线播放| 日韩欧美 国产精品| 成年免费大片在线观看| 精品一区二区免费观看| 国产伦精品一区二区三区四那| 在线观看美女被高潮喷水网站| 国语自产精品视频在线第100页| 亚洲欧美清纯卡通| 99国产极品粉嫩在线观看| 特大巨黑吊av在线直播| 国产精品人妻久久久影院| 18+在线观看网站| 丝袜美腿在线中文| 色哟哟哟哟哟哟| 国产精品一二三区在线看| 久久精品国产亚洲av天美| 色综合亚洲欧美另类图片| 欧美最黄视频在线播放免费| 国产黄色小视频在线观看| 国产视频一区二区在线看| 最近2019中文字幕mv第一页| 色噜噜av男人的天堂激情| 亚洲人成网站高清观看| 亚洲性夜色夜夜综合| 国产黄片美女视频| 熟女人妻精品中文字幕| 欧美bdsm另类| 欧美一级a爱片免费观看看| 国产精品精品国产色婷婷| 少妇高潮的动态图| 亚洲国产精品成人久久小说 | 97超视频在线观看视频| 欧美日本视频| 久久久久国内视频| 日日啪夜夜撸| 国产av一区在线观看免费| 亚洲av美国av| 欧美日本视频| 99riav亚洲国产免费| 男人舔奶头视频| 一卡2卡三卡四卡精品乱码亚洲| 亚洲自偷自拍三级| 搞女人的毛片| 日本欧美国产在线视频| 最好的美女福利视频网| 色尼玛亚洲综合影院| 亚洲国产欧美人成| 免费无遮挡裸体视频| 男人和女人高潮做爰伦理| 国产午夜精品久久久久久一区二区三区 | 久久久久国产网址| 一本一本综合久久| 搡老岳熟女国产| 精品久久久久久久久久免费视频| 久久综合国产亚洲精品| 亚洲国产高清在线一区二区三| aaaaa片日本免费| 男女做爰动态图高潮gif福利片| 国产av麻豆久久久久久久| 99国产精品一区二区蜜桃av| 91久久精品电影网| 亚洲人成网站在线播| 国产黄a三级三级三级人| 久久鲁丝午夜福利片| 亚洲欧美日韩高清专用| 日韩中字成人| av专区在线播放| 久久6这里有精品| 国产女主播在线喷水免费视频网站 | 色哟哟哟哟哟哟| 久久草成人影院| 波多野结衣高清作品| 两性午夜刺激爽爽歪歪视频在线观看| 国产亚洲精品久久久com| 无遮挡黄片免费观看| 老师上课跳d突然被开到最大视频| 国产精品爽爽va在线观看网站| av福利片在线观看| 久久精品国产亚洲网站| 美女黄网站色视频| 国产免费男女视频| 麻豆国产av国片精品| 欧美bdsm另类| 国产激情偷乱视频一区二区| 亚洲高清免费不卡视频| 婷婷精品国产亚洲av在线| 亚洲久久久久久中文字幕| 国国产精品蜜臀av免费| 亚洲最大成人中文| 性插视频无遮挡在线免费观看| 亚洲中文字幕日韩| 嫩草影院精品99| 在线免费十八禁| 亚洲欧美一区二区三区黑人 | 男人和女人高潮做爰伦理| 寂寞人妻少妇视频99o| 亚洲精品日本国产第一区| 天天操日日干夜夜撸| 亚洲欧美一区二区三区国产| 22中文网久久字幕| 麻豆乱淫一区二区| av福利片在线| h视频一区二区三区| 嫩草影院入口| 亚洲精品,欧美精品| 99热这里只有是精品50| 亚洲,一卡二卡三卡| 国产永久视频网站| 日日啪夜夜爽| 欧美日韩视频高清一区二区三区二| 天堂中文最新版在线下载| 18禁动态无遮挡网站| 97在线视频观看| 欧美区成人在线视频| 国产精品久久久久久精品古装| 高清av免费在线| 国产精品一区二区在线观看99| 人妻系列 视频| 亚洲精品乱久久久久久| 九草在线视频观看| 亚洲精品第二区| 免费不卡的大黄色大毛片视频在线观看| 国产探花极品一区二区| 简卡轻食公司| 九九久久精品国产亚洲av麻豆| 日日摸夜夜添夜夜添av毛片| 日韩亚洲欧美综合| 精品国产一区二区久久| 色5月婷婷丁香| 久久久久网色| 亚洲国产av新网站| 欧美人与善性xxx| 下体分泌物呈黄色| 久久久久久久久大av| 精品人妻熟女毛片av久久网站| 丝袜脚勾引网站| 精品久久久久久电影网| 亚洲国产精品999| 亚洲国产色片| 亚洲av男天堂| 亚洲国产日韩一区二区| 亚洲欧美日韩另类电影网站| av又黄又爽大尺度在线免费看| 亚洲中文av在线| 久久99热6这里只有精品| 大片电影免费在线观看免费| 夫妻性生交免费视频一级片| 亚洲精品中文字幕在线视频 | 91成人精品电影| 免费观看性生交大片5| 男人舔奶头视频| 精品久久久噜噜| 一区二区三区免费毛片| 免费观看a级毛片全部|