Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Modified Q-Learning Algorithm for Mobile Robot Path Planning Variation using Motivation Model

Journal of Robotics and Control (JRC) · Vol. 4 No. 5 (2023) · hlm. 696–707

DOI
10.18196/jrc.v4i5.18777
ISSN
2715-5072, 2715-5056
Terbit
2023-10-12
Penerbit
Universitas Muhammadiyah Yogyakarta
Bahasa
eng

Abstrak

Path planning is an essential algorithm in autonomous mobile robots, including agricultural robots, to find the shortest path and to avoid collisions with obstacles. Q-Learning algorithm is one of the reinforcement learning methods used for path planning. However, for multi-robot system, this algorithm tends to produce the same path for each robot. This research modifies the Q-Learning algorithm in order to produce path variations by utilizing the motivation model, i.e. achievement motivation, in which different motivation parameters will result in different optimum paths. The Motivated Q-Learning (MQL) algorithm proposed in this study was simulated in an area with three scenarios, i.e. without obstacles, uniform obstacles, and random obstacles. The results showed that, in the determined scenario, the MQL can produce 2 to 4 variations of optimum path without any potential of collisions (Jaccard similarity = 0%), in contrast to the Q-Learning algorithm that can only produce one optimum path variation. This result indicates that MQL can solve multi-robots path planning problems, especially when the number of robots is large, by reducing the possibility of collisions as well as decreasing the problem of queues. However, the average computational time of the MQL is slightly longer than that of the Q-Learning.

Kata kunci

Jaringan kolaborasi para penulis

40 penulis · 80 tautan kepenulisan bersama · 22 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.

  • IPB University
  • Universitas Halu Oleo
  • Universitas Kristen Wira Wacana Sumba
  • Institut Teknologi Telkom Purwokerto
  • Pakuan University
  • Politeknik Negeri Ujung Pandang
  • Sekolah Tinggi Teknologi Wastukancana
  • 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
Irman HermadiIPB University2
Sri NurdiatiIPB University2
Yeni HerdiyeniIPB University2
Iskandar Zulkarnaen SiregarIPB University2
Muhammad Rafi MuttaqinSekolah Tinggi Teknologi Wastukancana2
Cholid MawardiIPB University2
Syifa Afnani SantosoIPB University1
Indra JayaIPB University1
IrmansyahAfiliasi tidak diketahui1
Dhany Nugraha RamdhanyAfiliasi tidak diketahui1
Aziz KustiyoAfiliasi tidak diketahui1
Ekowati HandharyaniIPB University1
Rendy Eka SaputraIPB University1
Mustakim MustakimUniversitas Halu Oleo1
Arini Aha PekuwaliUniversitas Kristen Wira Wacana Sumba1
Wisnu Ananta KusumaIPB University1
Yani NurhadryaniIPB University1
Ariq Cahya WardhanaInstitut Teknologi Telkom Purwokerto1
Eliyah Acantha ManapaIPB University1
Shelvie Nidya NeymanIPB University1
Siti RaehanIPB University1
Medria Kusuma Dewi HardhienataAfiliasi tidak diketahui1
Fajar Delli WihartikoPakuan University1
Edi SantosaIPB University1
Prinob AksarUniversitas Halu Oleo1
Sudarsono SudarsonoUniversitas Halu Oleo1
Aminur AminurUniversitas Halu Oleo1
Sarwo PranotoPoliteknik Negeri Ujung Pandang1
La Ode SahabaUniversitas Halu Oleo1
La Ode Muh. MunadiUniversitas Halu Oleo1
Iman Rahayu Hidayati SusantoIPB University1
Wulandari WulandariIPB University1
Rafael Tektano Grandiawan EknandaIPB University1
Auriza Rahmad AkbarIPB University1
Toto HaryantoIPB University1
Muhammad Adib ZamzamIPB 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://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">Modified Q-Learning Algorithm for Mobile Robot Path Planning Variation using Motivation Model</dc:title>
	<dc:creator>Hidayat, Hidayat</dc:creator>
	<dc:creator>Buono, Agus</dc:creator>
	<dc:creator>Priandana, Karlisa</dc:creator>
	<dc:creator>Wahjuni, Sri</dc:creator>
	<dc:subject xml:lang="en-US">Mobile Robot</dc:subject>
	<dc:subject xml:lang="en-US">Motivated Q-Learning</dc:subject>
	<dc:subject xml:lang="en-US">Motivation Model</dc:subject>
	<dc:subject xml:lang="en-US">Path Planning</dc:subject>
	<dc:subject xml:lang="en-US">Q-Learning Algorithm.</dc:subject>
	<dc:description xml:lang="en-US">Path planning is an essential algorithm in autonomous mobile robots, including agricultural robots, to find the shortest path and to avoid collisions with obstacles. Q-Learning algorithm is one of the reinforcement learning methods used for path planning. However, for multi-robot system, this algorithm tends to produce the same path for each robot. This research modifies the Q-Learning algorithm in order to produce path variations by utilizing the motivation model, i.e. achievement motivation, in which different motivation parameters will result in different optimum paths. The Motivated Q-Learning (MQL) algorithm proposed in this study was simulated in an area with three scenarios, i.e. without obstacles, uniform obstacles, and random obstacles. The results showed that, in the determined scenario, the MQL can produce 2 to 4 variations of optimum path without any potential of collisions (Jaccard similarity = 0%), in contrast to the Q-Learning algorithm that can only produce one optimum path variation. This result indicates that MQL can solve multi-robots path planning problems, especially when the number of robots is large, by reducing the possibility of collisions as well as decreasing the problem of queues. However, the average computational time of the MQL is slightly longer than that of the Q-Learning.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
	<dc:date>2023-10-12</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/18777</dc:identifier>
	<dc:identifier>10.18196/jrc.v4i5.18777</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 4 No. 5 (2023); 696-707</dc:source>
	<dc:source>2715-5072</dc:source>
	<dc:source>2715-5056</dc:source>
	<dc:source>10.18196/jrc.v4i5</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/18777/8659</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Hidayat Hidayat, Agus Buono, Karlisa Priandana, Sri Wahjuni</dc:rights>
</oai_dc:dc>