Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

An Effective Way for Repositioning the Beacon Nodes of Fast RRT Results Utilizing Grey Wolf Optimization

Journal of Robotics and Control (JRC) · Vol. 6 No. 1 (2025) · pp. 272–284

DOI
10.18196/jrc.v6i1.22062
ISSN
2715-5072, 2715-5056
Published
2025-01-25
Publisher
Universitas Muhammadiyah Yogyakarta
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Conceptually, Fast-RRT applies fast sampling and random steering which makes the initial path quickly obtained. Referring to the initial path, the optimality of the path is improved by applying path fusion and path optimization. Theoretically, path fusion will only be optimal if there is always a unique/different path to be fused with the previously obtained path. However, in the conditions of solving path planning problems in narrow corridors, the potential for obtaining a different path from the previous one is very small. So that fusion does not run properly, but checking the relationship between nodes to nodes still occurs. Instead of getting an optimal path in conditions like this, the computation will increase, the solution time will be long, and the resulting path will still be sub-optimal. As an effort to solve this problem, Grey Wolf Optimization (GWO) is involved through this study. While an initial path is found, the beacons are repositioned. From the path, the number of nodes is unpredictable, causing the decision variables in optimization to become large. For this reason, the GWO is chosen because it is independent of population representation and is not affected by the number of decision variables. This proposed method is claimed to be more effective in solving path planning problems in terms of convergence rate and optimality. Therefore, the proposed method is evaluated and compared with previous methods and gives the result that the average working speed of Fast-RRT is improved by 90.25% and the optimality average increased by 5.67%.

Keywords

Collaboration network of the authors

40 authors · 96 co-authorship links · 56 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.

  • Mercu Buana University
  • Tun Hussein Onn University of Malaysia
  • University of Technology Malaysia
  • Bandung Institute of Technology
  • Shanghai University
  • Indonesia University of Education
  • National Research and Innovation Agency
  • 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
Muhammad Hafizd Ibnu HajarMercu Buana University7
Ahmad Athif Mohd FaudziUniversity of Technology Malaysia6
Yudhi GunardiMercu Buana University6
Achmad BurhanudinMercu Buana University5
Dafit FeriyantoMercu Buana University2
Hadi PranotoMercu Buana University2
Abdi WahabMercu Buana University2
January Dwidasa WiniyogaMercu Buana University2
Wenbin WangShenzhen Polytechnic University2
Md Musabbir HossainAffiliation unknown2
Long LiAffiliation unknown2
Nur Aziz TaufikurohmanMercu Buana University2
Shamsudin H. M. AminUniversity of Technology Malaysia1
Muchamad Rizky NugrahaAffiliation unknown1
Arif BasukiMercu Buana University1
Jaja KustijaIndonesia University of Education1
Diki FahrizalBandung Institute of Technology1
Muhamad NasirNational Research and Innovation Agency1
Muhammad Husni MuttaqinBandung Institute of Technology1
Mirzanu Rizki GMAffiliation unknown1
Yuliza .Affiliation unknown1
Rizal Broer BahaweresSyarif Hidayatullah State Islamic University Jakarta1
Tjetjep Rony BudimanMercu Buana University1
Qingsheng LuoBeijing Institute of Technology1
Supaat ZakariaUngku Omar Polytechnic1
Zendi IklimaMercu Buana University1
Sabin HitimanaKigali Independent University1
Abdul Mutalib LemanTun Hussein Onn University of Malaysia1
Mohammad Saiful HuqLondon Metropolitan University1
B. S. K. K. IbrahimCoventry University1
Mohd Khairul Ikhwan AhmadTun Hussein Onn University of Malaysia1
Zubair Adil SoomroTun Hussein Onn University of Malaysia1
Ruzairi Abdul RahimUniversity of Technology Malaysia1
Prastika IndriyantiMercu Buana University1
Arafat FebriandirzaUniversitas Muhammadiyah Prof Dr Hamka1

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://journal.umy.ac.id/index.php/jrc/oai, first harvested 9 Nov 2026, last seen 16 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">An Effective Way for Repositioning the Beacon Nodes of Fast RRT Results Utilizing Grey Wolf Optimization</dc:title>
	<dc:creator>Suwoyo, Heru</dc:creator>
	<dc:creator>Adriansyah, Andi</dc:creator>
	<dc:creator>Andika, Julpri</dc:creator>
	<dc:creator>Shamsudin, Abu Ubaidah</dc:creator>
	<dc:creator>Tian, Yingzhong</dc:creator>
	<dc:subject xml:lang="en-US">Fast-RRT</dc:subject>
	<dc:subject xml:lang="en-US">Grey Wolf Optimization</dc:subject>
	<dc:subject xml:lang="en-US">Path Planning</dc:subject>
	<dc:subject xml:lang="en-US">Convergence Rate</dc:subject>
	<dc:subject xml:lang="en-US">Optimality</dc:subject>
	<dc:description xml:lang="en-US">Conceptually, Fast-RRT applies fast sampling and random steering which makes the initial path quickly obtained. Referring to the initial path, the optimality of the path is improved by applying path fusion and path optimization. Theoretically, path fusion will only be optimal if there is always a unique/different path to be fused with the previously obtained path. However, in the conditions of solving path planning problems in narrow corridors, the potential for obtaining a different path from the previous one is very small. So that fusion does not run properly, but checking the relationship between nodes to nodes still occurs. Instead of getting an optimal path in conditions like this, the computation will increase, the solution time will be long, and the resulting path will still be sub-optimal. As an effort to solve this problem, Grey Wolf Optimization (GWO) is involved through this study. While an initial path is found, the beacons are repositioned. From the path, the number of nodes is unpredictable, causing the decision variables in optimization to become large. For this reason, the GWO is chosen because it is independent of population representation and is not affected by the number of decision variables. This proposed method is claimed to be more effective in solving path planning problems in terms of convergence rate and optimality. Therefore, the proposed method is evaluated and compared with previous methods and gives the result that the average working speed of Fast-RRT is improved by 90.25% and the optimality average increased by 5.67%.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
	<dc:date>2025-01-25</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://journal.umy.ac.id/index.php/jrc/article/view/22062</dc:identifier>
	<dc:identifier>10.18196/jrc.v6i1.22062</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 6 No. 1 (2025); 272-284</dc:source>
	<dc:source>2715-5072</dc:source>
	<dc:source>2715-5056</dc:source>
	<dc:source>10.18196/jrc.v6i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/22062/11272</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Heru Suwoyo</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>