Cargando…

Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot

Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map are...

Descripción completa

Detalles Bibliográficos
Autores principales: Le, Anh Vu, Parween, Rizuwana, Elara Mohan, Rajesh, Nhan, Nguyen Huu Khanh, Enjikalayil Abdulkader, Raihan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7308827/
https://www.ncbi.nlm.nih.gov/pubmed/32503188
http://dx.doi.org/10.3390/s20113170
_version_ 1783549079721082880
author Le, Anh Vu
Parween, Rizuwana
Elara Mohan, Rajesh
Nhan, Nguyen Huu Khanh
Enjikalayil Abdulkader, Raihan
author_facet Le, Anh Vu
Parween, Rizuwana
Elara Mohan, Rajesh
Nhan, Nguyen Huu Khanh
Enjikalayil Abdulkader, Raihan
author_sort Le, Anh Vu
collection PubMed
description Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map areas with flexible sizes and to access the narrow space constraints. By dividing the map into sub-areas with the same size as the changeable robot shapes, the robot can plan the optimal movement to predetermined locations, transform its morphologies to cover the specific area, and ensure that the map is completely covered. The optimal navigation planning problem, including the least changing shape, shortest travel distance, and the lowest travel time while ensuring complete coverage of the map area, are solved in this paper. To this end, we propose the CACP framework for a tiling robot called hTrihex with three honeycomb shape modules. The robot can shift its shape into three different morphologies ensuring coverage of the map with a predetermined size. However, the ability to change shape also raises the complexity issues of the moving mechanisms. Therefore, the process of optimizing trajectories of the complete coverage is modeled according to the Traveling Salesman Problem (TSP) problem and solved by evolutionary approaches Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Hence, the costweight to clear a pair of waypoints in the TSP is defined as the required energy shift the robot between the two locations. This energy corresponds to the three operating processes of the hTrihex robot: transformation, translation, and orientation correction. The CACP framework is verified both in the simulation environment and in the real environment. From the experimental results, proposed CACP capable of generating the Pareto-optimal outcome that navigates the robot from the goal to destination in various workspaces, and the algorithm could be adopted to other tiling robot platforms with multiple configurations.
format Online
Article
Text
id pubmed-7308827
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-73088272020-06-25 Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot Le, Anh Vu Parween, Rizuwana Elara Mohan, Rajesh Nhan, Nguyen Huu Khanh Enjikalayil Abdulkader, Raihan Sensors (Basel) Article Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map areas with flexible sizes and to access the narrow space constraints. By dividing the map into sub-areas with the same size as the changeable robot shapes, the robot can plan the optimal movement to predetermined locations, transform its morphologies to cover the specific area, and ensure that the map is completely covered. The optimal navigation planning problem, including the least changing shape, shortest travel distance, and the lowest travel time while ensuring complete coverage of the map area, are solved in this paper. To this end, we propose the CACP framework for a tiling robot called hTrihex with three honeycomb shape modules. The robot can shift its shape into three different morphologies ensuring coverage of the map with a predetermined size. However, the ability to change shape also raises the complexity issues of the moving mechanisms. Therefore, the process of optimizing trajectories of the complete coverage is modeled according to the Traveling Salesman Problem (TSP) problem and solved by evolutionary approaches Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Hence, the costweight to clear a pair of waypoints in the TSP is defined as the required energy shift the robot between the two locations. This energy corresponds to the three operating processes of the hTrihex robot: transformation, translation, and orientation correction. The CACP framework is verified both in the simulation environment and in the real environment. From the experimental results, proposed CACP capable of generating the Pareto-optimal outcome that navigates the robot from the goal to destination in various workspaces, and the algorithm could be adopted to other tiling robot platforms with multiple configurations. MDPI 2020-06-03 /pmc/articles/PMC7308827/ /pubmed/32503188 http://dx.doi.org/10.3390/s20113170 Text en © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Le, Anh Vu
Parween, Rizuwana
Elara Mohan, Rajesh
Nhan, Nguyen Huu Khanh
Enjikalayil Abdulkader, Raihan
Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title_full Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title_fullStr Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title_full_unstemmed Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title_short Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
title_sort optimization complete area coverage by reconfigurable htrihex tiling robot
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7308827/
https://www.ncbi.nlm.nih.gov/pubmed/32503188
http://dx.doi.org/10.3390/s20113170
work_keys_str_mv AT leanhvu optimizationcompleteareacoveragebyreconfigurablehtrihextilingrobot
AT parweenrizuwana optimizationcompleteareacoveragebyreconfigurablehtrihextilingrobot
AT elaramohanrajesh optimizationcompleteareacoveragebyreconfigurablehtrihextilingrobot
AT nhannguyenhuukhanh optimizationcompleteareacoveragebyreconfigurablehtrihextilingrobot
AT enjikalayilabdulkaderraihan optimizationcompleteareacoveragebyreconfigurablehtrihextilingrobot