Decomposition and coverage of multi-UAV cooperative search area

被引:0
作者
Yu, Sinan [1 ]
Zhou, Rui [1 ]
Xia, Jie [1 ]
Che, Jun [2 ]
机构
[1] Science and Technology on Aircraft Control Laboratory, Beijing University of Aeronautics and Astronautics, Beijing
[2] Automatic Flight Control Research Institute, AVIC, Xi'an
来源
Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics | 2015年 / 41卷 / 01期
关键词
Convex polygon decomposition; Cooperative search; Coverage path; Multi-UAV(unmanned aerial vehicle); Parallel search strategy;
D O I
10.13700/j.bh.1001-5965.2014.0056
中图分类号
学科分类号
摘要
Coverage search of multi aircraft is a major task for unmanned aerial vehicle (UAV). After dividing the searching area, the problem turns into single UAV coverage search problem in each sub-area. This method will make the whole search problem simpler. The parallel searching strategy was analyzed in detail. Using the parallel searching strategy, the bases of determining the beginning point, turning key points and the ending point was given. This strategy enabled 100% coverage in the search area. The minimal turning radius impacts search path and different situations were discussed. The convex polygon search area was decomposed using a method based on the initial position and the percent of search area of each UAV. Based on the characteristic of UAV searching, the decomposition result was mainly assessed by the quantity of turning. The path from initial position to the search beginning point was discussed. Finally, the simulation result proves this method is feasible. ©, 2015, Beijing University of Aeronautics and Astronautics (BUAA). All right reserved.
引用
收藏
页码:167 / 173
页数:6
相关论文
共 16 条
  • [11] Mirzaei M., Gordon B.W., Rabbath C.A., Et al., Cooperative multi-UAV search problem with communication delay, AIAA Guidance, Navigation, and Control Conference, 8420, pp. 1-11, (2010)
  • [12] Pehlivanoglu Y.V., A new vibrational genetic algorithm enhanced with a Voronoi diagram for path planning of autonomous UAV, Aerospace Science and Technology, 16, 1, pp. 47-55, (2012)
  • [13] Guruprasad K.R., Ghose D., Automated multi-agent search using centroidal voronoi configuration, IEEE Transactions on Automation Science and Engineering, 8, 2, pp. 420-423, (2011)
  • [14] Hert S., Lumelsky V., Polygon area decomposition for multiple-robot workspace division, International Journal of Computational Geometry & Applications, 8, 4, pp. 437-466, (1998)
  • [15] Bolonkin A., Cloutier J.R., Search and attack strategies, 2005 AIAA Guidance, Navigation, and Control Conference and Exhibit, pp. 1-12, (2005)
  • [16] Chen H., Wang X.M., Jiao Y.S., Et al., An algorithm of coverage flight path planning for UAVs in convex polygon areas, Chinese Journal of Aeronautics, 31, 9, pp. 1802-1807, (2010)