导航

ACTA AERONAUTICAET ASTRONAUTICA SINICA ›› 2020, Vol. 41 ›› Issue (5): 323314-323314.doi: 10.7527/S1000-6893.2019.23314

• Electronics and Electrical Engineering and Control • Previous Articles     Next Articles

Revisit mechanism driven multi-UAV cooperative search planning method for moving targets

ZHANG Zhexuan1,2, LONG Teng1,2, XU Guangtong1,2, WANG Yangjie1   

  1. 1. School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China;
    2. Key Laboratory of Dynamics and Control of Flight Vehicle, Ministry of Education, Beijing Institute of Technology, Beijing 100081, China
  • Received:2019-07-25 Revised:2019-08-23 Online:2020-05-15 Published:2019-11-14
  • Supported by:
    National Natural Science Foundation of China (51675047)

Abstract: To efficiently capture moving targets in unknown regions using multi-UAVs, this paper presents a Revisit Mechanism Driven Cooperative Search Planning (RMD-CSP) method to reduce the probability of missing targets and judgmental errors of the sensors. The multi-UAV cooperative search model, subject to the flight performance constraints, is established to maximize the task execution performance. The search maps (i.e., target probability maps, uncertainty maps, and environment search status maps) are initialized according to the prior information of the target, and then updated using Bayes Criterion according to the detected information by the UAVs. The revisit mechanism based on environment-uncertainty-renewal is customized to reduce the missing-target probability. This mechanism guides the UAVs to search the region that has not been revisited for a long time by enlarging the uncertainty of this region. In addition, the revisit mechanism based on objective-function-weight-renewal is customized to direct the UAVs to revisit the region where a new suspected target is found, and check the existence of the target to reduce the judgmental errors caused by the false-alarm probability of the sensors. Based on the receding horizon framework, the search planning problems are divided into a series of short-horizon planning problems to save computational costs. Simulation studies are conducted under classical mission scenarios to verify the effectiveness of the proposed method. Simulation results demonstrate that the RMD-SCP can generate search paths in seconds for each receding horizon. Compared with the scan-search algorithm and the standard probability heuristic algorithm, the RMD-CSP can guide the UAVs to capture more moving targets with fewer judgmental errors, indicating the effectiveness of the proposed method in improving the efficiency of multi-UAV cooperative search missions.

Key words: cooperative search planning, moving targets, search maps, revisit mechanisms, detection probability, false-alarm probability

CLC Number: