Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Efficient robotic path planning algorithm based on artificial potential field

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 6 (2021)

DOI
10.11591/ijece.v11i6.pp4840-4849
ISSN
2722-2578, 2088-8708
Published
2021-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

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.

Collaboration network of the authors

40 authors · 134 co-authorship links · 35 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Tun Hussein Onn University of Malaysia
  • Universiti Teknikal Malaysia Melaka
  • Maharishi Markandeshwar University, Mullana
  • Chitkara University
  • Chandigarh University
  • INTI International University
  • Northwestern Polytechnical University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ariffuddin JoretTun Hussein Onn University of Malaysia4
Susama BagchiTun Hussein Onn University of Malaysia4
Khalil Azha Mohd AnnuarUniversiti Teknikal Malaysia Melaka3
Mohd Razali Mohamad SapieeUniversiti Teknikal Malaysia Melaka3
Che Ku Nor Azie Hailma Che Ku MelorTun Hussein Onn University of Malaysia3
Maryanti RazaliTun Hussein Onn University of Malaysia3
B.S.S.K. IbrahimTun Hussein Onn University of Malaysia3
Faisal AminTun Hussein Onn University of Malaysia3
Bashir Bala MuhammadNorthwestern Polytechnical University3
M. F. L. AbdullahTun Hussein Onn University of Malaysia2
Najib Al-FadhaliTun Hussein Onn University of Malaysia2
Nor Badariyah Abdul LatipTun Hussein Onn University of Malaysia2
Asmarashid PonniranTun Hussein Onn University of Malaysia2
Abdul Rashid O. MuminTun Hussein Onn University of Malaysia2
Kim Gaik TayTun Hussein Onn University of Malaysia1
Audrey HuongAffiliation unknown1
Noor Azwan ShairiUniversiti Teknikal Malaysia Melaka1
Elfarizanis BaharudinTun Hussein Onn University of Malaysia1
Nur Izzati ZulkefliTun Hussein Onn University of Malaysia1
Ravi Kumar SachdevaChitkara University1
Priyanka BathlaChandigarh University1
Rohit LambaMaharishi Markandeshwar University, Mullana1
Pooja RaniMaharishi Markandeshwar University, Mullana1
Wai Yie LeongINTI International University1
Huda Abdul MajiddTun Hussein Onn University of Malaysia1
Mohd Hezri MokhtarTun Hussein Onn University of Malaysia1
Najmaddin Abo MosaliTun Hussein Onn University of Malaysia1
Muhammad Aiman Mohd AzamAffiliation unknown1
Khajan SegaranUniversiti Teknikal Malaysia Melaka1
Jawad AliTun Hussein Onn University of Malaysia1
Samsul Haimi DahlanTun Hussein Onn University of Malaysia1
Jiwa AbdullahTun Hussein Onn University of Malaysia1
Rozlan AliasTun Hussein Onn University of Malaysia1
Zahriladha ZakariaUniversiti Teknikal Malaysia Melaka1
Norshidah KatiranTun Hussein Onn University of Malaysia1
Sajjad AhmedTun Hussein Onn University of Malaysia1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Efficient robotic path planning algorithm based on  artificial potential field</dc:title><dc:creator>Sabudin, Elia Nadira</dc:creator><dc:creator>Omar, Rosli</dc:creator><dc:creator>Debnath, Sanjoy Kumar</dc:creator><dc:creator>Sulong, Muhammad Suhaimi</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;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.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i6.pp4840-4849</dc:identifier><dc:identifier>10.11591/ijece.v11i6.pp4840-4849</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 6 (2021); 4840</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/23507/15182</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>