Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Baoquan Li

dblp:136/5426 · DBLP profile ↗
← Back
16ranked-venue papers
3as first author
6since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 2 first-authorSystems, architecture and hardware · 4 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › flash and SSD › flash memory management
garbage collection
1.622025
Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-Trees · IEEE Trans. Computers 2025
Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees · ICDE 2024
Storage systems
key-value storage
1.622025
Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-Trees · IEEE Trans. Computers 2025
Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees · ICDE 2024
Storage systems › key-value storage
LSM-tree
1.622025
Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-Trees · IEEE Trans. Computers 2025
Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees · ICDE 2024
Storage systems › key-value storage
compaction
0.912025
Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-Trees · IEEE Trans. Computers 2025
Storage systems › flash and SSD › flash memory management › garbage collection
write amplification
0.812024
Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees · ICDE 2024
Robotics › Motion planning and robot control › robot control › stabilization control
feedback stabilization
0.212014
Feedback stabilizer-based trajectory planning of mobile robots with kinematic constraints · ICRA 2014
Robotics › Motion planning and robot control
motion planning
0.212014
Feedback stabilizer-based trajectory planning of mobile robots with kinematic constraints · ICRA 2014
Robotics › Motion planning and robot control
trajectory planning
0.212014
Feedback stabilizer-based trajectory planning of mobile robots with kinematic constraints · ICRA 2014
Robotics › Motion planning and robot control › mobile robot control
nonholonomic mobile robot
0.112014
Feedback stabilizer-based trajectory planning of mobile robots with kinematic constraints · ICRA 2014

Methods — techniques the papers use, named apart from their topics

