A Cooperative Hunting Method for Multi-USV Based on the A* Algorithm in an Environment with Obstacles

Abstract

A single unmanned surface combatant (USV) has poor mission execution capability, so the cooperation of multiple unmanned surface ships is widely used. Cooperative hunting is an important aspect of multi USV collaborative research. Therefore, this paper proposed a cooperative hunting method for multi-USV based on the A* algorithm in an environment with obstacles. First, based on the traditional A* algorithm, a path smoothing method based on USV minimum turning radius is proposed. At the same time, the post order traversal recursive algorithm in the binary tree method is used to replace the enumeration algorithm to obtain the optimal path, which improves the efficiency of the A* algorithm. Second, a biomimetic multi USV swarm collaborative hunting method is proposed. Multiple USV clusters simulate the hunting strategy of lions to pre-form on the target’s path, so multiple USV clusters do not require manual formation. During the hunting process, the formation of multiple USV groups is adjusted to limit the movement and turning of the target, thereby reducing the range of activity of the target and improving the effectiveness of the algorithm. To verify the effectiveness of the algorithm, two sets of simulation experiments were conducted. The results show that the algorithm has good performance in path planning and target search.

Entire-range Cooperative Trajectory Planning of Gliding-guided Projectiles with Weak Maneuverability

“…Emerging as a necessity, the cluster combat mode, which is centered around systems integration, information sharing, and overall coordination, has been developed, and cooperative attack has been introduced as a new constraint in the process of trajectory planning. Depending on the battlefield environment and mission requirements, there are different modes of cooperative combat, such as time cooperation, spatial cooperation [6,7], spatial-temporal cooperation [8][9][10], multi-target task allocation [11,12]. For gliding projectiles attacking fixed targets, the focus is on time coordination, specifically simultaneous impact, which typically involves scenarios of single-artillery multiple launches or multiple artilleries firing simultaneously.…”

The Wide-Area Coverage Path Planning Strategy for Deep-Sea Mining Vehicle Cluster Based on Deep Reinforcement Learning

“…Zhang [34] proposed a novel strategy that integrates sensor area partitioning and flight trajectory planning for multiple UAVs, forming an optimization framework geared towards minimizing task completion duration. Chen [35] proposed a cooperative hunting method for multi-USV based on the A* algorithm in an environment with obstacles and a biomimetic multi-USV cluster collaborative hunting method. Baras [36] introduced an innovative methodology that employs Affinity Propagation (AP) for area allocation in multi-robot CPP.…”