Zhifeng Yao

Zhifeng Yao

Auto-generated profile, based on publicly available information

Zhifeng Yao

School of Mechanical and Electrical Engineering, Qiqihar University, Qiqihar, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
16 April 2025 in IEEE Access
Verified
Journal Article
Open access
ZYZhifeng Yao
Zhifeng Yao
ZLZhicheng Liu
Zhicheng Liu
CHChunsong Han
Chunsong Han
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 in Journal of Computational Methods in Sciences and Engineering
Verified
Journal Article
Closed access
ZYZhifeng Yao
Zhifeng Yao
JSJiabo Sun
Jiabo Sun
CHChunsong Han
Chunsong Han
LJLiqiu Jin
Liqiu Jin
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.

12 February 2018 in Robotica
Verified
Journal Article
Closed access
PDF file
ZYZhifeng Yao
Zhifeng Yao
XYXiufen Ye
Xiufen Ye
XDXuefeng Dai
Xuefeng Dai
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.

9 October 2021 in International Journal of Pattern Recognition and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
ZYZhifeng Yao
Zhifeng Yao
FXFengxia Xu
Fengxia Xu
CHChunsong Han
Chunsong Han