To overcome the problems of traditional distributed target allocation algorithms in terms of lack of target strategic priority, poor scalability, and robustness, this paper proposes a proximal strategy optimization algorithm that combines threat assessment and attention mechanism (TAPPO). Based on the distributed training framework, the algorithm integrates a threat assessment and dynamic attention strategy and designs a dynamic reward function based on the current hit rate of the drone and the missile benefit ratio to improve the algorithm’s exploration ability and scalability. Through an 8vs8 multi-UAV confrontation experiment in a digital twin simulation environment, the results show that the agent using the TAPPO algorithm for target allocation defeats the state machine with an 85% winning rate and is significantly better than other current mainstream target allocation algorithms, verifying the effectiveness of the algorithm.

With the increasing adoption of cooperative multi-UAV systems in applications such as cargo delivery and ground reconnaissance, the demand for scalable and efficient path planning methods has grown substantially. However, traditional heuristic algorithms are frequently trapped in local optima, require task-specific manual tuning, and exhibit limited generalization capabilities. Furthermore, their dependence on iterative optimization renders them unsuitable for large-scale real-time applications. To address these challenges, this paper introduces an end-to-end deep reinforcement learning framework that bypasses the reliance on handcrafted heuristic rules. The proposed method leverages an encoder–decoder architecture with multi-head attention (MHA), where the encoder generates embeddings for UAVs and task parameters, while the decoder dynamically selects actions based on contextual embeddings and enforces feasibility through a masking mechanism. The MHA module effectively models global spatial-task dependencies among nodes, enhancing solution quality. Additionally, we integrate a Multi-Start Greedy Rollout Baseline to evaluate diverse trajectories via parallelized greedy searches, thereby reducing policy gradient variance and improving training stability. Experiments demonstrated significant improvements in scalability, particularly in 100-node scenarios, where our method drastically reduced inference time compared to conventional methods, while maintaining a competitive path cost efficiency. A further validation on simulated mission environments and real-world geospatial data (sourced from Google Earth) underscored the robust generalization of the framework. This work advances large-scale UAV mission planning by offering a scalable, adaptive, and computationally efficient solution.

The nonholonomic constraints of fixed-wing UAVs, characterized by coupled heading-curvature feasibility and asymmetric costs, fundamentally deviate from classical Euclidean routing assumptions. While standard neural combinatorial optimization (NCO) architectures could theoretically incorporate Dubins costs via reward signals, such naive adaptations lack the capacity to explicitly model the intrinsic SE(2) geometric invariance and directional asymmetry of fixed-wing motion, leading to suboptimal generalization. To bridge this gap, we propose a Dubins-Aware NCO framework. We design a dual-channel embedding to decouple asymmetric physical distances from rotation-stable geometric features. Furthermore, we introduce a Rotary Phase Encoding (RoPhE) mechanism that theoretically guarantees strict SO(2) equivariance within the attention layer. Extensive sensitivity, ablation, and cross-distribution generalization experiments are conducted on tasks spanning varying turning radii and problem variants with instance scales of 10, 20, 36, and 52 nodes. The results consistently validate the superior optimality and stability of our approach compared with state-of-the-art DRL and NCO baselines, while maintaining significant computational efficiency advantages over classical heuristics. Our results highlight the importance of explicitly embedding geometry-physics consistency, rather than relying on scalar reward signals, for real-world fixed-wing autonomous scheduling.

Currently, most food recognition relies on deep learning for category classification. However, these approaches struggle to effectively distinguish between visually similar food samples, highlighting the pressing need to address fine-grained issues in food recognition. To mitigate these challenges, we propose the adoption of a Gaussian and causal-attention model for fine-grained object recognition.In particular, we train to obtain Gaussian features over target regions, followed by the extraction of fine-grained features from the objects, thereby enhancing the feature mapping capabilities of the target regions. To counteract data drift resulting from uneven data distributions, we employ a counterfactual reasoning approach. By using counterfactual interventions, we analyze the impact of the learned image attention mechanism on network predictions, enabling the network to acquire more useful attention weights for fine-grained image recognition. Finally, we design a learnable loss strategy to balance training stability across various modules, ultimately improving the accuracy of the final target recognition. We validate our approach on four relevant datasets, demonstrating its excellent performance across these four datasets.We experimentally show that GCAM surpasses state-of-the-art methods on the ETH-FOOD101, UECFOOD256, and Vireo-FOOD172 datasets. Furthermore, our approach also achieves state-of-the-art performance on the CUB-200 dataset.

UAV remote sensing provides centimetre-level imagery for fine-grained cotton growth monitoring, yet existing segmentation models face three challenges: cotton fields exhibit a pronounced row and column structure that standard convolutions struggle to capture; conventional decoders fuse features statically, suppressing fine boundary cues; and the pixel-level class distribution is severely imbalanced. We present DCA-DeepLab, built on DeepLabv3+ with three task-specific components: a Dual-Coordinate Attention Gating (DCAG) module that decouples horizontal and vertical dependencies to encode row and column structures; a Multi-Scale Attention-Guided Modulated Feature Merging (MSAM-MFM) module that reweights semantic and detail features at each location; and an adaptive pixel-level modulated focal loss (APMFL), which focuses training on hard, minority-class pixels. We construct a cotton growth dataset of 11,745 UAV patches with four semantic classes. On this dataset and the public LoveDA benchmark, DCA-DeepLab attained the highest mIoU among the compared methods (51.74% and 51.71%), exceeding the strongest cotton baseline by 1.10 percentage points. Relative to DeepLabv3+, the Vigorous and Sparse minority-class IoUs improved by 3.51 and 1.91 percentage points, respectively, and Vigorous recall rose from 51.85% to 60.04%, with only 3.9% more parameters. These results show that encoding directional structure and adaptively balancing class contributions benefits fine-grained UAV crop segmentation.