Evolutionary Algorithm-Based Complete Coverage Path Planning for Tetriamond Tiling Robots

Coverage Planning for UVC Irradiation: Robot Surface Disinfection Based on Swarm Intelligence Algorithm

Ultraviolet (UV) radiation has been widely utilized as a disinfection strategy to effectively eliminate various pathogens. The disinfection task achieves complete coverage of object surfaces by planning the motion trajectory of autonomous mobile robots and the UVC irradiation strategy. This introduces an additional layer of complexity to path planning, as every point on the surface of the object must receive a certain dose of irradiation. Nevertheless, the considerable dosage required for virus inactivation often leads to substantial energy consumption and dose redundancy in disinfection tasks, presenting challenges for the implementation of robots in large-scale environments. Optimizing energy consumption of light sources has become a primary concern in disinfection planning, particularly in large-scale settings. Addressing the inefficiencies associated with dosage redundancy, this study proposes a dose coverage planning framework, utilizing MOPSO to solve the multi-objective optimization model for planning UVC dose coverage. Diverging from conventional path planning methodologies, our approach prioritizes the intrinsic characteristics of dose accumulation, integrating a UVC light efficiency factor to mitigate dose redundancy with the aim of reducing energy expenditure and enhancing the efficiency of robotic disinfection. Empirical trials conducted with autonomous disinfecting robots in real-world settings have corroborated the efficacy of this model in deactivating viruses.

Autonomous navigation and collision prediction of port channel based on computer vision and lidar

This study aims to enhance the safety and efficiency of port navigation by reducing ship collision accidents, minimizing environmental risks, and optimizing waterways to increase port throughput. Initially, a three-dimensional map of the port's waterway, including data on water depth, rocks, and obstacles, is generated through laser radar scanning. Visual perception technology is adopted to process and identify the data for environmental awareness. Single Shot MultiBox Detector (SSD) is utilized to position ships and obstacles, while point cloud data create a comprehensive three-dimensional map. In order to improve the optimal navigation approach of the Rapidly-Exploring Random Tree (RRT), an artificial potential field method is employed. Additionally, the collision prediction model utilizes K-Means clustering to enhance the Faster R-CNN algorithm for predicting the paths of other ships and obstacles. The results indicate that the RRT enhanced by the artificial potential field method reduces the average path length (from 500 to 430 m), average time consumption (from 30 to 22 s), and maximum collision risk (from 15 to 8%). Moreover, the accuracy, recall rate, and F1 score of the K-Means + Faster R-CNN collision prediction model reach 92%, 88%, and 90%, respectively, outperforming other models. Overall, these findings underscore the substantial advantages of the proposed enhanced algorithm in autonomous navigation and collision prediction in port waterways.

Optimal selective floor cleaning using deep learning algorithms and reconfigurable robot hTetro

Floor cleaning robots are widely used in public places like food courts, hospitals, and malls to perform frequent cleaning tasks. However, frequent cleaning tasks adversely impact the robot’s performance and utilize more cleaning accessories (such as brush, scrubber, and mopping pad). This work proposes a novel selective area cleaning/spot cleaning framework for indoor floor cleaning robots using RGB-D vision sensor-based Closed Circuit Television (CCTV) network, deep learning algorithms, and an optimal complete waypoints path planning method. In this scheme, the robot will clean only dirty areas instead of the whole region. The selective area cleaning/spot cleaning region is identified based on the combination of two strategies: tracing the human traffic patterns and detecting stains and trash on the floor. Here, a deep Simple Online and Real-time Tracking (SORT) human tracking algorithm was used to trace the high human traffic region and Single Shot Detector (SSD) MobileNet object detection framework for detecting the dirty region. Further, optimal shortest waypoint coverage path planning using evolutionary-based optimization was incorporated to traverse the robot efficiently to the designated selective area cleaning/spot cleaning regions. The experimental results show that the SSD MobileNet algorithm scored 90% accuracy for stain and trash detection on the floor. Further, compared to conventional methods, the evolutionary-based optimization path planning scheme reduces 15% percent of navigation time and 10% percent of energy consumption.

A Fuzzy Logic Approach and Path Algorithm for Time and Energy Management of Smart Cleaning Robots

Smart home technologies (SHM) or devices provide some degree of digitally connected, automated, or enhanced services to building occupants in residential areas and have been becoming increasingly popular in recent years. SHM have the potential to improve home comfort, convenience, security and energy management. Different technologies are used to equip household parts for smarter monitoring, movement and remote control and to allow effective harmonic interaction between them. Especially, energy management and path-planning algorithms are some of the important problems for such technologies to get optimum efficiency and benefit. Smart vacuum cleaning robot is one of the applications of such devices with various functions. These cleaning robots have limited battery power and battery sizes, thus effective cleaning is critical. Additionally, the shortest / optimal path planning is essential for the efficient operation of effective cleaning based on the battery time. In this article, two distinct algorithms, which are Search algorithm and CSP algorithm are utilized to obtain distinct optimal minimum path lengths for keeping the home's total dirt level as low as possible. Depending on various types of linguistic, abstract, or perceptual variables, these algorithms are not enough for the energy management of the battery. Therefore, the fuzzy logic-based inference system is proposed for obtaining the charge durability of battery of the cleaning robot, in addition to these algorithms. The inputs affecting the charge durability are considered as floor type, dirt level and the width of area for the fuzzy approach.

Enhancing Robots Navigation in Internet of Things Indoor Systems

In this study, an effective local minima detection and definition algorithm is introduced for a mobile robot navigating through unknown static environments. Furthermore, five approaches are presented and compared with the popular approach wall-following to pull the robot out of the local minima enclosure namely; Random Virtual Target, Reflected Virtual Target, Global Path Backtracking, Half Path Backtracking, and Local Path Backtracking. The proposed approaches mainly depend on changing the target location temporarily to avoid the original target’s attraction force effect on the robot. Moreover, to avoid getting trapped in the same location, a virtual obstacle is placed to cover the local minima enclosure. To include the most common shapes of deadlock situations, the proposed approaches were evaluated in four different environments; V-shaped, double U-shaped, C-shaped, and cluttered environments. The results reveal that the robot, using any of the proposed approaches, requires fewer steps to reach the destination, ranging from 59 to 73 m on average, as opposed to the wall-following strategy, which requires an average of 732 m. On average, the robot with a constant speed and reflected virtual target approach takes 103 s, whereas the identical robot with a wall-following approach takes 907 s to complete the tasks. Using a fuzzy-speed robot, the duration for the wall-following approach is greatly reduced to 507 s, while the reflected virtual target may only need up to 20% of that time. More results and detailed comparisons are embedded in the subsequent sections.

A Consolidated Review of Path Planning and Optimization Techniques: Technical Perspectives and Future Directions

In this paper, a review on the three most important communication techniques (ground, aerial, and underwater vehicles) has been presented that throws light on trajectory planning, its optimization, and various issues in a summarized way. This kind of extensive research is not often seen in the literature, so an effort has been made for readers interested in path planning to fill the gap. Moreover, optimization techniques suitable for implementing ground, aerial, and underwater vehicles are also a part of this review. This paper covers the numerical, bio-inspired techniques and their hybridization with each other for each of the dimensions mentioned. The paper provides a consolidated platform, where plenty of available research on-ground autonomous vehicle and their trajectory optimization with the extension for aerial and underwater vehicles are documented.

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.

Collaborative Complete Coverage and Path Planning for Multi-Robot Exploration

In mobile robotics research, the exploration of unknown environments has always been an important topic due to its practical uses in consumer and military applications. One specific interest of recent investigation is the field of complete coverage and path planning (CCPP) techniques for mobile robot navigation. In this paper, we present a collaborative CCPP algorithms for single robot and multi-robot systems. The incremental coverage from the robot movement is maximized by evaluating a new cost function. A goal selection function is then designed to facilitate the collaborative exploration for a multi-robot system. By considering the local gains from the individual robots as well as the global gain by the goal selection, the proposed method is able to optimize the overall coverage efficiency. In the experiments, our CCPP algorithms are carried out on various unknown and complex environment maps. The simulation results and performance evaluation demonstrate the effectiveness of the proposed collaborative CCPP technique.

Neural dynamics based complete grid coverage by single and multiple mobile robots

Navigation of mobile robots in a grid based environment is useful in applications like warehouse automation. The environment comprises of a number of free grid cells for navigation and remaining grid cells are occupied by obstacles and/or other mobile robots. Such obstructions impose situations of collisions and dead-end. In this work, a neural dynamics based algorithm is proposed for complete coverage of a grid based environment while addressing collision avoidance and dead-end situations. The relative heading of the mobile robot with respect to the neighbouring grid cells is considered to calculate the neural activity. Moreover, diagonal movement of the mobile robot through inter grid cells is restricted to ensure safety from the collision with obstacles and other mobile robots. The circumstances where the proposed algorithm will fail to provide completeness are also discussed along with the possible ways to overcome those situations. Simulation results are presented to show the effectiveness of the proposed algorithm for a single and multiple mobile robots. Moreover, comparative studies illustrate improvements over other algorithms on collision free effective path planning of mobile robots within a grid based environment.

Coverage Path Planning Using Reinforcement Learning-Based TSP for hTetran-A Polyabolo-Inspired Self-Reconfigurable Tiling Robot

