Jian Chu

Jian Chu

Auto-generated profile, based on publicly available information

Jian Chu

Shanghai Jiao Tong University

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
19 June 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
ZWZhepei Wang
Zhepei Wang
XZXin Zhou
Xin Zhou
CXChao Xu
Chao Xu
JCJian Chu
Jian Chu
Fei GaoFei Gao
Fei Gao
With much research has been conducted into trajectory planning for quadrotors, planning with spatial and temporal optimal trajectories in real-time is still challenging. In this letter, we propose a framework for large-scale waypoint-based polynomial trajectory generation, with highlights on its superior computational efficiency and simultaneous spatial-temporal optimality. Exploiting the implicitly decoupled structure of the problem, we conduct alternating minimization between boundary conditions and time durations of trajectory pieces. Algebraic convenience of both sub-problems is leveraged to escape poor local minima and achieve the lowest time consumption. Theoretical analysis for the global/local convergence rate of our method is provided. Moreover, based on polynomial theory, an extremely fast feasibility checker is designed for various kinds of constraints. By incorporating it into our alternating structure, a constrained minimization algorithm is constructed to optimize trajectories on the premise of feasibility. Benchmark evaluation shows that our algorithm outperforms state-of-the-art waypoint-based methods regarding efficiency, optimality, and scalability. The algorithm can be incorporated in a high-level waypoint planner, which can rapidly search over a three-dimensional space for aggressive autonomous flights. The capability of our algorithm is experimentally demonstrated by quadrotor fast flights in a limited space with dense obstacles. We release our implementation as an open-source ros-package. 1

1 September 2013 in Journal of Process Control
Verified
Journal Article
Closed access
Zheng-Guang WuZheng-Guang Wu
Zheng-Guang Wu
JPJu H. Park
Ju H. Park
HSHongye Su
Hongye Su
JCJian Chu
Jian Chu

29 December 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
HYHongkai Ye
Hongkai Ye
XZXin Zhou
Xin Zhou
ZWZhepei Wang
Zhepei Wang
CXChao Xu
Chao Xu
JCJian Chu
Jian Chu
Fei GaoFei Gao
Fei Gao
In this letter, we propose a lightweight yet effective Topology Guided Kinodynamic planner (TGK-Planner) for quadrotor aggressive flights with limited onboard computing resources. The proposed system follows the traditional hierarchical planning workflow, with novel designs to improve the robustness and efficiency in both the pathfinding and trajectory optimization sub-modules. Firstly, we propose the topology guided graph , which roughly captures the topological structure of the environment and guides the state sampling of a sampling-based kinodynamic planner. In this way, we significantly improve the efficiency of finding a safe and dynamically feasible trajectory. Then, we refine the smoothness and continuity of the trajectory in an optimization framework, which incorporates the homotopy constraint to guarantee the safety of the trajectory. The optimization program is formulated as a sequence of quadratic programmings (QPs) and can be iteratively solved in a few milliseconds. Finally, the proposed system is integrated into a fully autonomous quadrotor and validated in various simulated and real-world scenarios. Benchmark comparisons show that our method outperforms state-of-the-art methods with regard to efficiency and trajectory quality. Moreover, we will release our code as an open-source package. 1 1Code is released at https://github.com/ZJU-FAST-Lab/TGK-Planner.

21 January 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
XYXinxing Yang
Xinxing Yang
YGYang Genke
Yang Genke
JCJian Chu
Jian Chu
The matrix factorization model has become the cornerstone technique for computational drug repositioning due to its ease of implementation and excellent scalability. However, the matrix factorization model uses the inner product operation to represent the association between drugs and diseases, which is lacking in expressive ability. Moreover, the degree of similarity of drugs or diseases could not be implied on their respective latent factor vectors, which is not satisfy the common sense of drug discovery. Therefore, a neural metric factorization model for computational drug repositioning (NMFDR) is proposed in this work. We novelly consider the latent factor vector of drugs and diseases as a point in the high-dimensional coordinate system and propose a generalized Euclidean distance to represent the association between drugs and diseases to compensate for the shortcomings of the inner product operation. Furthermore, by embedding multiple drug (disease) metrics information into the encoding space of the latent factor vector, the information about the similarity between drugs (diseases) can be reflected in the distance between latent factor vectors. Finally, we conduct wide analysis experiments on three real datasets to demonstrate the effectiveness of the above improvement points and the superiority of the NMFDR model.

29 October 2021 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
JLJiaming Liang
Jiaming Liang
SCShengze Cai
Shengze Cai
CXChao Xu
Chao Xu
TCTehuan Chen
Tehuan Chen
JCJian Chu
Jian Chu
Particle tracking velocimetry (PTV) is a powerful technique for global and nonintrusive flow field measurement, which shows a great potential to improve the spatial resolution compared to other flow visualization technologies (e.g., correlation-based particle image velocimetry). However, performing PTV under flow conditions with high flow speed and high particle density is still a challenge. In addition, more and more research sacrifices the computational efficiency for high accuracy using complex iterative algorithms. To address these problems, we propose a deep particle tracking network, called deep neural network for PTV (DeepPTV), for learning the complex fluid flow motion from two consecutive particle sets efficiently and accurately. First, the local spatial geometry information from neighboring particles is aggregated for each particle along with robust features (i.e., the relative distance to the neighbors), which help to preserve the properties of fluids. Second, to cope with the problem caused by nonuniform seeding density of particles, the multiscale features are combined together in each hierarchy of the neural network. Furthermore, motivated by the convection flow phenomena, the proposed DeepPTV model adopts a novel network architecture named convection architecture to estimate the flow field in a hierarchical framework, namely, from large-scale motion to small-scale motion. Experimental evaluations on both artificial and laboratory particle images demonstrate that the proposed framework can provide satisfactory accuracy that rivals the state-of-the-art methods. Moreover, the presented high efficiency makes it a promising algorithm for real-time estimation and real-time flow control problems.

26 February 2025 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JLJiaxu Liu
Jiaxu Liu
SCSong Chen
Song Chen
SCShengze Cai
Shengze Cai
CXChao Xu
Chao Xu
JCJian Chu
Jian Chu
This article delves into the investigation of a distributed aggregative optimization problem within a network. In this scenario, each agent possesses its own local cost function, which relies not only on the local state variable but also on an aggregated function of state variables from all agents. To expedite the optimization process, we amalgamate the heavy ball and Nesterov's accelerated method with distributed aggregative gradient tracking, resulting in the proposal of two innovative algorithms, aimed at resolving the distributed aggregative optimization problem. Our analysis demonstrates that the proposed algorithms can converge to an optimal solution at a global linear convergence rate when the objective function is strongly convex with the Lipschitz-continuous gradient, and when the parameters (e.g., step size and momentum coefficients) are chosen within specific ranges. In addition, we present several numerical experiments to verify the effectiveness, robustness, and superiority of our proposed algorithms.