Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
type: Item
instance of: scholarly article
title: Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
zbMATH Open document ID: 1394.90325
DOI: 10.1155/2015/196730
author: Xiaoting Ji
author: Xiangke Wang
author: Lincheng Shen
author: Yifeng Niu
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: This paper presents a distributed cooperative search algorithm for multiple unmanned aerial vehicles (UAVs) with limited sensing and communication capabilities in a nonconvex environment. The objective is to control multiple UAVs to find several unknown targets deployed in a given region, while minimizing the expected search time and avoiding obstacles. First, an asynchronous distributed cooperative search framework is proposed by integrating the information update into the coverage control scheme. And an adaptive density function is designed based on the real-time updated probability map and uncertainty map, which can balance target detection and environment exploration. Second, in order to handle nonconvex environment with arbitrary obstacles, a new transformation method is proposed to transform the cooperative search problem in the nonconvex region into an equivalent one in the convex region. Furthermore, a control strategy for cooperative search is proposed to plan feasible trajectories for UAVs under the kinematic constraints, and the convergence is proved by LaSalle's invariance principle. Finally, by simulation results, it can be seen that our proposed algorithm is effective to handle the search problem in the nonconvex environment and efficient to find targets in shorter time compared with other algorithms.
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6925735
MaRDI profile type: Publication
Wikidata QID: Q59117567
full work available at URL: https://doi.org/10.1155/2015/196730
OpenAlex ID: W1559321162
cites work: Distributed Coverage Control and Data Collection With Mobile Sensor Networks
cites work: Maximizing Search Coverage Using Future Path Projection for Cooperative Multiple UAVs with Limited Communication Ranges
cites work: Decomposition of Polygons into Convex Sets
cites work: Q3750120
cites work: Decomposing a Polygon into Simpler Components
cites work: Vector analysis
cites work: Q4805595
description: scientific article; zbMATH DE number 6925735