Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Efficient Path Planning Algorithm for Mobile Robots Performing Floor Cleaning Like Operations

Journal of Robotics and Control (JRC) · Vol. 5 No. 1 (2024) · hlm. 287–300

DOI
10.18196/jrc.v5i1.20035
ISSN
2715-5072, 2715-5056
Terbit
2024-02-06
Penerbit
Universitas Muhammadiyah Yogyakarta
Bahasa
eng

Abstrak

In this paper, we introduce an efficient path planning algorithm designed for floor cleaning applications, utilizing the concept of Spanning Tree Coverage (STC). We operate under the assumption that the environment, i.e., the floor, is initially unknown to the robot, which also lacks knowledge regarding obstacle positions, except for the workspace boundaries. The robot executes alternating phases of exploration and coverage, leveraging the local map generated during exploration to construct a STC tree, which then guides the subsequent coverage (cleaning) phase. The extent of exploration is determined by the range of the robot's sensors. The path generation algorithms for cleaning fall within the broader category of coverage path planning (CPP) algorithms. A key advantage of this algorithm is that the robot returns to its initial position upon completing the operation, minimizing battery usage since sensors are only active during the exploration phase. We classify the proposed algorithm as an offline-online scheme. To validate the effectiveness and non-repetitive nature of the algorithm, we conducted simulations using VRep/MATLAB environments and implemented real-time experiments using Turtlebot in the ROS-Gazebo environment. The results substantiate the completeness of coverage and underscore the algorithm's significance in applications akin to floor cleaning.

Kata kunci

Jaringan kolaborasi para penulis

7 penulis · 13 tautan kepenulisan bersama · 2 lintas organisasi

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

  • Manipal Academy of Higher Education
  • Northeastern University
  • 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
Navya Thirumaleswar HegdeAfiliasi tidak diketahui1
Spoorthi SinghManipal Academy of Higher Education1
Manish Varun YadavManipal Academy of Higher Education1
Madala Chaitanya SaiManipal Academy of Higher Education1
Jeane Marina D’SouzaManipal Academy of Higher Education1
Aditya BondadaNortheastern 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 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">Efficient Path Planning Algorithm for Mobile Robots Performing Floor Cleaning Like Operations</dc:title>
	<dc:creator>Nair, Vishnu G</dc:creator>
	<dc:subject xml:lang="en-US">Cleaning Path</dc:subject>
	<dc:subject xml:lang="en-US">Mobile Robots</dc:subject>
	<dc:subject xml:lang="en-US">Spanning Tree Coverage</dc:subject>
	<dc:subject xml:lang="en-US">Coverage Path Planning</dc:subject>
	<dc:subject xml:lang="en-US">Exploration</dc:subject>
	<dc:subject xml:lang="en-US">Sensors</dc:subject>
	<dc:subject xml:lang="en-US">Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Completeness</dc:subject>
	<dc:subject xml:lang="en-US">Non-Overlapping Coverage.</dc:subject>
	<dc:description xml:lang="en-US">In this paper, we introduce an efficient path planning algorithm designed for floor cleaning applications, utilizing the concept of Spanning Tree Coverage (STC). We operate under the assumption that the environment, i.e., the floor, is initially unknown to the robot, which also lacks knowledge regarding obstacle positions, except for the workspace boundaries. The robot executes alternating phases of exploration and coverage, leveraging the local map generated during exploration to construct a STC tree, which then guides the subsequent coverage (cleaning) phase. The extent of exploration is determined by the range of the robot's sensors. The path generation algorithms for cleaning fall within the broader category of coverage path planning (CPP) algorithms. A key advantage of this algorithm is that the robot returns to its initial position upon completing the operation, minimizing battery usage since sensors are only active during the exploration phase. We classify the proposed algorithm as an offline-online scheme. To validate the effectiveness and non-repetitive nature of the algorithm, we conducted simulations using VRep/MATLAB environments and implemented real-time experiments using Turtlebot in the ROS-Gazebo environment. The results substantiate the completeness of coverage and underscore the algorithm's significance in applications akin to floor cleaning.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Muhammadiyah Yogyakarta</dc:publisher>
	<dc:date>2024-02-06</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/20035</dc:identifier>
	<dc:identifier>10.18196/jrc.v5i1.20035</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Robotics and Control (JRC); Vol. 5 No. 1 (2024); 287-300</dc:source>
	<dc:source>2715-5072</dc:source>
	<dc:source>2715-5056</dc:source>
	<dc:source>10.18196/jrc.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.umy.ac.id/index.php/jrc/article/view/20035/8964</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Vishnu G Nair</dc:rights>
</oai_dc:dc>