Abstract

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.

Highlights

  • Multiple unmanned aerial vehicles (UAVs) have received more and more attention for their accomplishments in both military and civil applications

  • (1) A distributed update and fusion scheme for the cognitive map is proposed. We prove that this update and fusion scheme can guarantee that all individual cognitive maps converge to the same one that reflects the true target existence status of each cell in the search region; (2) considering the revisit requirement for the sub-areas in the search region, we develop a controllable revisit mechanism based on a digital pheromone

  • Since the cognitive map of each UAV is incrementally updated based on its sensor observations and the shared information from other UAVs by communication, each UAV continually re-plans its path to guarantee the team of UAVs identifies maximum number of targets or gathers maximum information about environment

Read more

Summary

Introduction

Multiple UAVs have received more and more attention for their accomplishments in both military and civil applications. We prove that this update and fusion scheme can guarantee that all individual cognitive maps converge to the same one that reflects the true target existence status of each cell in the search region; (2) considering the revisit requirement for the sub-areas in the search region, we develop a controllable revisit mechanism based on a digital pheromone This mechanism can control the UAVs to revisit sub-areas with large target probability or high uncertainty; (3) aiming to achieve the tradeoff between the search coverage enhancement and the connectivity maintenance, a connectivity maintenance control strategy based on the minimum spanning tree (MST) topology optimization is presented. Each UAV solves local rolling time domain optimization problem, and obtains its own optimal path to search and cover the surveillance region In this path-planning algorithm, the movement of UAVs is restricted by the potential fields to satisfy the collision avoidance and connectivity maintenance constraints.

Problem
The Description ofinSearch
Simplified Dynamic Model of UAV
Communication Model
Cognitive Map
The Target Probability Map
Update TPM Based on Sensor Observations
Update TPM Based on Shared Information
The Uncertainty
The Digital Pheromone Map
Distributed Path Planning Algorithm for Cooperative Search and Coverage
Distributed
Search Path Decision Process
Prediction Stage
Prediction
Decision Stage
Multi-Objectives of the Cooperative Search and Coverage Mission
Environment Exploration
Target Discovery and Environment Coverage
Collision Avoidance
Connectivity
Effect of the Controllable Revisit Mechanism Based on Digital Pheromone
Group A
It can seen that two UAVs are never the same the UAVs in
18. Minimum distance between
In Group after 35 about
Effect of In
B: FullFigures
Effect of Varying Number of UAVs
Effect of Different Sensing Radius
Effect
Effect of Detection and False Alarm Probabilities
Comparison of the Two Map Update Methods
37. Comparison
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call