Jurnal
SINTA 1
Mobile Robot Path Planning in a Trajectory with Multiple Obstacles Using Genetic Algorithms
Journal of Robotics and Control (JRC) · Vol. 3 No. 1 (2021) · hlm. 1–7
ISSN 2715-5072, 2715-5056
Terbit 2021-06-30
Penerbit Universitas Muhammadiyah Yogyakarta
Bahasa eng
Abstrak
Path planning is an essential algorithm to help robots complete their task in the field quickly. However, some path planning algorithms are computationally expensive and cannot adapt to new environments with a distinctly different set of obstacles. This paper presents optimal path planning based on a genetic algorithm (GA) that is proposed to be carried out in a dynamic environment with various obstacles. First, the points of the feasible path are found by performing a local search procedure. Then, the points are optimized to find the shortest path. When the optimal path is calculated, the position of the points on the path is smoothed to avoid obstacles in the environment. Thus, the average fitness values and the GA generation are better than the traditional method. The simulation results show that the proposed algorithm successfully finds the optimal path in an environment with multiple obstacles. Compared to a traditional GA-based method, our proposed algorithm has a smoother route due to path optimization. Therefore, this makes the proposed method advantageous in a dynamic environment.
Jaringan kolaborasi para penulis
7 penulis ·
9 tautan kepenulisan bersama
· 2 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Politeknik Negeri Malang National Central University Universitas Gadjah Mada
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
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 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">Mobile Robot Path Planning in a Trajectory with Multiple Obstacles Using Genetic Algorithms</dc:title>
<dc:creator>Rahmaniar, Wahyu</dc:creator>
<dc:creator>Rakhmania, Amalia Eka</dc:creator>
<dc:subject xml:lang="en-US">genetic algorithm</dc:subject>
<dc:subject xml:lang="en-US">mobile robot</dc:subject>
<dc:subject xml:lang="en-US">optimal path</dc:subject>
<dc:subject xml:lang="en-US">path planning</dc:subject>
<dc:subject xml:lang="en-US">shortest path</dc:subject>
<dc:description xml:lang="en-US">Path planning is an essential algorithm to help robots complete their task in the field quickly. However, some path planning algorithms are computationally expensive and cannot adapt to new environments with a distinctly different set of obstacles. This paper presents optimal path planning based on a genetic algorithm (GA) that is proposed to be carried out in a dynamic environment with various obstacles. First, the points of the feasible path are found by performing a local search procedure. Then, the points are optimized to find the shortest path. When the optimal path is calculated, the position of the points on the path is smoothed to avoid obstacles in the environment. Thus, the average fitness values and the GA generation are better than the traditional method. The simulation results show that the proposed algorithm successfully finds the optimal path in an environment with multiple obstacles. Compared to a traditional GA-based method, our proposed algorithm has a smoother route due to path optimization. Therefore, this makes the proposed method advantageous in a dynamic environment.</dc:description>
<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
<dc:date>2021-06-30</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/11024</dc:identifier>
<dc:identifier>10.18196/jrc.v3i1.11024</dc:identifier>
<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 3 No. 1 (2022): January; 1-7</dc:source>
<dc:source>2715-5072</dc:source>
<dc:source>2715-5056</dc:source>
<dc:source>10.18196/jrc.v3i1</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/11024/6476</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2021 Wahyu Rahmaniar, Amalia Eka Rakhmania</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
Rahmaniar, W., & Rakhmania, A. E. (2021). Mobile Robot Path Planning in a Trajectory with Multiple Obstacles Using Genetic Algorithms. Journal of Robotics and Control (JRC), 3(1), 1–7. https://doi.org/10.18196/jrc.v3i1.11024
Salin
IEEE
W. Rahmaniar and A. E. Rakhmania, “Mobile Robot Path Planning in a Trajectory with Multiple Obstacles Using Genetic Algorithms,” Journal of Robotics and Control (JRC), vol. 3, no. 1, pp. 1–7, 2021, doi: 10.18196/jrc.v3i1.11024.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.