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

摘要

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 obstacle-rich 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.