Next Article in Journal
Machine-Learning-Based Side-Channel Evaluation of Elliptic-Curve Cryptographic FPGA Processor
Next Article in Special Issue
Tarantula: Design, Modeling, and Kinematic Identification of a Quadruped Wheeled Robot
Previous Article in Journal
Dynamic Measurement Error Modeling and Analysis in a Photoelectric Scanning Measurement Network
Previous Article in Special Issue
Design and Experimental Evaluation of a Single-Actuator Continuous Hopping Robot Using the Geared Symmetric Multi-Bar Mechanism
Open AccessArticle

Multi-Criteria Decision Making for Efficient Tiling Path Planning in a Tetris-Inspired Self-Reconfigurable Cleaning Robot

1
Engineering Production and Development Pillar, Singapore University of Technology and Design, Singapore 487372, Singapore
2
College of Engineering Guindy, Anna University, Chennai 600025, India
*
Author to whom correspondence should be addressed.
Appl. Sci. 2019, 9(1), 63; https://doi.org/10.3390/app9010063
Received: 26 September 2018 / Revised: 20 December 2018 / Accepted: 21 December 2018 / Published: 25 December 2018
(This article belongs to the Special Issue Advanced Mobile Robotics)
In this study, we aim to optimize and improve the efficiency of a Tetris-inspired reconfigurable cleaning robot. Multi-criteria decision making (MCDM) is utilized as a powerful tool to target this aim by introducing the best solution among others in terms of lower energy consumption and greater area coverage. Regarding the Tetris-inspired structure, polyomino tiling theory is utilized to generate tiling path-planning maps which are evaluated via MCDM to seek a solution that can deliver the best balance between the two mentioned key issues; energy and area coverage. In order to obtain a tiling area that better meets the requirements of polyomino tiling theorems, first, the whole area is decomposed into five smaller sub-areas based on furniture layout. Afterward, four tetromino tiling theorems are applied to each sub-area to give the tiling sets that govern the robot navigation strategy in terms of shape-shifting tiles. Then, the area coverage and energy consumption are calculated and eventually, these key values are considered as the decision criteria in a MCDM process to select the best tiling set in each sub-area, and following the aggregation of best tiling path-plannings, the robot navigation is oriented towards efficiency and improved optimality. Also, for each sub-area, a preference order for the tiling sets is put forward. Based on simulation results, the tiling theorem that can best serve all sub-areas turns out to be the same. Moreover, a comparison between a fixed-morphology mechanism with the current approach further advocates the proposed technique. View Full-Text
Keywords: self-reconfigurable robot; cleaning robot; Tetris-inspired; polyomino tiling theory; coverage path planning; area decomposition; multi-criteria decision making self-reconfigurable robot; cleaning robot; Tetris-inspired; polyomino tiling theory; coverage path planning; area decomposition; multi-criteria decision making
Show Figures

Figure 1

MDPI and ACS Style

Kouzehgar, M.; Rajesh Elara, M.; Ann Philip, M.; Arunmozhi, M.; Prabakaran, V. Multi-Criteria Decision Making for Efficient Tiling Path Planning in a Tetris-Inspired Self-Reconfigurable Cleaning Robot. Appl. Sci. 2019, 9, 63.

Show more citation formats Show less citations formats
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
Search more from Scilit
 
Search
Back to TopTop