Next Article in Journal
Fully Automatic Landmarking of Syndromic 3D Facial Surface Scans Using 2D Images
Previous Article in Journal
Exploration of User’s Mental State Changes during Performing Brain–Computer Interface
Article

Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot

1
ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore
2
Optoelectronics Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(11), 3170; https://doi.org/10.3390/s20113170
Received: 14 April 2020 / Revised: 21 May 2020 / Accepted: 22 May 2020 / Published: 3 June 2020
(This article belongs to the Section Physical Sensors)
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. View Full-Text
Keywords: shapeshifting robot; tiling robotic; path planning; complete coverage; energy optimization shapeshifting robot; tiling robotic; path planning; complete coverage; energy optimization
Show Figures

Figure 1

MDPI and ACS Style

Le, A.V.; Parween, R.; Elara Mohan, R.; Nhan, N.H.K.; Enjikalayil Abdulkader, R. Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot. Sensors 2020, 20, 3170. https://doi.org/10.3390/s20113170

AMA Style

Le AV, Parween R, Elara Mohan R, Nhan NHK, Enjikalayil Abdulkader R. Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot. Sensors. 2020; 20(11):3170. https://doi.org/10.3390/s20113170

Chicago/Turabian Style

Le, Anh V., Rizuwana Parween, Rajesh Elara Mohan, Nguyen H.K. Nhan, and Raihan Enjikalayil Abdulkader. 2020. "Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot" Sensors 20, no. 11: 3170. https://doi.org/10.3390/s20113170

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop