Qianli Dong

Qianli Dong

Auto-generated profile, based on publicly available information

Qianli Dong

College of Artificial Intelligence, Institute of Robotics and Automatic Information System, Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin, 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
12 January 2026 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
QDQianli Dong
Qianli Dong
XZXuebo Zhang
Xuebo Zhang
SZShiyong Zhang
Shiyong Zhang
ZWZiyu Wang
Ziyu Wang
ZMZhe Ma
Zhe Ma
HXHaobo Xi
Haobo Xi
Efficient autonomous exploration in large-scale environments remains challenging due to high planning computational cost and low-speed maneuvers. In this article, we propose an efficient dual-layer exploration planning method. The insight of our dual-layer planning method is efficiently finding an acceptable long-term region routing and greedily exploring the target in the first region of routing at high speed. Specifically, we propose a long-term region routing approximate algorithm, called “exploration-oriented heuristic double-tree algorithm”, to ensure real-time planning in large-scale environments. Then, the viewpoint in the first routing region with the highest curvature-penalized score, which can effectively reduce decelerations caused by sharp turn motions, will be chosen as the next exploration target. To further speed up the exploration, we propose an aggressive and safe exploration-oriented trajectory planning approach to enhance exploration continuity and speed. The proposed method is compared with state-of-the-art methods in challenging simulation environments. The results show that the proposed method outperforms other methods in terms of exploration efficiency, computational cost, and trajectory speed. We also conduct real-world experiments to validate the effectiveness of the proposed method. The code will be open-sourced https://github.com/NKU-MobFly-Robotics/EDEN.

3 March 2025 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
SZShiyong Zhang
Shiyong Zhang
XZXuebo Zhang
Xuebo Zhang
QDQianli Dong
Qianli Dong
ZWZiyu Wang
Ziyu Wang
HXHaobo Xi
Haobo Xi
JYJing Yuan
Jing Yuan
In this paper, we propose a systematic framework for fast exploration of complex and large 3-D environments using micro aerial vehicles (MAVs). The key insight is the organic integration of the frontier-based and sampling-based strategies that can achieve rapid global exploration of the environment. Specifically, a field-of-view-based (FOV) frontier detector with the guarantee of completeness and soundness is devised for identifying 3-D map frontiers. Different from random sampling-based methods, the deterministic sampling technique is employed to build and maintain an incremental road map based on the recorded sensor FOVs and newly detected frontiers. With the resulting road map, we propose a two-stage path planner. First, it quickly computes the global optimal exploration path on the road map using the lazy evaluation strategy. Then, the best exploration path is smoothed for further improving the exploration efficiency. We validate the proposed method both in simulation and real-world experiments. The comparative results demonstrate the promising performance of our planner in terms of exploration efficiency, computational time, and explored volume.

15 January 2026 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
HXHaobo Xi
Haobo Xi
SZShiyong Zhang
Shiyong Zhang
QDQianli Dong
Qianli Dong
YTYunze Tong
Yunze Tong
SWSongyang Wu
Songyang Wu
XZXuebo Zhang
Xuebo Zhang
This letter proposes R-VoxelMap, a novel voxel mapping method that constructs accurate voxel maps using a geometry-driven recursive plane fitting strategy to enhance the localization accuracy of online LiDAR odometry. VoxelMap and its variants typically fit and check planes using all points in a voxel, which may lead to plane parameter deviation caused by outliers, over segmentation of large planes, and incorrect merging across different physical planes. To address these issues, R-VoxelMap utilizes a geometry-driven recursive construction strategy based on an outlier detect-and-reuse pipeline. Specifically, for each voxel, accurate planes are first fitted while separating outliers using random sample consensus (RANSAC). The remaining outliers are then propagated to deeper octree levels for recursive processing, ensuring a detailed representation of the environment. In addition, a point distribution-based validity check algorithm is devised to prevent erroneous plane merging. Extensive experiments on diverse open-source LiDAR(-inertial) simultaneous localization and mapping (SLAM) datasets validate that our method achieves higher accuracy than other state-of-the-art approaches, with comparable efficiency and memory usage.

