导航

ACTA AERONAUTICAET ASTRONAUTICA SINICA ›› 2020, Vol. 41 ›› Issue (S1): 723770-723770.doi: 10.7527/S1000-6893.2019.23770

Previous Articles     Next Articles

Multi-UAV cooperative search on region division and path planning

DAI Jian, XU Fei, CHEN Qifeng   

  1. School of Aeronautics and Astronautics, Central South University, Changsha 410083, China
  • Received:2019-12-13 Revised:2019-12-25 Online:2020-06-30 Published:2020-01-02
  • Supported by:
    Equipment Pre-Research Fund for Modeling and Simulation of Unmanned Equipment System (61400010303); Open Foundation for Key Laboratory of Spacecraft Design Optimization and Dynamic Simulation Technologies (Beihang University), Ministry of Education(2019KF003)

Abstract: Aiming at the multi-UAV cooperative search, two sub-problems of UAV working region division and full-area coverage search path planning are discussed and analyzed. By adopting the parallel division method and the concave-convex decomposition method, the region division of convex polygons and non-convex polygons is carried out. Thus, the multi-UAV cooperative search problem is transformed into a single-UAV search problem on a sub-region. Based on this, the "Z"-type path coverage method and the Dubins turning path are used to implement the path planning on each small sub-region, establishing an overall invocation framework of regional division and path planning, which can quickly divide the target area and generate flight routes. Finally, the simulations of convex and non-convex polygons verify the validity of the proposed method in this study.

Key words: unmanned aerial rehicle, cooperative search, region division, path planning, Dubins path

CLC Number: