Qingchen Bi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qingchen Bi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Xuebo Zhang
Institute of Robotics and Automatic Information Systems and Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin, China
5 shared publications - Jing Yuan
College of Artificial Intelligence, Nankai University, Tianjin, China
4 shared publications - Shiyong Zhang
College of Artificial Intelligence, Institute of Robotics and Automatic Information System, Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin, China
3 shared publications - Jian Wen
Institute of Robotics and Automatic Information System, College of Artificial Intelligence, and Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin, China
2 shared publications - Runhua Wang
Tianjin Key Laboratory of Intelligent Robotics, the College of Artificial Intelligence, and the Institute of Robotics and Automatic Information System, Nankai University, Tianjin, China
2 shared publications - Zhangchao Pan
College of Artificial Intelligence, Institute of Robotics and Automatic Information System, Nankai University, Tianjin, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42, 3028-3047
URGE: Efficient Decentralized Multirobot Exploration Guided by Unknown Regions Under Limited Communication
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42, 3028-3047
URGE: Efficient Decentralized Multirobot Exploration Guided by Unknown Regions Under Limited Communication
- 30 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 13580-13591
STVO: Spatial-Temporal Constrained Velocity Obstacle for Safe Navigation Among Pedestrians
This paper presents a novel motion planning method that safely navigates the unmanned ground vehicle (UGV) among pedestrian-rich environments by constructing the spatial-temporal constrained velocity obstacle (STVO) region. Compared with existing velocity obstacle (VO) type-based methods, the novelty of this work is twofold: 1) An innovative temporal constraint is introduced into the velocity space, also playing the role as an adaptive collision time constraint to dynamically adjust the velocity obstacle region according to real-time perceived pedestrian density; 2) The spatial constraint is proposed to foresee and evade potential entrapments for the UGV, by carefully considering the position relationship between the UGV and the VO region. Additionally, a velocity resampling mechanism is further designed to prevent the UGV from being trapped. Above techniques augments the navigation flexibility and safety of the UGV, thereby significantly improves the success rate of practical navigation in dynamic and challenging pedestrian environments. Extensive simulations and real-world experiments have been conducted, especially the experiment in pedestrian-rich school cafeteria demonstrating satisfactory practicality of our approach. (Supplementary video link: https://youtu.be/xt4KosuPMYs)
- 30 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 13580-13591
STVO: Spatial-Temporal Constrained Velocity Obstacle for Safe Navigation Among Pedestrians
This paper presents a novel motion planning method that safely navigates the unmanned ground vehicle (UGV) among pedestrian-rich environments by constructing the spatial-temporal constrained velocity obstacle (STVO) region. Compared with existing velocity obstacle (VO) type-based methods, the novelty of this work is twofold: 1) An innovative temporal constraint is introduced into the velocity space, also playing the role as an adaptive collision time constraint to dynamically adjust the velocity obstacle region according to real-time perceived pedestrian density; 2) The spatial constraint is proposed to foresee and evade potential entrapments for the UGV, by carefully considering the position relationship between the UGV and the VO region. Additionally, a velocity resampling mechanism is further designed to prevent the UGV from being trapped. Above techniques augments the navigation flexibility and safety of the UGV, thereby significantly improves the success rate of practical navigation in dynamic and challenging pedestrian environments. Extensive simulations and real-world experiments have been conducted, especially the experiment in pedestrian-rich school cafeteria demonstrating satisfactory practicality of our approach. (Supplementary video link: https://youtu.be/xt4KosuPMYs)
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (12) , 11186-11193
LRAE: Large-Region-Aware Safe and Fast Autonomous Exploration of Ground Robots for Uneven Terrains
Ground robot autonomous exploration for uneven terrains is still challenging since the rugged terrain structures not only degrade the exploration performance but also threaten the navigation safety of the robot. In this letter, a novel exploration planner is proposed for safe and fast exploration in uneven terrains. To obtain high exploration efficiency, we propose a large-region-aware exploration route optimization strategy that prioritizes exploring large regions while also considering exploring nearby small regions. To safely and completely explore uneven terrains, our planner fully introduces traversability information to extract unknown regions and assess exploration safety levels. The safety levels are then integrated into the design of the exploration strategy to ensure safe robotic exploration. We validate our method in various challenging simulation scenes and real-world wild uneven terrains. The results show that our method can safely explore uneven terrains and improve exploration efficiency by up to 45.3% compared with state-of-the-art methods.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (12) , 11186-11193
LRAE: Large-Region-Aware Safe and Fast Autonomous Exploration of Ground Robots for Uneven Terrains
Ground robot autonomous exploration for uneven terrains is still challenging since the rugged terrain structures not only degrade the exploration performance but also threaten the navigation safety of the robot. In this letter, a novel exploration planner is proposed for safe and fast exploration in uneven terrains. To obtain high exploration efficiency, we propose a large-region-aware exploration route optimization strategy that prioritizes exploring large regions while also considering exploring nearby small regions. To safely and completely explore uneven terrains, our planner fully introduces traversability information to extract unknown regions and assess exploration safety levels. The safety levels are then integrated into the design of the exploration strategy to ensure safe robotic exploration. We validate our method in various challenging simulation scenes and real-world wild uneven terrains. The results show that our method can safely explore uneven terrains and improve exploration efficiency by up to 45.3% compared with state-of-the-art methods.
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 3743-3755
G²VD Planner: Efficient Motion Planning With Grid-Based Generalized Voronoi Diagrams
In this paper, an efficient motion planning approach with grid-based generalized Voronoi diagrams (G $^2$ VD) is newly proposed for mobile robots. Different from existing approaches, the novelty of this work is twofold: 1) a new state lattice-based path searching approach is proposed, in which the search space is reduced to a novel Voronoi corridor to further improve the search efficiency; 2) an efficient quadratic programming-based path smoothing approach is presented, wherein the clearance to obstacles is considered to improve the path clearance of hard-constrained path smoothing approaches. We validate the efficiency and smoothness of our approach in various challenging simulation scenarios and outdoor environments. It is shown that the computational efficiency is improved by 17.1% in the path searching stage, and path smoothing with the proposed approach is 6.6 times faster than an advanced sparse-banded structure-based path smoothing approach and 53.3 times faster than the popular timed-elastic-band planner. A video showing outdoor navigation on our campus is available at https://youtu.be/iMXGthgvp58. Note to Practitioners —This paper is motivated by the challenges of motion planning problems of mobile robots. An efficient motion planning approach called G $^2$ VD planner is proposed by combining path searching, path smoothing, and time-optimal velocity planning. Extensive simulation and experimental results show the effectiveness of the proposed motion planning approach. However, the prediction information of dynamic obstacles is not incorporated in the proposed motion planner, thus the motion planner may be a bit sluggish in response to dynamic obstacles. Furthermore, we plan to integrate the intention/trajectory prediction of pedestrians/vehicles into the proposed framework to enhance the foreseeability of the motion planner.
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 3743-3755
G²VD Planner: Efficient Motion Planning With Grid-Based Generalized Voronoi Diagrams
In this paper, an efficient motion planning approach with grid-based generalized Voronoi diagrams (G $^2$ VD) is newly proposed for mobile robots. Different from existing approaches, the novelty of this work is twofold: 1) a new state lattice-based path searching approach is proposed, in which the search space is reduced to a novel Voronoi corridor to further improve the search efficiency; 2) an efficient quadratic programming-based path smoothing approach is presented, wherein the clearance to obstacles is considered to improve the path clearance of hard-constrained path smoothing approaches. We validate the efficiency and smoothness of our approach in various challenging simulation scenarios and outdoor environments. It is shown that the computational efficiency is improved by 17.1% in the path searching stage, and path smoothing with the proposed approach is 6.6 times faster than an advanced sparse-banded structure-based path smoothing approach and 53.3 times faster than the popular timed-elastic-band planner. A video showing outdoor navigation on our campus is available at https://youtu.be/iMXGthgvp58. Note to Practitioners —This paper is motivated by the challenges of motion planning problems of mobile robots. An efficient motion planning approach called G $^2$ VD planner is proposed by combining path searching, path smoothing, and time-optimal velocity planning. Extensive simulation and experimental results show the effectiveness of the proposed motion planning approach. However, the prediction information of dynamic obstacles is not incorporated in the proposed motion planner, thus the motion planner may be a bit sluggish in response to dynamic obstacles. Furthermore, we plan to integrate the intention/trajectory prediction of pedestrians/vehicles into the proposed framework to enhance the foreseeability of the motion planner.
- 19 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 3773-3786
CURE: A Hierarchical Framework for Multi-Robot Autonomous Exploration Inspired by Centroids of Unknown Regions
In this paper, a novel multi-robot autonomous exploration approach CURE is proposed based on dynamic Voronoi diagrams and centroids of unknown connected regions. Compared with existing approaches, the novelty of this work is twofold: 1) Dynamic Voronoi diagram is used for partition of the space being explored to improve the efficiency of multi-robot exploration, and then a new parameter-insensitive utility function is elaborately designed to evaluate the information of centroids, which helps guide the robot to explore unknown regions. 2) A hierarchical framework consisting of global and local exploration windows for detecting centroids is designed, wherein the global exploration window is activated to find centroids to guide the robot exploration when there are no centroids in any one local exploration window. We validate the feasibility and exploration efficiency of the proposed approach in various complex simulation scenarios and challenging real-world tasks. All test results show that the exploration time consumption and path cost are reduced by up to 50.7% and 34.4%, respectively, compared with an advanced RRT-based multi-robot exploration approach. (Supplementary video link: https://youtu.be/P5jXKlGQOec) Note to Practitioners —This paper is motivated by the efficient multi-robot autonomous exploration problem. In some applications such as target search and disaster rescue, the information about the environment is totally unknown to the robots, and thus they are required to explore unknown environments autonomously. In this case, it is necessary to improve the efficiency of multi-robot exploration due to the time limitation of the task and the battery capacity. In this paper, a hierarchical framework is proposed to improve the efficiency of multi-robot autonomous exploration. Each robot only needs to explore the Voronoi partition it is responsible for and is guided to the unknown region by the centroid detected in the global and local exploration windows. Overall, the proposed approach can dramatically reduce the exploration time and path cost.
- 19 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 3773-3786
CURE: A Hierarchical Framework for Multi-Robot Autonomous Exploration Inspired by Centroids of Unknown Regions
In this paper, a novel multi-robot autonomous exploration approach CURE is proposed based on dynamic Voronoi diagrams and centroids of unknown connected regions. Compared with existing approaches, the novelty of this work is twofold: 1) Dynamic Voronoi diagram is used for partition of the space being explored to improve the efficiency of multi-robot exploration, and then a new parameter-insensitive utility function is elaborately designed to evaluate the information of centroids, which helps guide the robot to explore unknown regions. 2) A hierarchical framework consisting of global and local exploration windows for detecting centroids is designed, wherein the global exploration window is activated to find centroids to guide the robot exploration when there are no centroids in any one local exploration window. We validate the feasibility and exploration efficiency of the proposed approach in various complex simulation scenarios and challenging real-world tasks. All test results show that the exploration time consumption and path cost are reduced by up to 50.7% and 34.4%, respectively, compared with an advanced RRT-based multi-robot exploration approach. (Supplementary video link: https://youtu.be/P5jXKlGQOec) Note to Practitioners —This paper is motivated by the efficient multi-robot autonomous exploration problem. In some applications such as target search and disaster rescue, the information about the environment is totally unknown to the robots, and thus they are required to explore unknown environments autonomously. In this case, it is necessary to improve the efficiency of multi-robot exploration due to the time limitation of the task and the battery capacity. In this paper, a hierarchical framework is proposed to improve the efficiency of multi-robot autonomous exploration. Each robot only needs to explore the Voronoi partition it is responsible for and is guided to the unknown region by the centroid detected in the global and local exploration windows. Overall, the proposed approach can dramatically reduce the exploration time and path cost.