compensated size · 1.6dynamic GC scheduling · 0.9compaction strategy · 0.8path generation · 0.2optimal velocity planning · 0.2
YearPublicationVenuePosition
2026 LWFusionFormer: Lightweight Convolution and Transformer Fusion for Accurate and Efficient Depth Estimation
Dabin Xue, Baoquan Li, Yueyuan Li, Fuyun Sun, Xuebo Zhang 0003
IEEE Trans Autom. Sci. Eng.2
2025 Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-Trees
abstract
Key-Value Stores (KVS) based on log-structured merge-trees (LSM-trees) are widely used in storage systems but face significant challenges, such as high write amplification caused by compaction. KV-separated LSM-trees address write amplification but introduce significant space amplification, a critical concern in cost-sensitive scenarios. Garbage collection (GC) can reduce space amplification, but existing strategies are often inefficient and fail to account for workload characteristics. Moreover, current key-value (KV) separated LSM-trees overlook the space amplification caused by the index LSM-tree. In this paper, we systematically analyze the sources of space amplification in KV-separated LSM-trees and propose Scavenger+, which achieves a better performance-space tradeoff. Scavenger+ introduces (1) an I/O-efficient garbage collection scheme to reduce I/O overhead, (2) a space-aware compaction strategy based on compensated size to mitigate index-induced space amplification, and (3) a dynamic GC scheduler that adapts to system load to make better use of CPU and storage resources. Extensive experiments demonstrate that Scavenger+ significantly improves write performance and reduces space amplification compared to state-of-the-art KV-separated LSM-trees, including BlobDB, Titan, and TerarkDB.
Jianshun Zhang, Fang Wang 0001, Jiaxin Ou, Sheng Qiu, Junxun Huang, Baoquan Li, Peng Fang 0002, Dan Feng 0001
IEEE Trans. Computers8
2024 Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees
abstract
Key- Value Stores (KVS) implemented with log- structured merge-tree (LSM-tree) have gained widespread ac-ceptance in storage systems. Nonetheless, a significant challenge arises in the form of high write amplification due to the compaction process. While KV-separated LSM-trees successfully tackle this issue, they also bring about substantial space am-plification problems, a concern that cannot be overlooked in cost-sensitive scenarios. Garbage collection (GC) holds significant promise for space amplification reduction, yet existing GC strategies often fall short in optimization performance, lacking thorough consideration of workload characteristics. Additionally, current KV-separated LSM-trees also ignore the adverse effect of the space amplification in the index LSM-tree. In this paper, we systematically analyze the sources of space amplification of KV- separated LSM-trees and introduce Scavenger, which achieves a better trade-off between performance and space amplification. Scavenger initially proposes an I/O-efficient garbage collection scheme to reduce I/O overhead and incorporates a space-aware compaction strategy based on compensated size to minimize the space amplification of index LSM-trees. Extensive experiments show that Scavenger significantly improves write performance and achieves lower space amplification than other KV-separated LSM-trees (including BlobDB, Titan, and TerarkDB).
Jianshun Zhang, Fang Wang 0001, Sheng Qiu, Jiaxin Ou, Junxun Huang, Baoquan Li, Peng Fang 0002, Dan Feng 0001
ICDE7
2023 PH-ORAM: An efficient persistent ORAM design for hybrid memory systems
Wenpeng He, Dan Feng 0001, Fang Wang 0001, Baoquan Li, Mengting Lu
J. Syst. Archit.4
2023 Cross-based dense depth estimation by fusing stereo vision with measured sparse depth
Hongbao Mo, Baoquan Li, Wuxi Shi, Xuebo Zhang 0003
Vis. Comput.2
2022 Virtual-Goal-Guided RRT for Visual Servoing of Mobile Robots With FOV Constraint
abstract
In this article, a virtual-goal-guided rapidly exploring random tree (RRT)-based visual servoing approach is proposed for nonholonomic mobile robots to simultaneously satisfy the field-of-view (FOV) constraint and the velocity constraints during the motion toward the desired pose. The presented approach contains two parts: 1) trajectory planning in the scaled Euclidean space and 2) trajectory tracking control. For the trajectory planning part, a new virtual-goal-guided RRT algorithm is designed to guarantee the FOV constraint and the velocity constraints by iteratively exploring the scaled Euclidean space in the presence of unknown image depth. Specifically, a virtual goal directly behind the desired pose is set to guide the tree to extend laterally into the area wherein the robot is easier to satisfy the FOV constraint. In addition, the lateral extension of the tree also helps decrease the lateral error of the robot as much as possible. Following each successful extension toward the virtual goal node, a greedy extension from the newly explored node to the desired pose is attempted using a polar stabilization controller, so that the planned trajectory can accurately arrive at the desired pose. Each newly explored edge in the scaled space is projected into the image space to check for the FOV limit. For the visual tracking part, the final searched trajectory in the scaled space is first transformed into image feature trajectories, which are then tracked by an image-based visual tracking controller. Experiments validate the effectiveness of the proposed approach.
Runhua Wang, Xuebo Zhang 0003, Yongchun Fang, Baoquan Li
IEEE Trans. Syst. Man Cybern. Syst.4
2019 Adaptive fuzzy decentralized control for a class of nonlinear systems with different performance constraints
Wuxi Shi, Fanlei Yan, Baoquan Li
Fuzzy Sets Syst.3
2019 Visual Servoing of Wheeled Mobile Robots Without Desired Images
abstract
This paper proposes a novel monocular visual servoing strategy, which can drive a wheeled mobile robot to the desired pose without a prerecorded desired image. Compared with existing methods that adopt the teaching pattern for visual regulation, this scheme can still work well in the situation that the desired image has not been previously acquired. Thus, with the aid of this method, it is more convenient for mobile robots to execute visual servoing tasks. Specifically, to deal with nonexistence of the desired image, the reference frame is craftily defined by taking advantage of visual targets and the planar motion constraint, and the pose estimation algorithm is designed for the mobile robot with respect to the reference frame. Then, an adaptive visual regulation controller is developed to drive the mobile robot to the intermediate frame, where the parameter updating law is constructed for the unknown feature height based on the concurrent learning framework. Stability analysis shows that regulation errors and height identification error can converge simultaneously. Afterwards, the mobile robot is driven to the metric desired pose with the identified feature height. Both simulation and experimental results are provided to validate the performance of this strategy.
Baoquan Li, Xuebo Zhang 0003, Yongchun Fang, Wuxi Shi
IEEE Trans. Cybern.1
2019 Acceleration-Level Pseudo-Dynamic Visual Servoing of Mobile Robots With Backstepping and Dynamic Surface Control
abstract
In this paper, we propose an acceleration-level pseudo-dynamic visual servoing structure for the nonholonomic mobile robots, based on which we design two different adaptive controllers-backstepping and dynamic surface control (DSC) in the presence of unknown depth information. Different from existing kinematic controllers, which directly regard linear and angular velocities as control inputs, this paper designs acceleration control that is integrated to easily obtain smooth velocity signals to be accurately executed by the robot. Two controllers are designed and analyzed with Lyapunov techniques: 1) a backstepping controller yielding asymptotical stability and 2) a dynamic surface controller ensuring system errors to be ultimately uniformly bounded. The unknown depth is handled by designing an adaptive parameter estimation law in both methods. Finally, a comparison between backstepping and DSC is given based on the experimental results and the design procedures.
Xuebo Zhang 0003, Runhua Wang, Yongchun Fang, Baoquan Li, Bojun Ma
IEEE Trans. Syst. Man Cybern. Syst.4
2018 Adaptive fuzzy control for feedback linearizable MIMO nonlinear systems with prescribed performance
Wuxi Shi, Baoquan Li
Fuzzy Sets Syst.2
2017 Visual Servoing of Mobile Robots with Input Saturation at Kinematic Level
Runhua Wang, Xuebo Zhang 0003, Yongchun Fang, Baoquan Li
ICIG (1)4
2017 Homography-Based Visual Servo Tracking Control of Wheeled Mobile Robots with Simultaneous Depth Identification
Baoquan Li, Wuxi Shi, Yimei Chen
ICONIP (6)2
2017 Visual Servoing of Wheeled Mobile Robots Under Dynamic Environment
Chenghao Yin, Baoquan Li, Wuxi Shi, Ning Sun 0002
ICVS2
2014 Feedback stabilizer-based trajectory planning of mobile robots with kinematic constraints
abstract
Many theoretic approaches for feedback stabilization control of nonholonomic mobile robots cannot be directly applied to practical robots since various kinematic constraints such as the velocity and acceleration limits are not considered in existing methods. To deal with this issue, we aim to propose a generic approach which first uses an (arbitrary) feedback stabilizer to generate the `path' and then rebuilt the corresponding `trajectory' along this `path' to meet various kinematic constraints, which ultimately gives a practical satisfactory solution for local trajectory planning. Specifically, a general framework is established to transform feedback stabilizers into a feasible and highly efficient trajectory planner by using path generation and optimal velocity planning techniques, considering both kinematic and differential constraints. Extensive simulation results are provided to validate the proposed approach.
Xuebo Zhang 0003, Yongchun Fang, Baoquan Li
ICRA4
2013 Visual Servoing of Mobile Robots with Sphere Objects
abstract
The problem that using visual feedback to control the distance and orientation of the mobile robot with respect to a static sphere object is considered in this paper. Firstly, a unit virtual sphere is added on the classical camera model to obtain accurately the direction of the object. After measurable signal analysis, the kinematics model of the system is obtained. Then a switched controller and a continuous adaptive controller are developed to drive the mobile robot to the desired pose. Lastly, in order to estimate the distance between the camera and the object, a nonlinear observer is designed to give an exact estimation for the radius of the object, thus no metric information of the object is needed. Simulation results are collected to validate the effectiveness of the proposed method.
Baoquan Li, Yongchun Fang, Xuebo Zhang 0003
ICIG1
2013 Uncalibrated visual servoing of nonholonomic mobile robots
abstract
In this paper, an uncalibrated visual servo regulation strategy is designed for a nonholonomic mobile robot equipped with an eye-in-hand camera, which drives the mobile robot to the target pose with exponential convergence. Specifically, a novel fundamental matrix-based algorithm is firstly proposed to rotate the robot to point toward the desired position, with the camera intrinsic parameters estimated simultaneously by employing the fundamental matrix and a projection homography matrix. Subsequently, by utilizing the obtained camera intrinsic parameters, a straight-line motion controller is developed to drive the robot to the desired position, with the orientation of the robot always facing the target position. Another pure rotation controller is finally adopted to correct the orientation error. The exponentially convergent properties of the visual servo errors are proven with mathematical analysis. The performance of the proposed uncalibrated visual servo regulation method is further validated by simulation results.
Baoquan Li, Yongchun Fang, Xuebo Zhang 0003
IROS1