Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

SMART INDOOR NAVIGATION FOR MOBILE ROBOTS: A HARMONIC POTENTIAL-BASED APPROACH WITH ACCELERATED OVER-RELAXATION ITERATIVE METHOD

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 4 (2026) · pp. 3439–3458

DOI
10.30598/barekengvol20iss4pp3439-3458
ISSN
2615-3017, 1978-7227
Published
2026-08-24
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Path planning for autonomous mobile robots remains a critical challenge, particularly in environments with obstacles and constraints. Efficient navigation requires a robust algorithm capable of generating smooth, collision-free trajectories while ensuring computational efficiency. This study addresses the problem of indoor mobile robot navigation by leveraging harmonic potential fields, a solution derived from Laplace’s equation, to formulate an effective path-planning strategy. Conventional numerical methods for solving Laplace’s equation, such as Successive Over-Relaxation and Accelerated Over-Relaxation, often require extensive computational resources, especially in large-scale environments. To overcome this limitation, this research introduces an improved iterative approach, the Explicit Decoupled Group Modified Accelerated Over-Relaxation (EDGMAOR) method, which enhances computational efficiency and convergence speed. The EDGMAOR method incorporates a half-sweep block approach, significantly reducing the number of computations required per iteration while maintaining accuracy. To validate the effectiveness of the proposed method, simulations were conducted in a static, enclosed environment with various configurations of obstacles. Different starting and goal positions were tested to assess the efficiency, accuracy, and computational cost of the generated paths. The results indicate that the EDGMAOR method outperforms conventional approaches by achieving faster convergence rates and reduced computational time, demonstrating its suitability for real-time robot pathfinding applications. Furthermore, the study highlights that with greater obstacles proliferation, the EDGMAOR method maintains its efficiency, as obstacle regions are automatically excluded from unnecessary computations. This characteristic makes the method particularly useful for complex indoor environments where real-time processing is crucial. In conclusion, this research establishes EDGMAOR as a practical and effective solution for solving mobile robot path-planning problems, providing a balance between computational speed, accuracy, and robustness. The findings contribute to the ongoing advancements in autonomous robotics and artificial intelligence-driven navigation systems, with potential applications in industrial automation, smart transportation, and defence sectors.

Collaboration network of the authors

5 authors · 10 co-authorship links · 4 across different organisations

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

  • National Defence University of Malaysia
  • Universiti of Malaysia Sabah
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

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.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 8 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SMART INDOOR NAVIGATION FOR MOBILE ROBOTS:  A HARMONIC POTENTIAL-BASED APPROACH WITH ACCELERATED OVER-RELAXATION ITERATIVE METHOD</dc:title>
	<dc:creator>Ahmad Dahalan, A'Qilah</dc:creator>
	<dc:creator>Srivastava, Rupal</dc:creator>
	<dc:creator>Mat Jusoh, Ruzanna</dc:creator>
	<dc:creator>Saudi, Azali</dc:creator>
	<dc:creator>Sulaiman, Jumat</dc:creator>
	<dc:description xml:lang="en-US">Path planning for autonomous mobile robots remains a critical challenge, particularly in environments with obstacles and constraints. Efficient navigation requires a robust algorithm capable of generating smooth, collision-free trajectories while ensuring computational efficiency. This study addresses the problem of indoor mobile robot navigation by leveraging harmonic potential fields, a solution derived from Laplace’s equation, to formulate an effective path-planning strategy. Conventional numerical methods for solving Laplace’s equation, such as Successive Over-Relaxation and Accelerated Over-Relaxation, often require extensive computational resources, especially in large-scale environments. To overcome this limitation, this research introduces an improved iterative approach, the Explicit Decoupled Group Modified Accelerated Over-Relaxation (EDGMAOR) method, which enhances computational efficiency and convergence speed. The EDGMAOR method incorporates a half-sweep block approach, significantly reducing the number of computations required per iteration while maintaining accuracy. To validate the effectiveness of the proposed method, simulations were conducted in a static, enclosed environment with various configurations of obstacles. Different starting and goal positions were tested to assess the efficiency, accuracy, and computational cost of the generated paths. The results indicate that the EDGMAOR method outperforms conventional approaches by achieving faster convergence rates and reduced computational time, demonstrating its suitability for real-time robot pathfinding applications. Furthermore, the study highlights that with greater obstacles proliferation, the EDGMAOR method maintains its efficiency, as obstacle regions are automatically excluded from unnecessary computations. This characteristic makes the method particularly useful for complex indoor environments where real-time processing is crucial. In conclusion, this research establishes EDGMAOR as a practical and effective solution for solving mobile robot path-planning problems, providing a balance between computational speed, accuracy, and robustness. The findings contribute to the ongoing advancements in autonomous robotics and artificial intelligence-driven navigation systems, with potential applications in industrial automation, smart transportation, and defence sectors.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2026-08-24</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/22640</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss4pp3439-3458</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 4 (2026): BAREKENG: Journal of Mathematics and Its Application; 3439-3458</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss4year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/22640/13072</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 A'Qilah Ahmad Dahalan, Rupal Srivasta, Ruzanna Mat Jusoh, Azali Saudi, Jumat Sulaiman</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>