Quanlin Chen

Dr. Quanlin Chen


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
26 March 2025 in Sensors
Verified
Journal Article
Open access
PDF file
YCYang Chu
Yang Chu
QCQuanlin Chen
Quanlin Chen
XYXuefeng Yan
Xuefeng Yan
Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning algorithms are guaranteed to converge to a path solution in finite time, they are proven to be computationally inefficient, making them unsuitable for most practical problems. Resolution-complete algorithms, on the other hand, ensure completeness only if the resolution parameter is sufficiently fine, but they suffer severely from the curse of dimensionality. In contrast, sampling-based algorithms, such as Rapidly Exploring Random Trees (RRT) and its variants, have gained the increasing attention of researchers due to their computational efficiency and effectiveness, particularly in high-dimensional problems. This review paper introduces RRT-based algorithms and provides an overview of their key methodological aspects.

21 October 2025
Verified
Book Chapter
Open access
QCQuanlin Chen
Quanlin Chen
YCYiyu Chen
Yiyu Chen
JHJing Huo
Jing Huo
TDTianyu Ding
Tianyu Ding
Yang GaoYang Gao
Yang Gao
YCYuetong Chen
Yuetong Chen
Bayesian Optimization (BO) has been widely applied to optimize expensive black-box functions while retaining sample efficiency. However, scaling BO to high-dimensional spaces remains challenging. Existing literature proposes performing standard BO in multiple local trust regions (TuRBO) for heterogeneous modeling of the objective function and avoiding over-exploration. Despite its advantages, using local Gaussian Processes (GPs) reduces sampling efficiency compared to a global GP. To enhance sampling efficiency while preserving heterogeneous modeling, we propose to construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving the bound-constrained quadratic program. Additionally, we address the issue of vanishing gradients of GPs in high-dimensional spaces. We provide a convergence analysis and demonstrate through experimental results that our method enhances the efficacy of TuRBO and outperforms a wide range of high-dimensional BO techniques on synthetic functions and real-world applications.

7 September 2024
Verified
Book Chapter
Closed access
PDF file
QCQuanlin Chen
Quanlin Chen
JHJing Huo
Jing Huo
YCYiyu Chen
Yiyu Chen
TDTianyu Ding
Tianyu Ding
Yang GaoYang Gao
Yang Gao
XHXu He
Xu He