Jingxian Wang

Jingxian Wang

Auto-generated profile, based on publicly available information

Jingxian Wang

National university of defense technology, Changsha, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
8 August 2024 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
RCRong Chen
Rong Chen
JWJingxian Wang
Jingxian Wang
HZHeng Zhou
Heng Zhou
YBYuzhu Bai
Yuzhu Bai
YZYong Zhao
Yong Zhao
XCXiaoqian Chen
Xiaoqian Chen
To ensure that multiagent’s collision-free traversal in a complex 3-D space with numerous obstacles, this article proposes an online centralized path planning and distributed tracking control method. First, considering the position and overall size of the numerous obstacles in 3-D space, a threat model is established by using Gaussian mixture model, which assigns a different threat level to each location in the 3-D space, with closer obstacles posing a greater threat. Subsequently, five rules are defined based on the threat model, namely, target steering, minimal threat, threat threshold, direct connection, and mixed threat. A combination of these rules is used to design a shortest, collision-free, and fast path planning algorithm for the multiagent. To ensure holistic optimality, multiagent path planning is designed as a centralized computation. A distributed tracking control algorithm is then designed based on model predictive control. Finally, the proposed methods are verified by both numerical simulations and semiphysical simulations based on the air-float experimental system, proving the stable generation of collision-free traversal paths in numerous obstacles, and the accurate tracking control. The simulations show that the proposed methods have the characteristics of minimal path length, high-efficiency computation, robust security, general applicability, and small control error.

26 August 2025 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
JWJingxian Wang
Jingxian Wang
CSChenyu Shan
Chenyu Shan
HZHeng Zhou
Heng Zhou
YBYuzhu Bai
Yuzhu Bai
YZYong Zhao
Yong Zhao
QCQuanjing Cheng
Quanjing Cheng
The high computational complexity of target assignment and trajectory planning in on-orbit assembly tasks limits its development. This paper develops a cross-scale framework for target assignment and global energy optimization inspired by chemical reactions. Aiming at the target assignment problem, according to the theory of molecular graph energy, an innovative rapid cost evaluation method based on the configuration transfer matrix energy is proposed. The method directly quantifies the difference in energy consumption of the assignment strategies by calculating the traces of sparse matrices, avoiding the redundant trajectory optimization costing iterations in traditional methods. For the trajectory planning problem, this paper draws on the idea of manifold dimension reduction for the minimum energy path of a chemical reaction to map the cluster configuration to the manifold space. The high-dimensional trajectory optimization problem is transformed into an energy-optimal path solution on the manifold. The effectiveness of the target assignment cost evaluation method is proved by theoretical derivation and simulation calculation. Finally, the advantages of the manifold algorithm in terms of low energy consumption, low initial guessing dependence, and fast computation are verified by comparative analysis.