Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Problem solving path planning and path tracking in a 3 DOF hexapod robot using the RRT* algorithm with path optimization and Pose-to-Pose

Sinergi · Vol. 28 No. 2 (2024) · hlm. 265–276

DOI
10.22441/sinergi.2024.2.007
ISSN
2460-1217, 1410-2331
Terbit
2024-04-26
Penerbit
Universitas Mercu Buana
Bahasa
eng

Abstrak

Path planning is one of the most fundamental problems that must be solved before a robot can navigate and explore autonomously. Path planning needs to be integrated with path tracking to be applied to autonomous robots. This makes path tracking also important for autonomous robot navigation which cannot be separated from path planning. There are two path planning methods, the first is search-based method, the second is sampling-based method. Both have their own advantages, but the popular and commonly used sampling-based algorithm due to its fast convergence is preferred in path planning. The RRT* algorithm was developed. This improvement initiated a major civilization in sampling-based algorithms, namely parent node selection and rewiring in RRT. Although there has been an improvement in optimality, RRT* still doesn't provide the distance optimality value as expected, due to its character that is still adopted from RRT. The resulting path is still suboptimal and not smooth (jagged). On the other side, Path tracking has several methods, however, these path tracking methods are difficult to apply to autonomous robots and need to be adapted to the robot used. Based on the description above, there are still problems with path planning, namely paths that are still less than optimal and convergence that is still slow. This research will add a way to shorten the distance in the RRT* algorithm with the triangular inequality method. Meanwhile, for path tracking, we will apply the pose-to-pose method, which follows the waypoint that has been made by path planning.

Kata kunci

Jaringan kolaborasi para penulis

20 penulis · 56 tautan kepenulisan bersama · 28 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Mercu Buana University
  • Shanghai University
  • University of Technology Malaysia
  • Tun Hussein Onn University of Malaysia
  • Beijing Institute of Technology
  • Shenzhen Polytechnic University
  • Universitas Muhammadiyah Prof Dr Hamka
  • Organisasi lain
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Andi AdriansyahMercu Buana University9
Muhammad Hafizd Ibnu HajarMercu Buana University7
Ahmad Athif Mohd FaudziUniversity of Technology Malaysia4
Yudhi GunardiMercu Buana University4
Abu Ubaidah ShamsudinTun Hussein Onn University of Malaysia3
Nur Aziz TaufikurohmanMercu Buana University3
January Dwidasa WiniyogaMercu Buana University2
Wenbin WangShenzhen Polytechnic University2
Md Musabbir HossainAfiliasi tidak diketahui2
Long LiAfiliasi tidak diketahui2
Yudi HastomiMercu Buana University2
Qingsheng LuoBeijing Institute of Technology1
Prastika IndriyantiMercu Buana University1
Arafat FebriandirzaUniversitas Muhammadiyah Prof Dr Hamka1
Fina SupeginaMercu Buana University1
Isack FaradyYuan Ze University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://publikasi.mercubuana.ac.id/index.php/sinergi/oai, pertama di-harvest 10 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (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">Problem solving path planning and path tracking in a 3 DOF hexapod robot using the RRT* algorithm with path optimization and Pose-to-Pose</dc:title>
	<dc:creator>Suwoyo, Heru</dc:creator>
	<dc:creator>Burhanudin, Achmad</dc:creator>
	<dc:creator>Tian, Yingzhong</dc:creator>
	<dc:creator>Andika, Julpri</dc:creator>
	<dc:subject xml:lang="en-US">Hexapod</dc:subject>
	<dc:subject xml:lang="en-US">Optimized-RRT*</dc:subject>
	<dc:subject xml:lang="en-US">Path Planning</dc:subject>
	<dc:subject xml:lang="en-US">Path Tracking</dc:subject>
	<dc:subject xml:lang="en-US">Pose-to-Pose</dc:subject>
	<dc:description xml:lang="en-US">Path planning is one of the most fundamental problems that must be solved before a robot can navigate and explore autonomously. Path planning needs to be integrated with path tracking to be applied to autonomous robots. This makes path tracking also important for autonomous robot navigation which cannot be separated from path planning. There are two path planning methods, the first is search-based method, the second is sampling-based method. Both have their own advantages, but the popular and commonly used sampling-based algorithm due to its fast convergence is preferred in path planning.  The RRT* algorithm was developed. This improvement initiated a major civilization in sampling-based algorithms, namely parent node selection and rewiring in RRT. Although there has been an improvement in optimality, RRT* still doesn't provide the distance optimality value as expected, due to its character that is still adopted from RRT.  The resulting path is still suboptimal and not smooth (jagged). On the other side, Path tracking has several methods, however, these path tracking methods are difficult to apply to autonomous robots and need to be adapted to the robot used. Based on the description above, there are still problems with path planning, namely paths that are still less than optimal and convergence that is still slow.  This research will add a way to shorten the distance in the RRT* algorithm with the triangular inequality method.  Meanwhile, for path tracking, we will apply the pose-to-pose method, which follows the waypoint that has been made by path planning. </dc:description>
	<dc:publisher xml:lang="en-US">Universitas Mercu Buana</dc:publisher>
	<dc:date>2024-04-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:format>application/msword</dc:format>
	<dc:identifier>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/22153</dc:identifier>
	<dc:identifier>10.22441/sinergi.2024.2.007</dc:identifier>
	<dc:source xml:lang="en-US">SINERGI; Vol. 28 No. 2 (2024); 265-276</dc:source>
	<dc:source>2460-1217</dc:source>
	<dc:source>1410-2331</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/22153/8228</dc:relation>
	<dc:relation>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/22153/11682</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 SINERGI</dc:rights>
</oai_dc:dc>