Coverage Path Planning Using Reinforcement Learning-Based TSP for hTetran—A Polyabolo-Inspired Self-Reconfigurable Tiling Robot

Research focuses on robots related to area coverage applications such as cleaning, painting, demining, lawn moving, and inspection is gaining significant momentum in recent years. The majority of such research platforms faces significant performance issues while accessing narrow and constrained spaces due to their fixed morphology. To this end, we have developed a novel self-reconfigurable robot platform named as “hTetran” inspired from Polyabolo which can change its morphology to any of the six tetrabolo shapes with an objective of maximizing the area coverage. This paper presents the system design, reconfiguration theory, and locomotion modules of the developed robot, including the adaptation of Polyabolo tiling theory as a coverage path planning strategy for autonomous navigation. The paper concludes with a set of experiments in a mocked office room setup that validates the efficiency of the proposed robot in terms of area coverage. Our experimental trials indicate that the “hTetran” brings out a higher area coverage performance in all considered experimental cases.

[1]  Mark H. Yim,et al.  Self-Reconfigurable Robot Systems: PolyBot (特集 モジュラーロボット) , 2003 .

[2]  Chun-Liang Lin,et al.  Design of an autonomous lawn mower with optimal route planning , 2008, 2008 IEEE International Conference on Industrial Technology.

[3]  Nicolás Rojas,et al.  Hinged-Tetro: A self-reconfigurable module for nested reconfiguration , 2014, 2014 IEEE/ASME International Conference on Advanced Intelligent Mechatronics.

[4]  David Eppstein,et al.  Hinged dissections of polyominoes and polyforms , 1999, CCCG.

[5]  Taj Mohammad Baloch,et al.  Design and modelling a prototype of a robotic lawn mower , 2008, 2008 International Symposium on Information Technology.

[6]  Shiqiang Zhu,et al.  Combined coverage path planning for autonomous cleaning robots in unstructured environments , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[7]  Reza Sarhangi Making Patterns on the Surfaces of Swing-Hinged Dissections , 2008 .

[8]  Kian Hsiang Low,et al.  Adaptive multi-robot wide-area exploration and mapping , 2008, AAMAS.

[9]  Erik D. Demaine,et al.  Hinged Dissection of Polygons is Hard , 2003, CCCG.

[10]  Yoshiyasu Takefuji,et al.  A parallel algorithm for tiling problems , 1990, IEEE Trans. Neural Networks.

[11]  Hidenori Ishihara,et al.  Mechanisms and basic properties of window cleaning robot , 2003, Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003).

[12]  Ryan M. Eustice,et al.  Active visual SLAM for robotic area coverage: Theory and experiment , 2015, Int. J. Robotics Res..

[13]  Vinu Sivanantham,et al.  Application of Tiling Theory for Path Planning Strategy in a Polyiamond Inspired Reconfigurable Robot , 2019, IEEE Access.

[14]  Erik D. Demaine,et al.  Hinged Dissection of Polypolyhedra , 2005, WADS.

[15]  Yan Wang,et al.  A floor cleaning robot using Swedish wheels , 2007, 2007 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[16]  Mark Moll,et al.  SUPERBOT: A Deployable, Multi-Functional, and Modular Self-Reconfigurable Robotic System , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[18]  Thejus Pathmakumar,et al.  hTetro: A tetris inspired shape shifting floor cleaning robot , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[19]  Rajesh Elara Mohan,et al.  Design principles for robot inclusive spaces: A case study with Roomba , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[20]  Ricardo Sosa,et al.  Nested Reconfigurable Robots: Theory, Design, and Realization , 2015 .