Jin-Xin Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jin-Xin Yao has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Bin Wang
School of Electronic, Electrical Engineering and Physics, Fujian University of Technology, Fuzhou, China
1 shared publicationDongwei He
School of Electronic, Electrical Engineering and Physics, Fujian University of Technology, Fuzhou, China
1 shared publication- Dongwei He
School of Electronic, Electrical Engineering and Physics, Fujian University of Technology, Fuzhou 350118, China
1 shared publication Hui Xu
School of Electronic, Electrical Engineering and Physics, Fujian University of Technology, Fuzhou, China
1 shared publication- Jiafeng Lin
School of Electrical and Computer Engineering, Faculty of Engineering, The University of Sydney, Sydney, NSW 2006, Australia
1 shared publication Jian Chen
School of Electronic, Electrical Engineering and Physics, Fujian University of Technology, Fuzhou, China
1 shared publication
Latest Publications
- Open Access
- 19 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 19632-19638
Global Dynamic Path Planning Fusion Algorithm Combining Jump-A* Algorithm and Dynamic Window Approach
In order to meet the performance requirements of global optimality and path smoothness in robot path planning, a new fusion algorithm of jump-A * algorithm and dynamic window approach is proposed. First, A * algorithm is optimized by using the jump point search method and a new distance evaluation function defined by Manhattan and Euclidean distance to obtain global path information. Then take the dynamic window approach as the core by integrating the global path information to safely plan a global optimal path with high smoothness. The experimental results show that the new fusion algorithm proposed in this paper can not only effectively solve the problem of non-continuous curvature and excessive turning angle at the turning points of the path planned by jump-A * algorithm, but also improve the smoothness of the path and the global optimality. This research is beneficial to the motion control of robots and has certain reference for robot navigation.
- 19 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 19632-19638
Open AccessGlobal Dynamic Path Planning Fusion Algorithm Combining Jump-A* Algorithm and Dynamic Window Approach
In order to meet the performance requirements of global optimality and path smoothness in robot path planning, a new fusion algorithm of jump-A * algorithm and dynamic window approach is proposed. First, A * algorithm is optimized by using the jump point search method and a new distance evaluation function defined by Manhattan and Euclidean distance to obtain global path information. Then take the dynamic window approach as the core by integrating the global path information to safely plan a global optimal path with high smoothness. The experimental results show that the new fusion algorithm proposed in this paper can not only effectively solve the problem of non-continuous curvature and excessive turning angle at the turning points of the path planned by jump-A * algorithm, but also improve the smoothness of the path and the global optimality. This research is beneficial to the motion control of robots and has certain reference for robot navigation.
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Path Planning for Smart Car Based on Dijkstra Algorithm and Dynamic Window Approach
Path planning and obstacle avoidance are essential for autonomous driving cars. On the base of a self‐constructed smart obstacle avoidance car, which used a LeTMC‐520 depth camera and Jetson controller, this paper established a map of an unknown indoor environment based on depth information via SLAM technology. The Dijkstra algorithm is used as the global path planning algorithm and the dynamic window approach (DWA) as its local path planning algorithm, which are applied to the smart car, enabling it to successfully avoid obstacles from the planned initial position and reach the designated position. The tests on the smart car prove that the system can complete the functions of environment map establishment, path planning and navigation, and obstacle avoidance.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessPath Planning for Smart Car Based on Dijkstra Algorithm and Dynamic Window Approach
Path planning and obstacle avoidance are essential for autonomous driving cars. On the base of a self‐constructed smart obstacle avoidance car, which used a LeTMC‐520 depth camera and Jetson controller, this paper established a map of an unknown indoor environment based on depth information via SLAM technology. The Dijkstra algorithm is used as the global path planning algorithm and the dynamic window approach (DWA) as its local path planning algorithm, which are applied to the smart car, enabling it to successfully avoid obstacles from the planned initial position and reach the designated position. The tests on the smart car prove that the system can complete the functions of environment map establishment, path planning and navigation, and obstacle avoidance.