Computation-efficient path planning using evolving artificial repulsive force over expanding obstacles for robotic manipulator.

Authors

Yi Zhou, Bowen Huang, Yim Ho Cheung, Pengfei Ye, Molong Duan

Published in

ISA transactions. Aug 01, 2026. Epub Aug 01, 2026.

Abstract

With growing demand for high productivity in industrial environments, fast path planning for robotic manipulators is critical, as planning time directly impacts production cycle efficiency. Traditional path planning methods, such as grid-based methods, artificial potential field methods, sampling-based methods, and optimization methods, often suffer from high computation costs in high-dimensional space. In particular, artificial potential field methods require the construction of global potential fields or the computation of gradients and attractive forces, increasing the computational burden. To address these issues, a computation-efficient path planning method, using the evolving artificial repulsive force over the expanding obstacles (EARFEO), is proposed. EARFEO incorporates obstacle clustering and virtual obstacle insertion with box-envelope strategy to mitigate the local minima, and iteratively deforms the path using artificial repulsive forces generated by expanding obstacles. A uniform resampling strategy is employed after each expansion step to maintain consistent waypoint distribution, followed by a final refinement phase to ensure complete clearance of the whole path after obstacle expansion is complete. Simulations and experiments across static and dynamic scenarios demonstrate that EARFEO reduces planning time significantly.

PMID:
42613247
Bibliographic data and abstract were imported from PubMed on 19 Aug 2026.

Read full publication at:
Please sign in to see all details.

Stats

1-terrible, 9-excellent. How would you rate this publication? Sign in in to submit your rating.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.