Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Multiple Targets Path Planning for Document Delivering Mobile Robot in Dynamic Environments

Journal of Robotics and Control (JRC) · Vol. 6 No. 4 (2025) · hlm. 1949–1961

DOI
10.18196/jrc.v6i4.26660
ISSN
2715-5072, 2715-5056
Terbit
2025-07-20
Penerbit
Universitas Muhammadiyah Yogyakarta
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This paper proposes a method to control and make path planning for a delivering mobile robot that operates in a dynamic environment. The working environment is an office building that will appear both static obstacles and dynamic obstacles (such as such as people or other mobile robots). The mobile robot is designed to carry documents to multiple targets that are determined by users. Users can call the mobile robot and input the information of the documents and targets that need to be delivered via the website. The working environment map will be established by using LiDAR and SLAM technology. The path plaining is executed in two steps. Firstly, the ant colony algorithm (ACO) is employed to solve the indoor traveling salesman problem (ITSP), the TSP for indoor application, for determining the globally optimal moving schedule to multiple targets in this paper. Then, the shortest moving path between point to points for the delivering mobile robot is determined by using the Dijkstra algorithm. The shortest moving path for the delivering mobile robot is determined by using the Dijkstra algorithm. The ant colony algorithm (ACO) is employed to solve the inner traveling salesman problem (ITSP) to determine the optimal moving schedule to multiple targets in this paper. The dynamic window approach (DWA) methodology is applied to assist mobile robots in avoiding static and dynamic obstacles. In addition, the adaptive monte Carlo localization (AMCL) is used for positioning the mobile robot on the map. Finally, the simulation in MATLAB and Gazebo environment as well as the experiments, are presented to prove the superior success of the delivering mobile robot.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 17 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Ho Chi Minh City University of Technology and Engineering
  • Ho Chi Minh City University of Technology
  • 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
Minh Tam NguyenAfiliasi tidak diketahui1
Anh-Vu NguyenAfiliasi tidak diketahui1
Vi Do TranAfiliasi tidak diketahui1
Tran Minh Nguyet NguyenAfiliasi tidak diketahui1
Vinh-Hao NguyenHo Chi Minh City University of Technology1

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">Multiple Targets Path Planning for Document Delivering Mobile Robot in Dynamic Environments</dc:title>
	<dc:creator>Vu, Van-Phong</dc:creator>
	<dc:creator>Nguyen, Dinh-Hieu</dc:creator>
	<dc:creator>Nguyen, Thanh-Trung</dc:creator>
	<dc:creator>Tran, Minh-Duc</dc:creator>
	<dc:subject xml:lang="en-US">Mobile Robot</dc:subject>
	<dc:subject xml:lang="en-US">Inner Traveling Salesman (ITSP)</dc:subject>
	<dc:subject xml:lang="en-US">Ant Colony Algorithm (ACO)</dc:subject>
	<dc:subject xml:lang="en-US">Path Planning</dc:subject>
	<dc:subject xml:lang="en-US">SLAM</dc:subject>
	<dc:subject xml:lang="en-US">Dijkstra</dc:subject>
	<dc:subject xml:lang="en-US">DWA</dc:subject>
	<dc:subject xml:lang="en-US">AMCL</dc:subject>
	<dc:description xml:lang="en-US">This paper proposes a method to control and make path planning for a delivering mobile robot that operates in a dynamic environment. The working environment is an office building that will appear both static obstacles and dynamic obstacles (such as such as people or other mobile robots). The mobile robot is designed to carry documents to multiple targets that are determined by users. Users can call the mobile robot and input the information of the documents and targets that need to be delivered via the website. The working environment map will be established by using LiDAR and SLAM technology. The path plaining is executed in two steps. Firstly, the ant colony algorithm (ACO) is employed to solve the indoor traveling salesman problem (ITSP), the TSP for indoor application, for determining the globally optimal moving schedule to multiple targets in this paper. Then, the shortest moving path between point to points for the delivering mobile robot is determined by using the Dijkstra algorithm. The shortest moving path for the delivering mobile robot is determined by using the Dijkstra algorithm. The ant colony algorithm (ACO) is employed to solve the inner traveling salesman problem (ITSP) to determine the optimal moving schedule to multiple targets in this paper. The dynamic window approach (DWA) methodology is applied to assist mobile robots in avoiding static and dynamic obstacles. In addition, the adaptive monte Carlo localization (AMCL) is used for positioning the mobile robot on the map. Finally, the simulation in MATLAB and Gazebo environment as well as the experiments, are presented to prove the superior success of the delivering mobile robot.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
	<dc:date>2025-07-20</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/26660</dc:identifier>
	<dc:identifier>10.18196/jrc.v6i4.26660</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 6 No. 4 (2025); 1949-1961</dc:source>
	<dc:source>2715-5072</dc:source>
	<dc:source>2715-5056</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/26660/11740</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Van-Phong Vu, Dinh-Hieu Nguyen, Thanh-Trung Nguyen, Minh-Duc Tran</dc:rights>
	<dc:rights xml:lang="en-US">https://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>