Emergent Search of UAV Swarm Guided by the Target Probability Map

Abstract

In the cooperative searching scenario, most traditional methods are based on the top–down mechanisms. These mechanisms are usually offline and centralized. The characteristics limit the adaptability of unmanned aerial vehicle (UAV) swarm to the complex mission environments, such as those with inaccurate information of the targets and grids. In order to improve the searching ability of UAV swarm, a novel searching method named emergent search of UAV swarm guided by the target probability map (ESUSTPM) is proposed. ESUSTPM is based on local rules to organize and guide UAV agents to achieve the flocking state, search the mission area and detect the hidden targets concurrently. In ESUSTPM, local rules contain the flocking rules and the guiding rules. The flocking rules are the interactions between the agents, which are designed by a novel constructed function based on two exponential functions in this paper. The new constructed function can better maintain the relatively stable distances between the agents and realize the smooth transition of the positions at the given centers. The local guiding rules based on the target probability information of the nearby grids are firstly designed to realize the multi-function of the swarm, including full area coverage, target detection and reduction in environmental uncertainty (EU). Finally, the simulations verify that ESUSTPM can achieve the full coverage of the mission area while taking into account the target search. The statistical results also indicate that the searching efficiency of the proposed ESUSTPM is higher than the traditional searching algorithms based on the division and allocation of the area or the heuristic algorithms.

Keywords

• UAV swarm
• emergent search
• target probability map
• unknown environment
• local rules