Metaheuristic based navigation of a reconfigurable robot through narrow spaces with shape changing ability

• Published in: Expert systems with applications 2022-09, Vol.201, p.117060, Article 117060
• Main Authors: Samarakoon, S.M. Bhagya P., Muthugala, M.A. Viraj J., Elara, Mohan Rajesh
• Format: Article
• Language: English
• Subjects: Area coverage; Barriers; Cluster analysis; Collisions; Computing time; Genetic Algorithm; Genetic algorithms; Grey Wolf Optimizer; Heuristic methods; Navigation; New technology; Obstacle avoidance; Reconfigurable robotics; Reconfiguration; Robotics; Robots; Simulated Annealing
• ISSN: 0957-4174; 1873-6793
• DOI: 10.1016/j.eswa.2022.117060

Emerging technologies and robotics solutions for cleaning applications are rapidly progressing nowadays. Reconfigurable robots that can change shapes are introduced to overcome the limitations of fixed-shape robots. Reconfigurable robots should be capable of moving through narrow spaces with the help of continuous shape-changing to improve the coverage performance. In this regard, a reconfigurable robot requires perceiving the narrow spaces in between obstacles and generating the path to navigate. Most importantly, the robot should decide and change the shape configurations appropriately to move on that path without collisions. Furthermore, such a reconfiguration ability could be used for covering around obstacles. Therefore, this paper proposes a method to navigate a reconfigurable robot through narrow spaces or cover obstacles with the aid of continuous reconfiguration. In the first step, the method analyzes the obstacle clusters in a metric map to determine the appropriate paths to navigate. In the second step, a sequence of shapes for reconfiguration that allows the robot’s movement on the path without collisions is determined. Metaheuristics, Grey Wolf Optimizer (GWO), Genetic Algorithm (GA), and Simulated Annealing (SA), are proposed to determine the shape sequence. Simulations have been conducted to validate the performance and behavior of the proposed method. The results confirm that the developed method is effective for navigating a reconfigurable robot through narrow spaces or covering obstacles with continuous shape-changing. According to the statistical outcomes, GWO requires less computational time compared to GA and SA. •Area coverage is a crucial requirement for a floor cleaning robot.•A novel navigation strategy that considers continuous reconfigurations is proposed.•Metaheuristic optimization techniques are proposed for the navigation strategy.•The method enables a reconfigurable robot to navigate through narrow spaces.•The method facilitates the navigation around obstacles for coverage.