Xin Zhou

Dr. Xin Zhou

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 October 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XZXin Zhou
Xin Zhou
WWWeiping Wang
Weiping Wang
Tao WangTao Wang
Tao Wang
YLYonglin Lei
Yonglin Lei
FZFangcheng Zhong
Fangcheng Zhong

21 April 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
YWYanfeng Wang
Yanfeng Wang
Tao WangTao Wang
Tao Wang
XZXin Zhou
Xin Zhou
Maxwell TsaiMaxwell Tsai
Maxwell Tsai
RLRunmin Liu
Runmin Liu
YZYifan Zhu
Yifan Zhu
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.

3 February 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
TLTongxin Li
Tongxin Li
Weiping WangWeiping Wang
Weiping Wang
XLXiaobo Li
Xiaobo Li
Tao WangTao Wang
Tao Wang
XZXin Zhou
Xin Zhou
Meigen HuangMeigen Huang
Meigen Huang
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.

6 June 2022 in Electronics
Verified
Journal Article
Open access
PDF file
Mingyu NanMingyu Nan
Mingyu Nan
YZYifan Zhu
Yifan Zhu
LKLi Kang
Li Kang
Tao WangTao Wang
Tao Wang
XZXin Zhou
Xin Zhou
Unmanned aerial vehicle (UAV) swarms have significant advantages in terms of cost, number, and intelligence, constituting a serious threat to traditional frigate air defense systems. Ship-borne short-range anti-air weapons undertake terminal defense tasks against UAV swarms. In traditional air defense fire control systems, a dynamic weapon-target assignment (DWTA) is disassembled into several static weapon target assignments (SWTAs), but the relationship between DWTAs and SWTAs is not supported by effective analytical proof. Based on the combat scenario between a frigate and UAV swarms, a model-based reinforcement learning framework was established, and a DWAT problem was disassembled into several static combination optimization (SCO) problems by means of the dynamic programming method. In addition, several variable neighborhood search (VNS) operators and an opposition-based learning (OBL) operator were designed to enhance the global search ability of the original Grey Wolf Optimizer (GWO), thereby solving SCO problems. An improved grey wolf algorithm based on reinforcement learning (RL-IGWO) was established for solving DWTA problems in the defense of frigates against UAV swarms. The experimental results show that RL-IGWO had obvious advantages in both the decision making time and solution quality.

29 July 2019 in IEEE Systems Journal
Verified
Journal Article
Closed access
XZXin Zhou
Xin Zhou
Weiping WangWeiping Wang
Weiping Wang
Tao WangTao Wang
Tao Wang
MLMeng Li
Meng Li
FZFangcheng Zhong
Fangcheng Zhong
It is a challenging problem to make the team of unmanned aerial vehicles perform well to gather up-to-date situational awareness in dynamic environments. To solve the challenge, in this paper, a novel algorithm is presented on the multiagent information gathering problem. First, the physical environment is modeled as an undirected graph, where information obeying the multistate Markov chain is distributed in each vertex. Each agent is allocated in a designated area, where the objective of the team is to gather as much valuable information as possible. Second, this problem is formulated as the factored multiagent partially observable Markov decision process. Furthermore, a scalable centralized online planning algorithm is proposed by iteratively computing patrolling routes for each agent in a greedy fashion. These patrols are bounded optimal in specific conditions. In addition, we evaluate the algorithm on multiagent information gathering scenarios empirically by benchmarking it against some state-of-the-art online planning solvers, i.e., partially observable Monte Carlo planning and factor-value partially observable Monte Carlo planning. Experimental results show that the algorithm typically performs at least 9.04% better than these solvers in the four-agent patrolling problem with coupling degree being three, and can scale up to 100 agents with complex coupling relationships.

24 August 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
XZXin Zhou
Xin Zhou
WWWeiping Wang
Weiping Wang
Tao WangTao Wang
Tao Wang
XLXiaobo Li
Xiaobo Li
TJTian Jing
Tian Jing
The research about unmanned aerial vehicle (UAV) swarm has developed rapidly in recent years, especially the UAV swarm with sensors which is becoming common means of achieving situational awareness. Due to inadequate researches of the UAV swarm with complex control structure currently, we propose a patrolling task planning algorithm for the UAV swarm with double-layer centralized control structure under the uncertain and dynamic environment. The main objective of the UAV swarm is to collect environment information as much as possible. To summarized, the primary contributions of this paper are as follows. We first define the patrolling problem. After that, the patrolling problem is modeled as the Partially Observable Markov Decision Process (POMDP) problem. Building upon this, we put forward a myopic and scalable online task planning algorithm. The algorithm contains online heuristic function, sequential allocation method, and the mechanism of bottom-up information flow and top-down command flow, reducing the computation complexity effectively. Moreover, as the number of control layers increases, this algorithm guarantees the performance without increasing the computation complexity for the swarm leader. Finally, we empirically evaluate our algorithm in the specific scenarios.