Evolutionary Algorithm-Based Complete Coverage Path Planning for Tetriamond Tiling Robots

Tiling robots with fixed morphology face major challenges in terms of covering the cleaning area and generating the optimal trajectory during navigation. Developing a self-reconfigurable autonomous robot is a probable solution to these issues, as it adapts various forms and accesses narrow spaces during navigation. The total navigation energy includes the energy expenditure during locomotion and the shape-shifting of the platform. Thus, during motion planning, the optimal navigation sequence of a self-reconfigurable robot must include the components of the navigation energy and the area coverage. This paper addresses the framework to generate an optimal navigation path for reconfigurable cleaning robots made of tetriamonds. During formulation, the cleaning environment is filled with various tiling patterns of the tetriamond-based robot, and each tiling pattern is addressed by a waypoint. The objective is to minimize the amount of shape-shifting needed to fill the workspace. The energy cost function is formulated based on the travel distance between waypoints, which considers the platform locomotion inside the workspace. The objective function is optimized based on evolutionary algorithms such as the genetic algorithm (GA) and ant colony optimization (ACO) of the traveling salesman problem (TSP) and estimates the shortest path that connects all waypoints. The proposed path planning technique can be extended to other polyamond-based reconfigurable robots.

[1]  Rajesh Elara Mohan,et al.  Graph Theory-Based Approach to Accomplish Complete Coverage Path Planning Tasks for Reconfigurable Robots , 2019, IEEE Access.

[2]  Howie Choset,et al.  Morse Decompositions for Coverage Tasks , 2002, Int. J. Robotics Res..

[3]  Zixing Cai,et al.  Topological Mapping and Navigation for Mobile Robots with Landmark Evaluation , 2009, 2009 International Conference on Information Engineering and Computer Science.

[4]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

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

[6]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Chaomin Luo,et al.  A real-time cooperative sweeping strategy for multiple cleaning robots , 2002, Proceedings of the IEEE Internatinal Symposium on Intelligent Control.

[8]  Vijay Kumar,et al.  Time-optimal UAV trajectory planning for 3D urban structure coverage , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[10]  S.X. Yang,et al.  A neural network approach to complete coverage path planning , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  Rajesh Elara Mohan,et al.  Complete Path Planning for a Tetris-Inspired Self-Reconfigurable Robot by the Genetic Algorithm of the Traveling Salesman Problem , 2018 .

[12]  Jian Jin,et al.  Coverage path planning on three‐dimensional terrain for arable farming , 2011, J. Field Robotics.

[13]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[14]  Ling Xu,et al.  Graph Planning for Environmental Coverage , 2011 .

[15]  Chunxia Zhao,et al.  Lidar Scan-Matching for Mobile Robot Localization , 2010 .

[16]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[17]  Pierre Dillenbourg,et al.  Living with a Vacuum Cleaning Robot , 2013, Int. J. Soc. Robotics.

[18]  Tobias Edwards,et al.  A Comparison of Path Planning Algorithms for Robotic Vacuum Cleaners , 2018 .

[19]  Rajesh Elara Mohan,et al.  Realization Energy Optimization of Complete Path Planning in Differential Drive Based Self-Reconfigurable Floor Cleaning Robot , 2019 .

[20]  Rajesh Elara Mohan,et al.  Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor , 2018, Sensors.

[21]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[22]  Elon Rimon,et al.  Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[23]  Vladimir J. Lumelsky,et al.  Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..

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

[25]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .