Multi-Objective Genetic Algorithm-Based Autonomous Path Planning for Hinged-Tetro Reconfigurable Tiling Robot

Abstract

Reconfigurable robots have received broad research interest due to the high dexterity they provide and the complex actions they could perform. Robots with reconfigurability are perfect candidates in tasks like exploration or rescue missions in environments with complicated obstacle layout or with dynamic obstacles. However, the automation of reconfigurable robots is more challenging than fix-shaped robots due to the increased possible combinations of robot actions and the navigation difficulty in obstaclerich environments. This paper develops a systematic strategy to construct a model of hinged-Tetromino (hTetro) reconfigurable robot in the workspace and proposes a genetic algorithm-based method (hTetro-GA) to achieve path planning for hTetro robots. The proposed algorithm considers hTetro path planning as a multi-objective optimization problem and evaluates the performance of the outcome based on four customized fitness objective functions. In this work, the proposed hTetro-GA is tested in six virtual environments with various obstacle layouts and characteristics and with different population sizes. The algorithm generates Pareto-optimal solutions that achieve desire robot configurations in these settings, with O-shaped and I-shaped morphologies being the more efficient configurations selected from the genetic algorithm. The proposed algorithm is implemented and tested on real hTetro platform, and the framework of this work could be adopted to other robot platforms with multiple configurations to perform multi-objective based path planning. INDEX TERMS Reconfigurable robot, Tiling robotics, Multi-objective path planning, Genetic algorithm, NSGA-II.

Robotic Pick-and-Place Time Optimization: Application to Footwear Production

“…In [19], [20] and [21] a similar problem is solved with a greedy search algorithm and convex optimization approaches. A solution can be presented by solving the optimal time problem as presented in [22] based on the travelling salesman problem (TSP) with a genetic algorithm studied in [23], [24] and [25]. Another research such as [26] studies the use of decision trees in planning optimal time trajectories.…”

Social Density Monitoring Toward Selective Cleaning by Human Support Robot With 3D Based Perception System

“…Robotics and several other autonomous technologies in AGV vehicles have made great strides in fighting the COVID-19 pandemic [22], [23]. The service robot uses the AI-assisted technology to deliver the medicine to covid 19 patients, safe entry checkin body temperature measurement, sanitize the infected area, frequent cleaning of high touchpoints like hospital walls, floor, and door handle [24], [25], [16]. Hence, by considering the advantage of service robots and AI-assisted technology, as well as the flexible navigation in the vast and complex environments such as shopping mall, food court, wet market, resents robot system gradually replace human in the tedious jobs.…”

Coverage Path Planning for Decomposition Reconfigurable Grid-Maps Using Deep Reinforcement Learning Based Travelling Salesman Problem

“…The algorithm is nonoverlapping if the robot does not cover the previously covered area. The total operational energy and time required for coverage, computation cost, and completeness determine the robustness of a CPP algorithm [12]. An efficient and optimal path generation algorithm needs to satisfy all the mentioned criteria simultaneously.…”