Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Optimal Path Planning using Equilateral Spaces Oriented Visibility Graph Method

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 7 No. 6 (2017)

DOI
10.11591/ijece.v7i6.pp3046-3051
ISSN
2088-8708, 2088-8708
Published
2017-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

Path planning has been an important aspect in the development of autonomous cars in which path planning is used to find a collision-free path for the car to traverse from a starting point Sp to a target point Tp. The main criteria for a good path planning algorithm include the capability of producing the shortest path with a low computation time. Low computation time makes the autonomous car able to re-plan a new collision-free path to avoid accident. However, the main problem with most path planning methods is their computation time increases as the number of obstacles in the environment increases. In this paper, an algorithm based on visibility graph (VG) is proposed. In the proposed algorithm, which is called Equilateral Space Oriented Visibility Graph (ESOVG), the number of obstacles considered for path planning is reduced by introducing a space in which the obstacles lie. This means the obstacles located outside the space are ignored for path planning. From simulation, the proposed algorithm has an improvement rate of up to 90% when compared to VG. This makes the algorithm is suitable to be applied in real-time and will greatly accelerate the development of autonomous cars in the near future.

Collaboration network of the authors

38 authors · 122 co-authorship links · 35 across different organisations

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
  • University of Technology Malaysia
  • Chitkara University
  • Chandigarh University
  • INTI International University
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Elia Nadira SabudinTun Hussein Onn University of Malaysia4
Khalil Azha Mohd AnnuarUniversiti Teknikal Malaysia Melaka3
Mohd Razali Mohamad SapieeUniversiti Teknikal Malaysia Melaka3
Susama BagchiTun Hussein Onn University of Malaysia3
Muhammad Suhaimi SulongTun Hussein Onn University of Malaysia3
Najib Al-FadhaliTun Hussein Onn University of Malaysia2
B.S.S.K. IbrahimTun Hussein Onn University of Malaysia2
Faisal AminTun Hussein Onn University of Malaysia2
Bashir Bala MuhammadNorthwestern Polytechnical University2
Abdul Rashid O. MuminTun Hussein Onn University of Malaysia2
Kim Gaik TayTun Hussein Onn University of Malaysia1
Audrey HuongAffiliation unknown1
Asmarashid PonniranTun Hussein Onn University of Malaysia1
Che Ku Nor Azie Hailma Che Ku MelorTun Hussein Onn University of Malaysia1
Ariffuddin JoretTun Hussein Onn University of Malaysia1
Maryanti RazaliTun 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
Md Azim Affzani Md RozaniUniversiti Teknikal Malaysia Melaka1
M. K. A. RahimUniversity of Technology Malaysia1
Huda A. MajidTun Hussein Onn University of Malaysia1
Bashar A. F. EsmailTun Hussein Onn University of Malaysia1
Muhammad Faizal IsmailUniversity of Technology 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>Optimal Path Planning using Equilateral Spaces Oriented Visibility Graph Method</dc:title><dc:creator>Abdul Latip, Nor Badariyah</dc:creator><dc:creator>Omar, Rosli</dc:creator><dc:creator>Debnath, Sanjoy Kumar</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span&amp;gt;Path planning has been an important aspect in the development of autonomous cars in which path planning is used to find a collision-free path for the car to traverse from a starting point Sp to a target point Tp. The main criteria for a good path planning algorithm include the capability of producing the shortest path with a low computation time. Low computation time makes the autonomous car able to re-plan a new collision-free path to avoid accident. However, the main problem with most path planning methods is their computation time increases as the number of obstacles in the environment increases. In this paper, an algorithm based on visibility graph (VG) is proposed. In the proposed algorithm, which is called Equilateral Space Oriented Visibility Graph (ESOVG), the number of obstacles considered for path planning is reduced by introducing a space in which the obstacles lie. This means the obstacles located outside the space are ignored for path planning. From simulation, the proposed algorithm has an improvement rate of up to 90% when compared to VG. This makes the algorithm is suitable to be applied in real-time and will greatly accelerate the development of autonomous cars in the near future.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2017-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.v7i6.pp3046-3051</dc:identifier><dc:identifier>10.11591/ijece.v7i6.pp3046-3051</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 7 No 6 (2017); 3046</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/8673/7268</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>