In recent years, analysis and optimization algorithm based on image data is a research hotspot. Aircraft detection based on aerial images can provide data support for accurately attacking military targets. Although many efforts have been devoted, it is still challenging due to the poor environment, the vastness of the sky background, and so on. This paper proposes an aircraft detection method named TransEffiDet in aerial images based on the EfficientDet method and Transformer module. We improved the EfficientDet algorithm by combining it with the Transformer which models the long-range dependency for the feature maps. Specifically, we first employ EfficientDet as the backbone network, which can efficiently fuse the different scale feature maps. Then, deformable Transformer is used to analyze the long-range correlation for global feature extraction. Furthermore, we designed a fusion module to fuse the long-range and short-range features extracted by EfficientDet and deformable Transformer, respectively. Finally, object class is produced by feeding the feature map to the class prediction net and the bounding box predictions are generated by feeding these fused features to the box prediction net. The mean Average Precision (mAP) is 86.6%, which outperforms the EfficientDet by 5.8%. The experiment shows that TransEffiDet is more robust than other methods. Additionally, we have established a public aerial dataset for aircraft detection, which will be released along with this paper.

Knowledge graph (KG) embedding for predicting missing relation facts in incomplete knowledge graphs (KGs) has been widely explored. In addition to the benchmark triple structural information such as head entities, tail entities, and the relations between them, there is a large amount of uncertain and temporal information, which is difficult to be exploited in KG embeddings, and there are some embedding models specifically for uncertain KGs and temporal KGs. However, these models either only utilize uncertain information or only temporal information, without integrating both kinds of information into the underlying model that utilizes triple structural information. In this paper, we propose an embedding model for uncertain temporal KGs called the confidence score, time, and ranking information embedded jointly model (CTRIEJ), which aims to preserve the uncertainty, temporal and structural information of relation facts in the embedding space. To further enhance the precision of the CTRIEJ model, we also introduce a self-adversarial negative sampling technique to generate negative samples. We use the embedding vectors obtained from our model to complete the missing relation facts and predict their corresponding confidence scores. Experiments are conducted on an uncertain temporal KG extracted from Wikidata via three tasks, i.e., confidence prediction, link prediction, and relation fact classification. The CTRIEJ model shows effectiveness in capturing uncertain and temporal knowledge by achieving promising results, and it consistently outperforms baselines on the three downstream experimental tasks.

The proposed blood cell target detection algorithm based on YOLOv5 addresses the issue of low average accuracy and serious miss detection due to small blood cells and serious cell adhesion in blood cell detection by target detection algorithms. By adding the CBAM (Convolutional Block Attention Module) to the YOLOv5 framework's backbone network and the BIFPN (bidirectional feature pyramid network) to the neck network, the algorithm improves the model's ability to extract features. The experimental results show that the average accuracy (mAP) of the improved YOLOv5 blood cell target detection algorithm is 89.9%, representing a increase over the native YOLOv5s type, and the recall rate and accuracy rate are also increased by 3.2% and 4.2%, respectively. This meets the requirements of the actual scene for blood cell detection.

The primary purpose of task allocation is to build each equipment platform and quickly complete integration planning at the actual combat speed to achieve efficient management of the entire task. In this process, higher requirements are put forward for dynamic, cooperative, and highly adaptive drone colony organization. In this paper, the scheduling problem of hybrid unmanned aerial vehicle (UAV) systems is studied under an uncertain environment. First, the system-capability-task organizational structure is defined and quantified, which lays a foundation for dynamic adjustment of the organizational structure in the future. Then, combined with the theory of flexible network and elastic network management, the model is calculated, and the linear transformation function and fuzzy theory are used to stratify and cluster the capability layers. On this basis, four motif structures are introduced for abnormal nodes in the process of dynamic adjustment, and a dynamic group reconstruction algorithm (DRA-M) is established. Finally, the time and communication load indexes are determined, and the alternative strategy is designed for the failure point. The performance of the classical scheduling algorithm is evaluated by benchmarking it under different conditions. The results show that the algorithm has a good dynamic adjustment ability in the event of a UAV swarm emergency, which is a bright light for the future study of highly adaptive UAV cluster organization.

To address the problem of regional coverage path planning for unmanned aerial vehicle swarms (UAVs), this study proposes an algorithm based on objective programming partitions (OPP) and rule-based spanning tree coverage (RSTC). Aiming at the shortcomings of the traditional Divide Areas based on Robots Initial Positions combined with Spanning Tree Coverage (DARP-STC) algorithm in two core stages, that is, region partitions and spanning tree generation, the proposed algorithm conducts a targeted design and optimization, respectively. In the region partition stage, an objective programming and 0–1 integer programming model are adopted to realize the balanced allocation of UAVs’ task regions. In the spanning tree generation stage, a rule is designed to construct a spanning tree of coverage paths and is proven to achieve the minimum number of turns for the UAV under certain conditions. Both simulations and physical experiments demonstrate that the proposed algorithm can not only significantly reduce the number of turns of UAVs but also enhance the efficiency and coverage degree of tasks for UAV swarms.