Collaborative 3D path planning for multiple unmanned aerial vehicles (UAVs) in dense urban airspace is difficult, which does not come from one factor alone. Buildings, flight restrictions, moving obstacles, and inter-UAV coupling all act together, and the search space grows quickly as the scene becomes more crowded. In such cases, a standard swarm optimizer may still find a path, but it often struggles with early feasibility, later-stage refinement, and local replanning after the environment changes. To deal with these issues, this paper develops a spatio-temporal collaborative improved multi-strategy dung beetle optimization algorithm, called STC-IMSDBO, for urban multi-UAV path planning. The framework combines five linked components: feasible-airspace population initialization, spatio-temporal variable-step search, multi-factor adaptive weighting, local game-based conflict handling, and rolling-horizon replanning. A normalized multi-objective cost is used to balance flight efficiency, smoothness, obstacle avoidance, airspace compliance, and cooperative safety. The method is tested in four simulated urban scenarios and compared with six representative methods. In the tested cases, the STC-IMSDBO generates shorter feasible routes, uses less energy, converges in fewer iterations, and maintains better cooperative safety than the comparison methods. These results suggest that the method is a useful planning option for dense urban missions such as logistics, inspection, and emergency response. That said, larger-swarm runtime tests and field validation are still needed.
Yu et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: