Affiliation:
1. ROAR Lab, Engineering Product Development Pillar, Singapore University of Technology and Design (SUTD), Singapore 487372, Singapore
2. College of Engineering, Design and Computing, University of Colorado Denver, 1200 Larimer St, Ste. 3034, Denver, CO 80204, USA
Abstract
Reconfigurable robots design based on polyominos or n-Omino is increasingly being explored in cleaning and maintenance (CnM) tasks due to their ability to change shape using intra- and inter-reconfiguration, resulting in various footprints of the robot. On one hand, reconfiguration during a CnM task in a given environment or map results in enhanced area coverage over fixed-form robots. However, it also consumes more energy due to the additional effort required to continuously change shape while covering a given map, leading to a deterioration in overall performance. This paper proposes a new strategy for n-Omino-based robots to select a range of optimal morphologies that maximizes area coverage and minimizes energy consumption. The optimal “morphology” is based on two factors: the shape or footprint obtained by varying the angles between the n-Omino blocks and the number of n-Omino blocks, i.e., “n”. The proposed approach combines a Footprint-Based Complete coverage Path planner (FBCP) with a metaheuristic optimization algorithm to identify an n-Omino-based reconfigurable robot’s optimal configuration, assuming energy consumption is proportional to the path length taken by the robot. The proposed approach is demonstrated using an n-Omino-based robot named Smorphi, which has square-shaped omino blocks with holonomic locomotion and the ability to change from monomino to tetromino. Three different simulated environments are used to find the optimal morphologies of Smorphi using three metaheuristic optimization techniques, namely, MOEA/D, OMOPSO, and HypE. The results of the study show that the morphology produced by this approach is energy efficient, minimizing energy consumption and maximizing area coverage. Furthermore, the HypE algorithm is identified as more efficient for generating optimal morphology as it took less time to converge than the other two algorithms.
Funder
National Robotics Program under its Robotics Enabling Capabilities and Technologies
National Robotics Program under its Robot Domain Specific
National Robotics Program under its Robotics Domain Specific
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference51 articles.
1. An algorithm for the computer control of a flexible manufacturing system;Kimemia;AIIE Trans.,1983
2. Reconfigurable intelligent surfaces for N-LOS radar surveillance;Aubry;IEEE Trans. Veh. Technol.,2021
3. Reconfigurable antennas: Design and applications;Costantine;Proc. IEEE,2015
4. Configuration analysis of a reconfigurable Rubik’s snake robot;Liu;Proc. Inst. Mech. Eng. Part C J. Mech. Eng. Sci.,2019
5. Self-reconfigurable robots;Murata;IEEE Robot. Autom. Mag.,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献