Yuchu Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuchu Lu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Qijun Chen
Tongji University
4 shared publications - Chengju Liu
Tongji University
3 shared publications - Jiayuan Du
Tongji University
2 shared publications - Xiaoguo Du
Meituan, Beijing, China
2 shared publications - Chenpeng Yao
Department of Control Science and Engineering, Tongji University, Shanghai, China
1 shared publication - Jiawei Lian
Tongji University
1 shared publication
Latest Publications
- 10 September 2026
- Published by Springer Nature
- p. 178-195
Deconfounded Lifelong Learning for Autonomous Driving via Dynamic Knowledge Spaces
- 10 September 2026
- Published by Springer Nature
- p. 178-195
Deconfounded Lifelong Learning for Autonomous Driving via Dynamic Knowledge Spaces
- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (3) , 3550-3557
A&B-LO: Continuous-Time LiDAR Odometry With Adaptive Non-Uniform B-Spline Trajectory Representation
LiDAR odometry, fused by inertial measurement units (IMU), is an essential task in robotics navigation. Unlike the mainstream methods compensate the motion distortion of LiDAR data by high frequency inertial sensors, this letter deals with the distortion with continuous-time trajectory representation, and achieved competitive performance against state-of-the-art. We propose a compact framework of LiDAR odometry with adaptive non-uniform B-spline trajectory representation to formulate it as continuous-time estimation problem. We deploy point-to-plane registration and pseudo-velocity smoothing constraints to fully utilize geometric and kinematic information of odometry. For faster convergence of optimization, analytical Jacobian of constraints is derived to solve the non-linear least squares minimization. For more efficient B-spline representation, an adaptive knot spacing technique is proposed to adjust the time interval of control poses of spline. Extensive experiments on public and realistic datasets demonstrate validation and efficiency of our system compared with other LiDAR or LiDAR-inertial methods.
- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (3) , 3550-3557
A&B-LO: Continuous-Time LiDAR Odometry With Adaptive Non-Uniform B-Spline Trajectory Representation
LiDAR odometry, fused by inertial measurement units (IMU), is an essential task in robotics navigation. Unlike the mainstream methods compensate the motion distortion of LiDAR data by high frequency inertial sensors, this letter deals with the distortion with continuous-time trajectory representation, and achieved competitive performance against state-of-the-art. We propose a compact framework of LiDAR odometry with adaptive non-uniform B-spline trajectory representation to formulate it as continuous-time estimation problem. We deploy point-to-plane registration and pseudo-velocity smoothing constraints to fully utilize geometric and kinematic information of odometry. For faster convergence of optimization, analytical Jacobian of constraints is derived to solve the non-linear least squares minimization. For more efficient B-spline representation, an adaptive knot spacing technique is proposed to adjust the time interval of control poses of spline. Extensive experiments on public and realistic datasets demonstrate validation and efficiency of our system compared with other LiDAR or LiDAR-inertial methods.
- 9 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-12
Circle Fit Matching: A Fast Analytical Laser Scan Matching Method for 2-D Laser Scanners
Laser scanners have been verified successfully by academic research and industrial applications on their eligibility for robot localization tasks. This paper introduces Circle Fit Matching, an analytical and efficient 2D laser scan matching algorithm for the motion estimation problem in structured environments. Unlike traditional iterative methods, we wrap the scan inputs with high-level planar information and model the two-scan transformation estimation problem in a pure geometric manner. The translation and rotation parts are decoupled and solved separately with the plane normal and plane-to-sensor distance. To avoid leading to unstable solutions, at least 2 non-parallel associated planes are necessary, then the degenerated cases are identified and processed to improve the accuracy of the laser odometry. Besides, a two-stage plane feature matching method is proposed. Experiments evaluating the proposed algorithm’s effectiveness, accuracy, and speed have been conducted in both simulation and real-world environments. Experimental results show that our algorithm is fast and effective for the planar environments. The implementation of our method is open source to benefit the robotics community and beyond 1 .
- 9 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-12
Circle Fit Matching: A Fast Analytical Laser Scan Matching Method for 2-D Laser Scanners
Laser scanners have been verified successfully by academic research and industrial applications on their eligibility for robot localization tasks. This paper introduces Circle Fit Matching, an analytical and efficient 2D laser scan matching algorithm for the motion estimation problem in structured environments. Unlike traditional iterative methods, we wrap the scan inputs with high-level planar information and model the two-scan transformation estimation problem in a pure geometric manner. The translation and rotation parts are decoupled and solved separately with the plane normal and plane-to-sensor distance. To avoid leading to unstable solutions, at least 2 non-parallel associated planes are necessary, then the degenerated cases are identified and processed to improve the accuracy of the laser odometry. Besides, a two-stage plane feature matching method is proposed. Experiments evaluating the proposed algorithm’s effectiveness, accuracy, and speed have been conducted in both simulation and real-world environments. Experimental results show that our algorithm is fast and effective for the planar environments. The implementation of our method is open source to benefit the robotics community and beyond 1 .
- 4 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-15
A Fast Multiplane Segmentation Algorithm for Sparse 3-D LiDAR Point Clouds by Line Segment Grouping
This paper describes an approach for extracting multiple planar regions in 3D point clouds from spinning multi-beam LiDARs. This technique benefits from the intrinsic structure of LiDARs and projective geometry, which allows us to extract line segments efficiently in 2D space and then cluster those line segments to form planes. To extract planes from line primitives, we introduce a novel line segment grouping approach by alternatively searching candidate plane seeds of adjacent line segments and breadth-first searching for neighboring lines fallen on the seeded plane. Exhaustive experiments have been conducted with simulation, realistic data, and a public plane segmentation evaluation benchmark. Experimental results show that our method works well on sparse point clouds with the fastest running speed compared to state-of-the-art methods.
- 4 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-15
A Fast Multiplane Segmentation Algorithm for Sparse 3-D LiDAR Point Clouds by Line Segment Grouping
This paper describes an approach for extracting multiple planar regions in 3D point clouds from spinning multi-beam LiDARs. This technique benefits from the intrinsic structure of LiDARs and projective geometry, which allows us to extract line segments efficiently in 2D space and then cluster those line segments to form planes. To extract planes from line primitives, we introduce a novel line segment grouping approach by alternatively searching candidate plane seeds of adjacent line segments and breadth-first searching for neighboring lines fallen on the seeded plane. Exhaustive experiments have been conducted with simulation, realistic data, and a public plane segmentation evaluation benchmark. Experimental results show that our method works well on sparse point clouds with the fastest running speed compared to state-of-the-art methods.