To solve the problem of intercepting a moving target by a multirotor unmanned aerial vehicle (UAV) swarm, an optimal guidance strategy is proposed. The proposed guidance law is based on the integration of the classic pure pursuit guidance law and Kuhn–Munkres (KM) optimal matching algorithm, and virtual force potential functions are used to avoid collision. The proposed optimal guidance strategy is demonstrated by simulation experiments. The simulation results indicate that with the proposed optimal guidance strategy, a UAV swarm can intercept a moving target while maintaining the predetermined formation, and during the formation flight, the collisions between UAVs or the target can be avoided. Through a comparative experiment, the proposed optimal matching algorithm is proven to significantly reduce the average per-sampling-period total flight distance of all the UAVs and accelerate the interception process, and the formation completion degree is improved.

In the mobile wireless sensor network (MWSN) field, there exists an important problem—how can we quickly form an MWSN to cover a designated working area on the ground using an unmanned aerial vehicle (UAV) swarm? This problem is of significance in many military and civilian applications. In this paper, inspired by intermolecular forces, a novel molecular force field-based optimal deployment algorithm for a UAV swarm is proposed to solve this problem. A multi-rotor UAV swarm is used to carry sensors and quickly build an MWSN in a designated working area. The necessary minimum number of UAVs is determined according to the principle that the coverage area of any three UAVs has the smallest overlap. Based on the geometric properties of a convex polygon, two initialization methods are proposed to make the initial deployment more uniform, following which, the positions of all UAVs are subsequently optimized by the proposed molecular force field-based deployment algorithm. Simulation experiment results show that the proposed algorithm, when compared with three existing algorithms, can obtain the maximum coverage ratio for the designated working area thanks to the proposed initialization methods. The probability of falling into a local optimum and the computational complexity are reduced, while the convergence rate is improved.

This study presents a novel cooperative bird-driving strategy utilizing unmanned aerial vehicles (UAV) swarms, specifically designed for airport environments, to mitigate the risks posed by bird interference with aircraft operations. Our approach introduces a target trajectory prediction framework that integrates Long Short-Term Memory (LSTM) networks with Kalman Filter algorithms (KF), improves the response speed of UAV swarms in bird-driving tasks, optimizes task allocation, and improves the accuracy and precision of trajectory prediction, making the entire bird-driving process more efficient and accurate. Within this framework, UAV swarms collaborate to drive birds that encroach upon designated protected areas, thereby optimizing bird-driving operations. We present a distributed collaborative bird-driving strategy to ensure effective coordination among UAV swarm members. Simulation experiments demonstrate that our strategy effectively drives dynamically changing targets, preventing them from remaining within the protected area. The proposed solution integrates dynamic target trajectory prediction using LSTM and Kalman Filter, task assignment optimization through the Hungarian algorithm, and 3D Dubins path planning. This innovative approach not only improves the operational efficiency of bird-driving in airport environments but also highlights the potential of UAV swarms to perform airborne missions in complex scenarios. Our work makes a significant contribution to the field of UAV swarm collaboration and provides practical insights for real-world applications.

To enhance the efficiency of locating dynamic missing persons in complex mountain terrain, this study introduces an innovative Slope Probability Search (SPS) algorithm based on a modified A* framework. The algorithm’s core is a dynamic global probability map, constructed by linking terrain slope to the behavioral tendencies of missing persons. This fundamentally shifts the unmanned aerial vehicle (UAV) search paradigm from conventional coverage patterns to intelligent, guided exploration. To ensure a realistic evaluation, we designed three representative dynamic models for the missing persons: Terrain Constrained, Path Following, and Random Walk. The SPS algorithm, through its unique heuristic function, achieves an optimal balance between exploiting high probability areas and exploring new regions to maximize search efficiency. Simulation experiments using real-world geographic data demonstrated that even under severe constraints of limited search duration and sensor range, the algorithm achieved a success rate of 88.9% achieving an average search time substantially lower than that of conventional methods. This research provides a solid theoretical basis and a practical algorithmic framework for developing next generation intelligent search and rescue systems.