Elia Nadira Sabudin
Universiti Tun Hussein Onn Malaysia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Efficient robotic path planning algorithm based on artificial potential field Elia Nadira Sabudin; Rosli Omar; Sanjoy Kumar Debnath; Muhammad Suhaimi Sulong
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp4840-4849

Abstract

Path planning is crucial for a robot to be able to reach a target point safely to accomplish a given mission. In path planning, three essential criteria have to be considered namely path length, computational complexity and completeness. Among established path planning methods are voronoi diagram (VD), cell decomposition (CD), probability roadmap (PRM), visibility graph (VG) and potential field (PF). The above-mentioned methods could not fulfill all three criteria simultaneously which limits their application in optimal and real-time path planning. This paper proposes a path PF-based planning algorithm called dynamic artificial PF (DAPF). The proposed algorithm is capable of eliminating the local minima that frequently occurs in the conventional PF while fulfilling the criterion of path planning. DAPF also integrates path pruning to shorten the planned path. In order to evaluate its performance, DAPF has been simulated and compared with VG in terms of path length and computational complexity. It is found that DAPF is consistent in generating paths with low computation time in obstacle-rich environments compared to VG. The paths produced also are nearly optimal with respect to VG.