Yujun Wang

Yujun Wang


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 November 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
QCQisen Chai
Qisen Chai
YWYujun Wang
Yujun Wang
As a representative of sampling-based planning algorithms, rapidly exploring random tree (RRT), is extensively welcomed in solving robot path planning problems due to its wide application range and easy addition of nonholonomic constraints. However, it is still challenging for RRT to plan the path for configuration space with narrow passages. As a variant algorithm of RRT, rapid random discovery vine (RRV) gives a better solution, but when configuration space contains more obstacles instead of narrow passages, RRV performs slightly worse than RRT. In order to solve these problems, this paper re-examines the role of sampling points in RRT. Firstly, according to the state of the random tree expanding towards the current sampling point, a greedy sampling space reduction strategy is proposed, which decreases the redundant expansion of the random tree in space by dynamically changing the sampling space. Secondly, a new narrow passage judgment method is proposed according to the environment around of sampling point. After the narrow passage is identified, the narrow passage is explored by generating multiple subtrees inside the passage. The subtrees can be merged into the main tree that expands in a larger area by subsequent sampling. These improvements further enhance the value of sampling points. Compared with the existing RRT algorithms, the adaptability for different environments is improved, and the planning time and memory usage are saved.

30 March 2025 in Sensors
Verified
Journal Article
Open access
PDF file
XDXingxiang Dong
Xingxiang Dong
YWYujun Wang
Yujun Wang
CFCan Fang
Can Fang
KRKemeng Ran
Kemeng Ran
GLGuohui Liu
Guohui Liu
The Rapidly-exploring Random Tree Star (RRT*) algorithm, widely utilized for path planning, faces challenges, such as slow acquisition of feasible paths and high path costs. To address this issue, this paper presents an improved algorithm based on RRT* that can obtain high-quality paths faster, termed Faster High-Quality RRT*(FHQ-RRT*). The proposed algorithm enhances the exploration efficiency and path quality of mobile robots through three key innovations: First, a dynamic sparse sampling strategy that adaptively adjusts the sampling density according to the growth rate of the random tree, thereby increasing the algorithm’s growth speed while maintaining adaptability to complex environments. Second, a new node creation method that combines the bisection method, triangle inequality, and the concept of KeyPoints to reduce the cost of creating new nodes. Third, a focused rewiring strategy that restricts the rewiring operation to valuable regions, thereby improving rewiring efficiency. The performance of FHQ-RRT* was validated in four simulation maps and compared with other algorithms. In all validated maps, FHQ-RRT* consistently achieved the lowest path cost. Regarding time cost, FHQ-RRT* reduced the planning time by over 40% in the circular-obstacle map, 77% in the simple maze map, 56% in the complex maze map, and 50% in the narrow map. The simulation results show that FHQ-RRT* can rapidly generate high-quality paths faster than other algorithms.

6 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
KRKemeng Ran
Kemeng Ran
YWYujun Wang
Yujun Wang
CFCan Fang
Can Fang
QCQisen Chai
Qisen Chai
XDXingxiang Dong
Xingxiang Dong
GLGuohui Liu
Guohui Liu
In this paper, we propose an algorithm based on the Rapidly-exploring Random Trees* (RRT*) algorithm for the path planning of mobile robots under kinematic constraints, aiming to generate efficient and smooth paths quickly. Compared to other algorithms, the main contributions of our proposed algorithm are as follows: First, we introduce a bidirectional expansion strategy that quickly identifies a direct path to the goal point in a short time. Second, a node reconnection strategy is used to eliminate unnecessary nodes, thereby reducing the path length and saving memory. Third, a path deformation strategy based on the Clothoid curve is devised to enhance obstacle avoidance and path-planning capability, ensuring collision-free paths that comply with the kinematic constraints of mobile robots. Simulation results demonstrate that our algorithm is simpler, more computationally efficient, expedites pathfinding, achieves higher success rates, and produces smoother paths compared to existing algorithms.

28 September 2015 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
CFCan Fang
Can Fang
YWYujun Wang
Yujun Wang

1 January 2016
Verified
Conference Paper
Open access
PDF file
JHJie Huang
Jie Huang
YWYujun Wang
Yujun Wang
CSChenyang Shen
Chenyang Shen
PYPengfei Yin
Pengfei Yin
XFXiang Fu
Xiang Fu
HLHuihua Li
Huihua Li
This paper presents a model of wheel-rod hybrid robot and analyzes the performance and function of connecting rods. The wheel-rod hybrid robot can not only effectively walk on a flat ground, but also own better crossing ability on an irregular surface. The wheels with connecting rods are simply introduced and described firstly. The wheel-rod robot is mainly classified four types by the number of links and all of them are analyzed for the purpose of improving the obstacle-climbing robot. And then, some of the parameters of connecting rods is given to analyze the performance of obstacle-surmounting for the robot. All of the analysis and research results are verified by real machine. Through studying on the connecting rods for wheel-rod robot, the best obstacle performance and walking efficiency of mobile robot is given in this paper.