This study advances the unmanned aerial vehicle (UAV) localization technology within the framework of a low-altitude economy, with particular emphasis on the accurate and real-time identification and tracking of unauthorized (“black-flying”) drones. Conventional YOLOv8s-based target detection algorithms often suffer from missed detections due to their reliance on single-frame features. To address this limitation, this paper proposes an improved detection algorithm that integrates a long-short-term memory (LSTM) network into the YOLOv8s framework. By incorporating time-series modeling, the LSTM module enables the retention of historical features and dynamic prediction of UAV trajectories. The loss function combines bounding box regression loss with binary cross-entropy and is optimized using the Adam algorithm to enhance training convergence. The training data distribution is validated through Monte Carlo random sampling, which improves the model’s generalization to complex scenes. Simulation results demonstrate that the proposed method significantly enhances UAV detection performance. In addition, when deployed on the RK3588-based embedded system, the method achieves a low false negative rate and exhibits robust detection capabilities, indicating strong potential for practical applications in airspace management and counter-UAV operations.
Sampling-based path planning is widely used in autonomous navigation, but Informed-RRT* still relies mainly on geometric ellipsoidal sampling and does not explicitly evaluate local obstacle risk, which can lead to invalid expansion, redundant nodes, and slow convergence. This paper proposes RC-Informed-RRT*, integrating risk-density-aware adaptive corridor sampling, improvement-bound rejection, and search-state-regulated goal bias. The corridor mechanism combines reference-path deviation, obstacle clearance, and local obstacle density; the rejection mechanism filters low-contribution nodes using an optimistic improvement bound; and the goal-bias strategy adapts target-oriented sampling to the search state. Comparative simulations were conducted in sparse, dense, narrow-passage, and W-shaped environments using 50 randomized trials per algorithm with small perturbations of the start/goal positions and obstacle locations. Relative to Informed-RRT*, RC-Informed-RRT* reduced mean planning time by 45.88–74.76% and final node count by 35.92–60.13%, while reducing final path length by 0.75–4.88% and maintaining 98–100% success rates. Sequential ablation and goal-bias sensitivity experiments further support the complementary roles of the three mechanisms and the fairness of the baseline parameter setting.