A Fast Satellite Selection Algorithm Based on NSWOA for Multi-Constellation LEO Satellite Dynamic Opportunistic Navigation

In Global Navigation Satellite System (GNSS)-denied environments, opportunistic positioning using non-cooperative Low Earth Orbit (LEO) satellite signals has shown strong potential. However, dynamic platforms face challenges in maintaining sufficient satellite counts and favorable geometric distributions due to limited signal quality and short observation windows. To address this, we propose a fast satellite selection algorithm based on the Non-Dominated Sorting Whale Optimization Algorithm (NSWOA) for dynamic, multi-constellation LEO opportunistic navigation. By introducing Pareto non-dominated solutions, the algorithm balances Doppler Geometric Dilution of Precision (DGDOP), signal strength, residual visibility time, and receiver sensitivity. Through iterative optimization, it constructs a subset of satellites with minimal DGDOP while reducing computational burden, enabling real-time fusion and switching at the receiver end. We validate the algorithm through UAV-based experiments in dynamic scenarios. Compared to GWO, PSO, and NSGA-II, the proposed method achieves computation time reductions of 27.06%, 27.05%, and 68.57%, respectively. It also reduces the overall navigation solution time to 54.96% of that required when using all visible satellites, significantly enhancing real-time responsiveness and system robustness. These results demonstrate that the NSWOA-based satellite selection algorithm outperforms existing intelligent methods in both computational efficiency and optimization accuracy, making it well-suited for real-time, multi-constellation LEO dynamic opportunistic navigation.