Cargando…

A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles

In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Zhong, Gao, Xiaoguang, Fu, Xiaowei
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5982467/
https://www.ncbi.nlm.nih.gov/pubmed/29738497
http://dx.doi.org/10.3390/s18051472
_version_ 1783328248615141376
author Liu, Zhong
Gao, Xiaoguang
Fu, Xiaowei
author_facet Liu, Zhong
Gao, Xiaoguang
Fu, Xiaowei
author_sort Liu, Zhong
collection PubMed
description In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search time, while gathering more information about the environment and finding more targets. For this purpose, a novel cooperative search and coverage algorithm with controllable revisit mechanism is presented. Firstly, as the representation of the environment, the cognitive maps that included the target probability map (TPM), the uncertain map (UM), and the digital pheromone map (DPM) are constituted. We also design a distributed update and fusion scheme for the cognitive map. This update and fusion scheme can guarantee that each one of the cognitive maps converges to the same one, which reflects the targets’ true existence or absence in each cell of the search region. Secondly, we develop a controllable revisit mechanism based on the DPM. This mechanism can concentrate the UAVs to revisit sub-areas that have a large target probability or high uncertainty. Thirdly, in the frame of distributed receding horizon optimizing, a path planning algorithm for the multi-UAVs cooperative search and coverage is designed. In the path planning algorithm, the movement of the UAVs is restricted by the potential fields to meet the requirements of avoiding collision and maintaining connectivity constraints. Moreover, using the minimum spanning tree (MST) topology optimization strategy, we can obtain a tradeoff between the search coverage enhancement and the connectivity maintenance. The feasibility of the proposed algorithm is demonstrated by comparison simulations by way of analyzing the effects of the controllable revisit mechanism and the connectivity maintenance scheme. The Monte Carlo method is employed to validate the influence of the number of UAVs, the sensing radius, the detection and false alarm probabilities, and the communication range on the proposed algorithm.
format Online
Article
Text
id pubmed-5982467
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-59824672018-06-05 A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles Liu, Zhong Gao, Xiaoguang Fu, Xiaowei Sensors (Basel) Article In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search time, while gathering more information about the environment and finding more targets. For this purpose, a novel cooperative search and coverage algorithm with controllable revisit mechanism is presented. Firstly, as the representation of the environment, the cognitive maps that included the target probability map (TPM), the uncertain map (UM), and the digital pheromone map (DPM) are constituted. We also design a distributed update and fusion scheme for the cognitive map. This update and fusion scheme can guarantee that each one of the cognitive maps converges to the same one, which reflects the targets’ true existence or absence in each cell of the search region. Secondly, we develop a controllable revisit mechanism based on the DPM. This mechanism can concentrate the UAVs to revisit sub-areas that have a large target probability or high uncertainty. Thirdly, in the frame of distributed receding horizon optimizing, a path planning algorithm for the multi-UAVs cooperative search and coverage is designed. In the path planning algorithm, the movement of the UAVs is restricted by the potential fields to meet the requirements of avoiding collision and maintaining connectivity constraints. Moreover, using the minimum spanning tree (MST) topology optimization strategy, we can obtain a tradeoff between the search coverage enhancement and the connectivity maintenance. The feasibility of the proposed algorithm is demonstrated by comparison simulations by way of analyzing the effects of the controllable revisit mechanism and the connectivity maintenance scheme. The Monte Carlo method is employed to validate the influence of the number of UAVs, the sensing radius, the detection and false alarm probabilities, and the communication range on the proposed algorithm. MDPI 2018-05-08 /pmc/articles/PMC5982467/ /pubmed/29738497 http://dx.doi.org/10.3390/s18051472 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Liu, Zhong
Gao, Xiaoguang
Fu, Xiaowei
A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title_full A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title_fullStr A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title_full_unstemmed A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title_short A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
title_sort cooperative search and coverage algorithm with controllable revisit and connectivity maintenance for multiple unmanned aerial vehicles
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5982467/
https://www.ncbi.nlm.nih.gov/pubmed/29738497
http://dx.doi.org/10.3390/s18051472
work_keys_str_mv AT liuzhong acooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles
AT gaoxiaoguang acooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles
AT fuxiaowei acooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles
AT liuzhong cooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles
AT gaoxiaoguang cooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles
AT fuxiaowei cooperativesearchandcoveragealgorithmwithcontrollablerevisitandconnectivitymaintenanceformultipleunmannedaerialvehicles