One of the critical challenges in deploying the cleaning robots is the completion of covering the entire area. Current tiling robots for area coverage have fixed forms and are limited to cleaning only certain areas. The reconfigurable system is the creative answer to such an optimal coverage problem. The tiling robot's goal enables the complete coverage of the entire area by reconfiguring to different shapes according to the area's needs. In the particular sequencing of navigation, it is essential to have a structure that allows the robot to extend the coverage range while saving energy usage during navigation. This implies that the robot is able to cover larger areas entirely with the least required actions. This paper presents a complete path planning (CPP) for hTetran, a polyabolo tiled robot, based on a TSP-based reinforcement learning optimization. This structure simultaneously produces robot shapes and sequential trajectories whilst maximizing the reward of the trained reinforcement learning (RL) model within the predefined polyabolo-based tileset. To this end, a reinforcement learning-based travel sales problem (TSP) with proximal policy optimization (PPO) algorithm was trained using the complementary learning computation of the TSP sequencing. The reconstructive results of the proposed RL-TSP-based CPP for hTetran were compared in terms of energy and time spent with the conventional tiled hypothetical models that incorporate TSP solved through an evolutionary based ant colony optimization (ACO) approach. The CPP demonstrates an ability to generate an ideal Pareto optima trajectory that enhances the robot's navigation inside the real environment with the least energy and time spent in the company of conventional techniques.

Locomotion with Pedestrian Aware from Perception Sensor by Pavement Sweeping Reconfigurable Robot

Regular washing of public pavements is necessary to ensure that the public environment is sanitary for social activities. This is a challenge for autonomous cleaning robots, as they must adapt to the environment with varying pavement widths while avoiding pedestrians. A self-reconfigurable pavement sweeping robot, named Panthera, has the mechanisms to perform reconfiguration in width to enable smooth cleaning operations, and it changes its behavior based on environment dynamics of moving pedestrians and changing pavement widths. Reconfiguration in the robot’s width is possible, due to the scissor mechanism at the core of the robot’s body, which is driven by a lead screw motor. Panthera will perform locomotion and reconfiguration based on perception sensors feedback control proposed while using an Red Green Blue-D (RGB-D) camera. The proposed control scheme involves publishing robot kinematic parameters for reconfiguration during locomotion. Experiments were conducted in outdoor pavements to demonstrate the autonomous reconfiguration during locomotion to avoid pedestrians while complying with varying pavements widths in a real-world scenario.

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 Self-Organizing Fuzzy Logic Classifier for Benchmarking Robot-Aided Blasting of Ship Hulls

Regular dry dock maintenance work on ship hulls is essential for maintaining the efficiency and sustainability of the shipping industry. Hydro blasting is one of the major processes of dry dock maintenance work, where human labor is extensively used. The conventional methods of maintenance work suffer from many shortcomings, and hence robotized solutions have been developed. This paper proposes a novel robotic system that can synthesize a benchmarking map for a previously blasted ship hull. A Self-Organizing Fuzzy logic (SOF) classifier has been developed to benchmark the blasting quality of a ship hull similar to blasting quality categorization done by human experts. Hornbill, a multipurpose inspection and maintenance robot intended for hydro blasting, benchmarking, and painting, has been developed by integrating the proposed SOF classifier. Moreover, an integrated system solution has been developed to improve dry dock maintenance of ship hulls. The proposed SOF classifier can achieve a mean accuracy of 0.9942 with an execution time of 8.42 μ s. Realtime experimenting with the proposed robotic system has been conducted on a ship hull. This experiment confirms the ability of the proposed robotic system in synthesizing a benchmarking map that reveals the benchmarking quality of different areas of a previously blasted ship hull. This sort of a benchmarking map would be useful for ensuring the blasting quality as well as performing efficient spot wise reblasting before the painting. Therefore, the proposed robotic system could be utilized for improving the efficiency and quality of hydro blasting work on the ship hull maintenance industry.

Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot

Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map areas with flexible sizes and to access the narrow space constraints. By dividing the map into sub-areas with the same size as the changeable robot shapes, the robot can plan the optimal movement to predetermined locations, transform its morphologies to cover the specific area, and ensure that the map is completely covered. The optimal navigation planning problem, including the least changing shape, shortest travel distance, and the lowest travel time while ensuring complete coverage of the map area, are solved in this paper. To this end, we propose the CACP framework for a tiling robot called hTrihex with three honeycomb shape modules. The robot can shift its shape into three different morphologies ensuring coverage of the map with a predetermined size. However, the ability to change shape also raises the complexity issues of the moving mechanisms. Therefore, the process of optimizing trajectories of the complete coverage is modeled according to the Traveling Salesman Problem (TSP) problem and solved by evolutionary approaches Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Hence, the costweight to clear a pair of waypoints in the TSP is defined as the required energy shift the robot between the two locations. This energy corresponds to the three operating processes of the hTrihex robot: transformation, translation, and orientation correction. The CACP framework is verified both in the simulation environment and in the real environment. From the experimental results, proposed CACP capable of generating the Pareto-optimal outcome that navigates the robot from the goal to destination in various workspaces, and the algorithm could be adopted to other tiling robot platforms with multiple configurations.

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.