Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor

• Published in: Sensors (Basel, Switzerland) Vol. 18; no. 8; p. 2585
• Main Authors: Le, Anh, Prabakaran, Veerajagadheswar, Sivanantham, Vinu, Mohan, Rajesh
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI AG 07.08.2018; MDPI
• Subjects: area coverage; feature mapping; floor cleaning robot; path planning; Planning; Product design; reconfigurable mechanism; Robots; feature mapping; path planning; reconfigurable mechanism; area coverage; floor cleaning robot
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s18082585

Advancing an efficient coverage path planning in robots set up for application such as cleaning, painting and mining are becoming more crucial. Such drive in the coverage path planning field proposes numerous techniques over the past few decades. However, the proposed approaches were only applied and tested with a fixed morphological robot in which the coverage performance was significantly degraded in a complex environment. To this end, an A-star based zigzag global planner for a novel self-reconfigurable Tetris inspired cleaning robot (hTetro) presented in this paper. Unlike the traditional A-star algorithm, the presented approach can generate waypoints in order to cover the narrow spaces while assuming appropriate morphology of the hTtero robot with the objective of maximizing the coverage area. We validated the efficiency of the proposed planning approach in the Robot Operation System (ROS) Based simulated environment and tested with the hTetro robot in real-time under the controlled scenarios. Our experiments demonstrate the efficiency of the proposed coverage path planning approach resulting in superior area coverage performance in all considered experimental scenarios.