2 September 2025 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
QDQianli Dong
Qianli Dong
XZXuebo Zhang
Xuebo Zhang
SZShiyong Zhang
Shiyong Zhang
ZWZiyu Wang
Ziyu Wang
ZMZhe Ma
Zhe Ma
HXHaobo Xi
Haobo Xi
Unmanned aerial vehicles (UAVs) are widely used in autonomous exploration, but their motion speed is underutilized due to inaccurate motion time cost evaluation and high computational cost. Existing methods either fail to consider UAV’s motion tendency and environment simultaneously or can’t ensure real-time planning in large 3-D environments. This paper presents a consistent, high-speed, and efficient online autonomous UAV exploration method. First, a motion primitive activated graph search method is proposed to fully take advantage of the UAV’s current velocity and acceleration. It improves motion time cost evaluation by simulating short-term motion tendencies with motion primitives and reduces the computational cost by searching on a voxel graph with a dynamic upper bound. Then, a minimum time trajectory to the optimal viewpoint with a non-zero terminal velocity constraint in a convex hull is optimized. Finally, an SE(3) coverage trajectory for unknown space around the exploration path is further optimized. Simulations in various environments with different speed settings show that the proposed method’s average UAV velocity is 18.6%−116.1% faster and its exploration efficiency is 13.8%−49.5% higher than state-of-the-art methods. Real-world tests verify its effectiveness. The source code of our method will be released at: https://github.com/NKU-MobFly-Robotics/HighStar.

14 May 2024 in IEEE/ASME Transactions on Mechatronics
Verified
Journal Article
Closed access
TLTianyi Li
Tianyi Li
SZShiyong Zhang
Shiyong Zhang
XZXuebo Zhang
Xuebo Zhang
QDQianli Dong
Qianli Dong
JHJunsheng Huang
Junsheng Huang
This article proposes a skeleton-guided spatiotemporal motion planner (SGS-Planner) for safe and efficient aerial robot navigation in challenging constrained space. The planner takes advantage of a spatial-temporal hierarchical framework to generate a safer and more efficient trajectory rapidly. In spatial planning, different from existing approaches that either ignore the clearance between trajectories and obstacles or suffer from local minima, path smoothing is guided by a skeleton away from obstacles. Specifically, a fast sphere inflation-based skeleton extraction method is elaborately designed for high-clearance path searching. After that, we propose a skeleton-guided path smoothing approach to generate smooth and high-clearance paths, where the smoothing is formulated as unconstrained quadratic programs. In temporal planning, the feasible trajectory is generated along the optimized path by employing an optimal time allocation method and a parallel back-up strategy to guarantee the success of planning. We validate the performance of the proposed method in extensive challenging simulations and real-world environments. Comparative results show that our approach outperforms state-of-the-art methods in terms of planning success rate, average computational efficiency (5–24 times faster), and minimum clearance (12%–177% larger) in restricted space.

14 January 2026 in Measurement Science and Technology
Verified
Journal Article
Closed access
YLYuwen Lin
Yuwen Lin
QDQianli Dong
Qianli Dong
XZXuebo Zhang
Xuebo Zhang
JZJie Zhang
Jie Zhang
In this paper, we propose a fast sampling-based planner with submodular information gain measure for rapid continuous exploration of large and complex 3D environments using unmanned aerial vehicles (UAVs). Existing sampling-based methods suffer from three critical limitations: (i) inherent overestimation of information gain; (ii) computational inefficiency in branch expansion; (iii) frequent deceleration or even stopping in the boundary area. To address these limitations, we first introduce a depth image based submodularity checking method that computes strictly submodular information gains and eliminates the multi-counting of unknown voxels, thereby overcoming the inherent overestimation of information gain. Second, instead of the conventional local-window paradigm, we apply an innovative branch pruning strategy that removes branches with low potential utility to significantly improve computational efficiency during branch expansion. Third, we employ a heuristic approach to rank and expand candidate nodes, and further allow branches to extend into unknown regions covered by the field of view of predecessor viewpoints along the planned trajectory. This effectively avoids frequent deceleration or stopping near boundary areas, ensuring continuous and rapid exploration. Extensive simulation and real-world experiments demonstrate that our planner achieves 37.2% higher exploration efficiency than state-of-the-art methods, while sustaining real-time capability on both laptop and self-built quadrotor UAV.