Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Optimization of an Autonomous Mobile Robot Path Planning Based on Improved Genetic Algorithms

Journal of Robotics and Control (JRC) · Vol. 4 No. 4 (2023) · hlm. 557–571

DOI
10.18196/jrc.v4i4.19306
ISSN
2715-5072, 2715-5056
Terbit
2023-08-19
Penerbit
Universitas Muhammadiyah Yogyakarta
Bahasa
eng

Abstrak

Mobile robots are intended to operate in a variety of environments, and they need to be able to navigate and travel around obstacles, such as objects and barriers. In order to guarantee that the robot will not come into contact with any obstacles or other objects during its movement, algorithms for path planning have been demonstrated. The basic goal while constructing a route is to find the fastest and smoothest route between the starting point and the destination. This article describes route planning using the improvised genetic algorithm with the Bezier Curve (GA-BZ). This study carried out two main experiments, each using a 20x20 random grid map model with varying percentages of obstacles (5%, 15%, and 30% in the first experiment, and 25% and 50% in the second). In the initial experiments, the population (PN), generation (GN), and mutation rate (MR) of genetic algorithms (GA) will be altered to the following values: (PN = 100, 125, 150, or 200; GN = 100, 125, 150; and MR = 0.1, 0.3, 0.5, 0.7) respectively. The goal is to evaluate the effectiveness of AMR in terms of travel distance (m), total time (s), and total cost (RM) in comparison to traditional GA and GA-BZ. The second experiment examined robot performance utilising GA, GA-BZ, Simulated Annealing (SA), A-Star (A*), and Dijkstra's Algorithms (DA) for path distance (m), time travel (s), and fare trip (RM). The simulation results are analysed, compared, and explained. In conclusion, the project is summarised.

Kata kunci

Jaringan kolaborasi para penulis

40 penulis · 120 tautan kepenulisan bersama · 58 lintas organisasi · menampilkan 40 yang paling banyak terhubung

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

  • Universiti Teknikal Malaysia Melaka
  • Sebelas Maret University
  • Universitas Ahmad Dahlan
  • Islamic Azad University, Tehran
  • Advanced Semiconductor Engineering (Taiwan)
  • Muhammadiyah University of Yogyakarta
  • King Fahd University of Petroleum and Minerals
  • 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
Hari MaghfirohSebelas Maret University6
Iswanto SuwarnoMuhammadiyah University of Yogyakarta4
Magdi S. MahmoudKing Fahd University of Petroleum and Minerals3
Mahmoud A. MossaMinia University3
Davut İzciBursa Uludağ Üni̇versi̇tesi̇3
Serdar EkinciGedik University3
Abdullah ÇakanKonya Technical University2
Marco Antonio Márquez-VeraUniversidad Politécnica de Pachuca2
Furizal FurizalUniversitas Ahmad Dahlan2
Mostafa JabariSahand University of Technology2
Tarmizi Ahmad IzzuddinUniversiti Teknikal Malaysia Melaka2
C. H. OngUniversiti Teknikal Malaysia Melaka2
Anuar Mohamed KassimUniversiti Teknikal Malaysia Melaka2
M. N. SukhaimieAfiliasi tidak diketahui2
Mohd Adili NorasikinUniversiti Teknikal Malaysia Melaka2
Ahmad Fuad Abdul RasidUniversiti Teknikal Malaysia Melaka2
W. M. BukhariAfiliasi tidak diketahui2
Muhammad NizamSebelas Maret University1
Joko Slamet SaputroSebelas Maret University1
Berlian Shanaza AndianySebelas Maret University1
Chico HermanuSebelas Maret University1
Miftahul AnwarSebelas Maret University1
Sunardi SunardiUniversitas Ahmad Dahlan1
Rio Ikhsan AlfianUniversitas Ahmad Dahlan1
Naufal Rahmat SetiawanAfiliasi tidak diketahui1
Ahmed Jaber AbougarairUniversity of Tripoli1
Edwin Albert UmohAfiliasi tidak diketahui1
Safinta Nurindra RahmadhiaUniversitas Ahmad Dahlan1
Samir LadaciEcole Nationale Polytechnique de Constantine1
Jonattan Niño ParadaUniversidad de los Llanos1
Reza AlayiIslamic Azad University, Tehran1
Yaser EbazadehIslamic Azad University, Tehran1
Ferydon GharadaghiAfiliasi tidak diketahui1
Farnaz JahanbinIslamic Azad University, Mashhad1
Nima ShafaghatianUniversity of Zanjan1
Hamdi EcheikhEcole Nationale d'Ingénieurs de Monastir1

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://journal.umy.ac.id/index.php/jrc/oai, pertama di-harvest 9 Nov 2026, terakhir terlihat 9 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">Optimization of an Autonomous Mobile Robot Path Planning Based on Improved Genetic Algorithms</dc:title>
	<dc:creator>Abu, N. S.</dc:creator>
	<dc:creator>Bukhari, W. M.</dc:creator>
	<dc:creator>Adli, M. H.</dc:creator>
	<dc:creator>Ma’arif, Alfian</dc:creator>
	<dc:subject xml:lang="en-US">Genetic Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Bezier Curve</dc:subject>
	<dc:subject xml:lang="en-US">Obstacles Avoidance</dc:subject>
	<dc:subject xml:lang="en-US">Robot Optimization</dc:subject>
	<dc:subject xml:lang="en-US">Path Planning.</dc:subject>
	<dc:description xml:lang="en-US">Mobile robots are intended to operate in a variety of environments, and they need to be able to navigate and travel around obstacles, such as objects and barriers. In order to guarantee that the robot will not come into contact with any obstacles or other objects during its movement, algorithms for path planning have been demonstrated. The basic goal while constructing a route is to find the fastest and smoothest route between the starting point and the destination. This article describes route planning using the improvised genetic algorithm with the Bezier Curve (GA-BZ). This study carried out two main experiments, each using a 20x20 random grid map model with varying percentages of obstacles (5%, 15%, and 30% in the first experiment, and 25% and 50% in the second). In the initial experiments, the population (PN), generation (GN), and mutation rate (MR) of genetic algorithms (GA) will be altered to the following values: (PN = 100, 125, 150, or 200; GN = 100, 125, 150; and MR = 0.1, 0.3, 0.5, 0.7) respectively. The goal is to evaluate the effectiveness of AMR in terms of travel distance (m), total time (s), and total cost (RM) in comparison to traditional GA and GA-BZ. The second experiment examined robot performance utilising GA, GA-BZ, Simulated Annealing (SA), A-Star (A*), and Dijkstra's Algorithms (DA) for path distance (m), time travel (s), and fare trip (RM). The simulation results are analysed, compared, and explained. In conclusion, the project is summarised.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
	<dc:date>2023-08-19</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/19306</dc:identifier>
	<dc:identifier>10.18196/jrc.v4i4.19306</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 4 No. 4 (2023); 557-571</dc:source>
	<dc:source>2715-5072</dc:source>
	<dc:source>2715-5056</dc:source>
	<dc:source>10.18196/jrc.v4i4</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/19306/8539</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 N. S. Abu, W. M. Bukhari, M. H. Adli, Alfian Ma’arif</dc:rights>
</oai_dc:dc>