Jiaxiang Xu

Dr. Jiaxiang Xu


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
26 January 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZZZhiyong Zha
Zhiyong Zha
HGHanFang Ge
HanFang Ge
CZChengcheng Zou
Chengcheng Zou
FLFei Long
Fei Long
XHXingfeng He
Xingfeng He
JXJiaxiang Xu
Jiaxiang Xu
Remote calibration is an advanced methodology that leverages electricity meters, intelligent detection, and computing technologies to enhance calibration efficiency and precision significantly. However, current research predominantly focuses on isolated calibration architectures tailored to single-laboratory environments. In contrast, distributed remote calibration systems that integrate multiple nodes remain in their early developmental stages, despite their considerable potential for improving scalability and operational efficiency. The purpose of this paper is to propose a multi-point collaborative distributed remote calibration model that improves scalability and operational efficiency for remote sensing devices. It addresses the challenge of resource allocation for synchronous calibration across distributed nodes by introducing a hybrid genetic algorithm that optimises scheduling and resource management. Experimental results reveal that the proposed algorithm surpasses other comparable methods in its category, highlighting its capability to improve resource efficiency in distributed remote calibration systems. Additionally, the hybrid genetic algorithm offers profound insights and effective solutions to the intricate challenges of task scheduling in dual-container synchronisation, enhancing both scheduling performance and system dependability.

1 May 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JXJiaxiang Xu
Jiaxiang Xu
XLXinru Li
Xinru Li
YXYunsheng Xu
Yunsheng Xu
FZFeng Zhou
Feng Zhou
XXXingchen Xiang
Xingchen Xiang
DDDeng Deng
Deng Deng
The rapid advancement of unmanned aerial vehicle (UAV) technology has led to its widespread adoption in military reconnaissance, disaster monitoring, environmental inspection, and related fields. However, a single UAV often faces limitations when executing large-scale and complex missions. UAV swarm technology, which employs multi-agent collaboration, can significantly improve task execution efficiency and overall system performance, representing an area of considerable research importance. Current studies on task allocation and path planning for UAV swarms exhibit certain shortcomings, particularly the high computational complexity and insufficient real-time performance of existing path planning methods when applied to highly dynamic, multi-objective, and large-scale complex scenarios. To address the above challenge, this paper proposes a Gale-Shapley-based Genetic Algorithm (GSGA) for UAV swarm task allocation and path planning. First, a multi-UAV data inspection system model is formulated based on an energy consumption model, analyzing the influence of factors including geographical fairness, data utility, and energy consumption. The proposed GSGA integrates the Gale-Shapley stable matching algorithm for one-to-one task assignment between UAVs and sub-regions with a genetic algorithm optimized for intra-region path planning. Dynamic programming is further employed to refine the flight paths. The results show that the GSGA strategy can effectively improve the balance of task allocation, optimize path length and inspection quality. The proposed method demonstrated robust performance in complex scenarios characterized by numerous task targets and intricate regional partitions, consistently enabling UAVs to complete inspection tasks with high collaborative efficiency.

23 April 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
DHDai Hou
Dai Hou
ZYZhiheng Yao
Zhiheng Yao
BJBo Jin
Bo Jin
XCXingwei Cai
Xingwei Cai
HXHuan Xu
Huan Xu
DDDeng Deng
Deng Deng
With the widespread adoption of the Internet of Things (IoT), UAV–vehicle collaborative inspection systems are crucial for large-scale, IoT-enabled monitoring. Empowered by the IoT, these systems optimize resource allocation and boost the efficiency of IoT-based applications. Nevertheless, variable vehicle and UAV speeds due to wind and precipitation complicate path planning and task scheduling in the IoT-integrated setup. To solve this, this study offers an adaptive solution for dynamic, complex-weather scenarios within the IoT framework. A dynamic task-processing model was developed first, using real-time IoT sensor data for better decisions. Then, the KGTSA optimization algorithm was designed. It combines K-means clustering, HGA, and TS, considering UAV and vehicle speed variations in complex weather and making full use of IoT-device data. K-means generates an initial solution, HGA refines it, and TS fine-tunes UAV routes and task assignments. The simulation results show that KGTSA significantly cuts data collection time while maintaining flexibility. It efficiently manages speed and path uncertainties in complex weather, optimizing task efficiency without weather forecasts. Compared to traditional algorithms, KGTSA shortens data collection time and adapts better to dynamic IoT environments for real-world efficiency.

15 June 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
JXJiaxiang Xu
Jiaxiang Xu
ZZZhanhao Zhang
Zhanhao Zhang
JWJunfei Wang
Junfei Wang
BOBiao Ouyang
Biao Ouyang
BZBenkuan Zhou
Benkuan Zhou
BXBo Xu
Bo Xu
Although machine learning (ML) models are widely used in many fields, their prediction processes are often hard to understand. This lack of transparency makes it harder for people to trust them, especially in high-stakes fields like healthcare and finance. Human-interpretable explanations for model predictions are crucial in these contexts. While existing local interpretation methods have been proposed, many suffer from low local fidelity, instability, and limited effectiveness when applied to highly nonlinear models. This paper presents SVM-X, a model-agnostic local explanation approach designed to address these challenges. By leveraging the inherent symmetry of the SVM hyperplane, SVM-X precisely captures the local decision boundaries of complex nonlinear models, providing more accurate and stable explanations. Experimental evaluations on the UCI Adult dataset, the Bank Marketing dataset, and the Amazon Product Review dataset demonstrate that SVM-X consistently outperforms state-of-the-art methods like LIME and LEMNA. Notably, SVM-X achieves up to a 27.2% improvement in accuracy. Our work introduces a reliable and interpretable framework for understanding machine learning predictions, offering a promising new direction for future research.

9 January 2026 in Symmetry
Verified
Journal Article
Open access
PDF file
XHXingfeng He
Xingfeng He
MLMingwei Luo
Mingwei Luo
DLDengmu Liu
Dengmu Liu
ZWZhenhua Wang
Zhenhua Wang
LYLiu Yingdong
Liu Yingdong
DDDeng Deng
Deng Deng
Microservices as an emerging architectural approach have been widely applied in the development of online applications. However, in large-scale service systems, frequent data communications, complex invocation dependencies, and strict latency requirements pose significant challenges to efficient microservice orchestration. In addition, microservices need to frequently access the database to achieve data persistence, creating a mutual dependency between the two, and this symmetry further increases the complexity of service orchestration and coordinated deployment. In this context, the strong coupling of service deployment, database layout, and request routing makes effective local optimization difficult. However, existing research often overlooks the impact of databases, fails to achieve joint optimization among databases, microservice deployments, and routing, or lacks fine-grained orchestration strategies for multi-instance models. To address the above limitations, this paper proposes a joint optimization framework based on the Database-as-a-Service (DaaS) paradigm. It performs fine-grained multi-instance queue modeling based on queuing theory to account for delays in data interaction, request queuing, and processing. Furthermore this paper proposes a proximal policy optimization algorithm based on multi-stage joint decision-making to address the orchestration problem of microservices and database instances. In this algorithm, the action space is symmetrical between microservices and database deployment, enabling the agent to leverage this characteristic and improve representation learning efficiency through shared feature extraction layers. The algorithm incorporates a two-layer agent policy stability control to accelerate convergence and a three-level experience replay mechanism to achieve efficient training on high-dimensional decision spaces. Experimental results demonstrate that the proposed algorithm effectively reduces service request latency under diverse workloads and network conditions, while maintaining global resource load balancing.