Modeling and Analysis of hHoneycomb—A Polyhex Inspired Reconfigurable Tiling Robot

Modelling and Control of a Reconfigurable Robot for Achieving Reconfiguration and Locomotion with Different Shapes

Area coverage is a crucial factor for a robot intended for applications such as floor cleaning, disinfection, and inspection. Robots with fixed shapes could not realize an adequate level of area coverage performance. Reconfigurable robots have been introduced to overcome the limitations of fixed-shape robots, such as accessing narrow spaces and cover obstacles. Although state-of-the-art reconfigurable robots used for coverage applications are capable of shape-changing for improving the area coverage, the reconfiguration is limited to a few predefined shapes. It has been proven that the ability of reconfiguration beyond a few shapes can significantly improve the area coverage performance of a reconfigurable robot. In this regard, this paper proposes a novel robot model and a low-level controller that can facilitate the reconfiguration beyond a small set of predefined shapes and locomotion per instructions while firmly maintaining the shape. A prototype of a robot that facilitates the aim mentioned above has been designed and developed. The proposed robot model and controller have been integrated into the prototype, and experiments have been conducted considering various reconfiguration and locomotion scenarios. Experimental results confirm the validity of the proposed model and controller during reconfiguration and locomotion of the robot. Moreover, the applicability of the proposed model and controller for achieving high-level autonomous capabilities has been proven.

Reinforcement Learning-Based Complete Area Coverage Path Planning for a Modified hTrihex Robot

One of the essential attributes of a cleaning robot is to achieve complete area coverage. Current commercial indoor cleaning robots have fixed morphology and are restricted to clean only specific areas in a house. The results of maximum area coverage are sub-optimal in this case. Tiling robots are innovative solutions for such a coverage problem. These new kinds of robots can be deployed in the cases of cleaning, painting, maintenance, and inspection, which require complete area coverage. Tiling robots’ objective is to cover the entire area by reconfiguring to different shapes as per the area requirements. In this context, it is vital to have a framework that enables the robot to maximize the area coverage while minimizing energy consumption. That means it is necessary for the robot to cover the maximum area with the least number of shape reconfigurations possible. The current paper proposes a complete area coverage planning module for the modified hTrihex, a honeycomb-shaped tiling robot, based on the deep reinforcement learning technique. This framework simultaneously generates the tiling shapes and the trajectory with minimum overall cost. In this regard, a convolutional neural network (CNN) with long short term memory (LSTM) layer was trained using the actor-critic experience replay (ACER) reinforcement learning algorithm. The simulation results obtained from the current implementation were compared against the results that were generated through traditional tiling theory models that included zigzag, spiral, and greedy search schemes. The model presented in the current paper was also compared against other methods where this problem was considered as a traveling salesman problem (TSP) solved through genetic algorithm (GA) and ant colony optimization (ACO) approaches. Our proposed scheme generates a path with a minimized cost at a lesser time.

Toward complete area coverage of a reconfigurable tiling robot by following obstacle shape

Complete area coverage is a crucial factor for a floor cleaning robot. Self-reconfigurable tiling robots have been introduced over robots with a fixed shape for floor cleaning since they improve the area coverage by the flexibility of shape-shifting in cluttered environments. The existing coverage methods of reconfigurable tiling robots follow the tiling theory to cope with the area coverage problem. However, these methods merely consider a limited set of predefined shapes for the reconfiguration of a robot. The consideration of a limited set of predefined shapes for the reconfiguration impedes the ability of coverage to a certain extent in typical floor environments. Therefore, this paper proposes a novel method to improve area coverage of a tiling robot by reconfiguring according to the shape of obstacles. To this end, the required hinge angles for reconfiguring per the shape of an obstacle are determined by a genetic algorithm. The proposed method considers an optimized shape for reconfiguration in lieu of a limited set of predefined shapes. The coverage improvement of the proposed concept has been compared against the existing coverage methods of tiling robots to validate the performance. According to the experimental results, the proposed method surpasses the existing coverage methods of tiling robots from the perspective of area coverage, and the improvement is significant and noteworthy.

A Path Tracking Strategy for Car Like Robots with Sensor Unpredictability and Measurement Errors

This work is inspired by motion control of cleaning robots, operating in certain endogenous environments, and performing various tasks like door cleaning, wall sanitizing, etc. The base platform's motion for these robots is generally similar to the motion of four-wheel cars. Most of the cleaning and maintenance tasks require detection, path planning, and control. The motion controller's job is to ensure the robot follows the desired path or a set of points, pre-decided by the path planner. This control loop generally requires some feedback from the on-board sensors, and odometry modules, to compute the necessary velocity inputs for the wheels. As the sensors and odometry modules are prone to environmental noise, dead-reckoning errors, and calibration errors, the control input may not provide satisfactory performance in a closed-loop. This paper develops a robust-observer based sliding mode controller to fulfill the motion control task in the presence of incomplete state measurements and sensor inaccuracies. A robust intrinsic observer design is proposed to estimate the input matrix, which is used for dynamic feedback linearization. The resulting uncertain dynamics are then stabilized through a sliding mode controller. The proposed robust-observer based sliding mode technique assures asymptotic trajectory tracking in the presence of measurement uncertainties. Lyapunov based stability analysis is used to guarantee the convergence of the closed-loop system, and the proposed strategy is successfully validated through numerical simulations.

A Vertex-Aligned Model for Packing 4-Hexagonal Clusters in a Regular Hexagonal Container

This paper deals with a problem the packing polyhex clusters in a regular hexagonal container. It is a common problem in many applications with various cluster shapes used, but symmetric polyhex is the most useful in engineering due to its geometrical properties. Hence, we concentrate on mathematical modeling in such an application, where using the “bee” tetrahex is chosen for the new Compact Muon Solenoid (CMS) design upgrade, which is one of four detectors used in Large Hadron Collider (LHC) experiment at European Laboratory for Particle Physics (CERN). We start from the existing hexagonal containers with hexagonal cells packed inside, and uniform clustering applied. We compare the center-aligned (CA) and vertex-aligned (VA) models, analyzing cluster rotations providing the increased packing efficiency. We formally describe the geometrical properties of clustering approaches and show that cluster sharing is inevitable at the container border with uniform clustering. In addition, we propose a new vertex-aligned model decreasing the number of shared clusters in the uniform scenario, but with a smaller number of clusters contained inside the container. Also, we describe a non-uniform tetrahex cluster packing scheme in the proposed container model. With the proposed cluster packing solution, it is accomplished that all clusters are contained inside the container region. Since cluster-sharing is completely avoided at the container border, the maximal packing efficiency is obtained compared to the existing models.