Quancheng Pu

Quancheng Pu

Auto-generated profile, based on publicly available information

Quancheng Pu

School of Mechanical Engineering, Anhui University of Technology, Maanshan, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
5 March 2024 in IEEE Access
Verified
Journal Article
Open access
JGJu Gao
Ju Gao
XXXiangrong Xu
Xiangrong Xu
QPQuancheng Pu
Quancheng Pu
PPPetar B. Petrovic
Petar B. Petrovic
ARAleksandar Rodić
Aleksandar Rodić
ZWZhixiong Wang
Zhixiong Wang
In order to address the challenges of global path planning in complex and dynamic environments, where avoiding dynamic obstacles is difficult, and local paths are prone to getting stuck in local optima, this paper proposes an enhanced hybrid path planning approach based on improvements to the A* algorithm and the Artificial Potential Field (APF) algorithm. Firstly, addressing the issues of redundant path nodes and non-smooth paths generated by the A* algorithm, we introduce enhancements such as weighted heuristic function, removal of redundant path nodes, and the incorporation of a cubic quasi-uniform B-spline curve to improve search speed and generate smoother paths. Secondly, addressing the problems of unreachable target points and susceptibility to local optima associated with the APF algorithm, two key strategies are employed. On one hand, the repulsive potential field function is modified by incorporating the m -th power of the relative distance from the robot to the target point to ensure reachability. On the other hand, the Constrained Simulated Annealing with Augmented Potential Field (CSA-APF) algorithm is introduced, which integrates simulated annealing with angle and safety distance constraints. This approach facilitates escaping local optima and obtaining global optimal solutions. Finally, the proposed methods are compared through simulation experiments in different scenarios. The experimental results demonstrate that the proposed approach effectively achieves path planning in complex dynamic environments.

21 June 2023 in IEEE Access
Verified
Journal Article
Open access
QPQuancheng Pu
Quancheng Pu
XXXiangrong Xu
Xiangrong Xu
HZHui Zhang
Hui Zhang
QLQiqi Li
Qiqi Li
ARAleksandar Rodić
Aleksandar Rodić
ZWZhixiong Wang
Zhixiong Wang
To achieve multiple obstacle avoidance tasks consisting of zero-space obstacle avoidance and terminal obstacle avoidance with self-avoidance permission, we propose an algorithm for multiple obstacle avoidance tasks for dual-arm robots. First, we design a self-obstacle avoidance gradient optimization function to implement the self-obstacle avoidance task between the two arms of dual-arm robots by using the pseudo-distance as the basis for the collision judgment. Second, the terminal obstacle avoidance task for dual-arm robots is implemented by applying an adaptive terminal obstacle avoidance velocity. Third, a zero-space obstacle avoidance task for dual-arm robots is realized using an adaptive virtual repulsion force. Finally, a dual-arm robot consisting of two 6-DOF Jaco2 manipulators is simulated in a Matlab environment to verify the obstacle avoidance algorithm of dual-arm robots. The simulation results show that the algorithm proposed in this paper can complete the multi-obstacle avoidance tasks of terminal obstacle avoidance and zero-space obstacle avoidance simultaneously with the premise of realizing the self-obstacle avoidance of dual-arm robots, and has a minor terminal trajectory error, which proves that the algorithm is in the feasibility of completing terminal obstacle avoidance and zero-space obstacle avoidance with the premise of realizing dual-arm robots self-obstacle avoidance.

16 January 2026 in Aerospace Science and Technology
Verified
Journal Article
Closed access
QPQuancheng Pu
Quancheng Pu
LYLu Yang
Lu Yang
Tieshan LiTieshan Li
Tieshan Li

15 January 2026 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
QPQuancheng Pu
Quancheng Pu
LYLu Yang
Lu Yang
Tieshan LiTieshan Li
Tieshan Li