Zhifeng Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Zhifeng Yao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Chunsong Han
Qiqihar University
2 shared publications- Chunsong Han
School of Mechatronics Engineering Qiqihar University Qiqihar China
1 shared publication Fengxia Xu
School of Mechanical and Electronic Engineering, Qiqihar University, Qiqihar 161006, P. R. China
1 shared publication- Jiabo Sun
Qiqihar University
1 shared publication - Liqiu Jin
Qiqihar University
1 shared publication Xiufen Ye
College of Automation, Harbin Engineering University, Harbin 150001, Heilongjiang, China
1 shared publication
Latest Publications
- Open Access
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 68398-68409
The Improved RRT Integrated With the Artificial Potential Field Path Planning Algorithm
The traditional informed rapidly exploring random tree * algorithm (IRRT*) has several drawbacks, including low efficiency, numerous ineffective samples, strict requirements of the environment, and slow convergence of path length in narrow passages. This study proposes an improved IRRT* integrated with an artificial potential field path planning algorithm (IRRT*-APF) by introducing a Narrow Space Map Recognition Strategy (NSMR), Sampling Guidance Strategy (SG), and Gravitational Elimination Strategy (GE) to address the efficiency problems of the traditional IRRT* algorithm when traversing narrow passages. NSMR identifies narrow passage regions by traversing the grid map and generating a special bias point in these regions. The SG was introduced at special bias points. When random sampling points fall within the range centered on the bias point, they quickly iterate to the specific bias point under the combined effect of gravity and repulsion, generating a large number of effective sample points, thus enabling the robot to efficiently navigate through narrow passages. The GE was used to eliminate the bias point when the robot passed. In the simulation section, data such as the optimal path length, average path length, and algorithm efficiency are analyzed. When comparing IRRT*-APF with IRRT*, the former shows significant advantages in terms of navigation efficiency and the number of sample points when traversing narrow passages.
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 68398-68409
Open AccessThe Improved RRT Integrated With the Artificial Potential Field Path Planning Algorithm
The traditional informed rapidly exploring random tree * algorithm (IRRT*) has several drawbacks, including low efficiency, numerous ineffective samples, strict requirements of the environment, and slow convergence of path length in narrow passages. This study proposes an improved IRRT* integrated with an artificial potential field path planning algorithm (IRRT*-APF) by introducing a Narrow Space Map Recognition Strategy (NSMR), Sampling Guidance Strategy (SG), and Gravitational Elimination Strategy (GE) to address the efficiency problems of the traditional IRRT* algorithm when traversing narrow passages. NSMR identifies narrow passage regions by traversing the grid map and generating a special bias point in these regions. The SG was introduced at special bias points. When random sampling points fall within the range centered on the bias point, they quickly iterate to the specific bias point under the combined effect of gravity and repulsion, generating a large number of effective sample points, thus enabling the robot to efficiently navigate through narrow passages. The GE was used to eliminate the bias point when the robot passed. In the simulation section, data such as the optimal path length, average path length, and algorithm efficiency are analyzed. When comparing IRRT*-APF with IRRT*, the former shows significant advantages in terms of navigation efficiency and the number of sample points when traversing narrow passages.
- 26 December 2024
- Published by European Society of Computational Methods in Sciences and Engineering in Journal of Computational Methods in Sciences and Engineering
- Vol. 25 (3) , 2159-2184
A path-planning algorithm integrated improved A* and D* Lite with bat clustering
In disaster rescue scenarios, the high complexity and level of danger to the environment necessitate the efficient utilization of robotic technology to facilitate rapid search and rescue operations. Addressing this critical issue, this study focuses on optimizing global path-planning strategies. Specifically, the study has improved the classic A* algorithm by incorporating a bidirectional search mechanism and conducted simulation validation on a grid map to assess its performance. Considering the uncertainty and dynamic obstacles in the rescue environment, the study introduces the D* Lite algorithm integrated into the improved A* algorithm to enhance the robot’s adaptability. Concurrently, a movement prediction method based on the historical trajectories of dynamic obstacles has been proposed, aiming to effectively address the challenges presented by dynamic environments. To address the issue of time efficiency in multi-robot systems with multiple rescue points, this study employs the bat clustering algorithm to optimize the clustering of multiple rescue target points. Simulation experiments with the integrated algorithm have verified the effectiveness in shortening rescue paths and time in Matlab. Ultimately, the study utilizes Gazebo simulation software to construct a simulation experiment environment, further confirming the significant improvements in robotic rescue performance achieved by the proposed algorithm.
- 26 December 2024
- Published by European Society of Computational Methods in Sciences and Engineering in Journal of Computational Methods in Sciences and Engineering
- Vol. 25 (3) , 2159-2184
A path-planning algorithm integrated improved A* and D* Lite with bat clustering
In disaster rescue scenarios, the high complexity and level of danger to the environment necessitate the efficient utilization of robotic technology to facilitate rapid search and rescue operations. Addressing this critical issue, this study focuses on optimizing global path-planning strategies. Specifically, the study has improved the classic A* algorithm by incorporating a bidirectional search mechanism and conducted simulation validation on a grid map to assess its performance. Considering the uncertainty and dynamic obstacles in the rescue environment, the study introduces the D* Lite algorithm integrated into the improved A* algorithm to enhance the robot’s adaptability. Concurrently, a movement prediction method based on the historical trajectories of dynamic obstacles has been proposed, aiming to effectively address the challenges presented by dynamic environments. To address the issue of time efficiency in multi-robot systems with multiple rescue points, this study employs the bat clustering algorithm to optimize the clustering of multiple rescue target points. Simulation experiments with the integrated algorithm have verified the effectiveness in shortening rescue paths and time in Matlab. Ultimately, the study utilizes Gazebo simulation software to construct a simulation experiment environment, further confirming the significant improvements in robotic rescue performance achieved by the proposed algorithm.
- 9 October 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (14)
Forecast-Island and Bidding A*-Euclidean Selecting Boustrophedon Coordination Algorithm for Exploration
Exploration algorithms based on the Boustrophedon path seldom consider the impacts of a robot turning at corners on the exploration time. This paper proposes the Forecast-Island and Bidding A*-Euclidean Selecting Boustrophedon Coordination (FIBA*ESBC) algorithm to calculate the turning time at corners in the overall exploration time and introduces a method to estimate the walking time in the Boustrophedon paths in order to determine the directions for path execution. Typically, in bidding-based exploration tasks, the cost is the Euclidean distance between the current position of the robot and the target point. When there is an obstacle between two points, the cost is set to infinity. Therefore, the selected target point is sometimes not optimal. The FIBA*ESBC algorithm is based on the exploration cost of a combination of the Euclidean distance and A* algorithm walking path, which can effectively solve this problem. Because the bidding is based on a greedy algorithm, the robot has a small unexplored island in the later exploration stage; therefore, full exploration is not possible or requires a long time with several repeated paths. The FIBA*ESBC algorithm prioritizes the exploration and estimation of hidden and existing unexplored islands. It can realize complete exploration and decrease the exploration time. Through simulation experiments conducted using Gazebo and RViz, the feasibility of the FIBA*ESBC algorithm is verified. Moreover, a simulation experiment is conducted in MATLAB for comparison with other algorithms. The analysis of the experimental data shows that the proposed algorithm has a relatively short exploration time.
- 9 October 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (14)
Forecast-Island and Bidding A*-Euclidean Selecting Boustrophedon Coordination Algorithm for Exploration
Exploration algorithms based on the Boustrophedon path seldom consider the impacts of a robot turning at corners on the exploration time. This paper proposes the Forecast-Island and Bidding A*-Euclidean Selecting Boustrophedon Coordination (FIBA*ESBC) algorithm to calculate the turning time at corners in the overall exploration time and introduces a method to estimate the walking time in the Boustrophedon paths in order to determine the directions for path execution. Typically, in bidding-based exploration tasks, the cost is the Euclidean distance between the current position of the robot and the target point. When there is an obstacle between two points, the cost is set to infinity. Therefore, the selected target point is sometimes not optimal. The FIBA*ESBC algorithm is based on the exploration cost of a combination of the Euclidean distance and A* algorithm walking path, which can effectively solve this problem. Because the bidding is based on a greedy algorithm, the robot has a small unexplored island in the later exploration stage; therefore, full exploration is not possible or requires a long time with several repeated paths. The FIBA*ESBC algorithm prioritizes the exploration and estimation of hidden and existing unexplored islands. It can realize complete exploration and decrease the exploration time. Through simulation experiments conducted using Gazebo and RViz, the feasibility of the FIBA*ESBC algorithm is verified. Moreover, a simulation experiment is conducted in MATLAB for comparison with other algorithms. The analysis of the experimental data shows that the proposed algorithm has a relatively short exploration time.
- 12 February 2018
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 36 (4) , 607-623
Bidding coordination algorithm with CFC and an emotion switch
SUMMARY: Exploration is a fundamental problem in robotics, and multi-robot systems exploration has been extensively studied in this field. In order to overcome the problem of a non-optimal target being selected in the exploration process, a revised single linkage clustering frontier cell (CFC) algorithm is proposed to calculate the exploration benefit of all available frontier cells. Moreover, there exist unexplored islands for most of the bidding-based multi-robot coordination algorithms in the exploration of unknown environments. To deal with this problem, some rules switched by emotion states are proposed. So, the proposed bidding coordination algorithm with CFC and an emotion switch has a hierarchical architecture. The upper level is modeled as an automaton, which is used to represent emotion status, and the emotion variables decide whether a robot will participate in a bid and explore an unknown area abiding by the walking rules. In the lower level, the robots perform bidding activities with CFC and the walking rules according to the emotion variables. We tested and evaluated our approach by means of experiments both in a simulated environment and with real robots. The experiments results demonstrate that the exploration efficiency is improved, and our algorithm has a greater coverage rate than classic bidding-based coordination algorithms.
- 12 February 2018
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 36 (4) , 607-623
Bidding coordination algorithm with CFC and an emotion switch
SUMMARY: Exploration is a fundamental problem in robotics, and multi-robot systems exploration has been extensively studied in this field. In order to overcome the problem of a non-optimal target being selected in the exploration process, a revised single linkage clustering frontier cell (CFC) algorithm is proposed to calculate the exploration benefit of all available frontier cells. Moreover, there exist unexplored islands for most of the bidding-based multi-robot coordination algorithms in the exploration of unknown environments. To deal with this problem, some rules switched by emotion states are proposed. So, the proposed bidding coordination algorithm with CFC and an emotion switch has a hierarchical architecture. The upper level is modeled as an automaton, which is used to represent emotion status, and the emotion variables decide whether a robot will participate in a bid and explore an unknown area abiding by the walking rules. In the lower level, the robots perform bidding activities with CFC and the walking rules according to the emotion variables. We tested and evaluated our approach by means of experiments both in a simulated environment and with real robots. The experiments results demonstrate that the exploration efficiency is improved, and our algorithm has a greater coverage rate than classic bidding-based coordination algorithms.