During a viral outbreak, such as COVID-19, autonomously operated robots are in high demand. Robots effectively improve the environmental concerns of contaminated surfaces in public spaces, such as airports, public transport areas and hospitals, that are considered high-risk areas. Indoor spaces walls made up most of the indoor areas in these public spaces and can be easily contaminated. Wall cleaning and disinfection processes are therefore critical for managing and mitigating the spread of viruses. Consequently, wall cleaning robots are preferred to address the demands. A wall cleaning robot needs to maintain a close and consistent distance away from a given wall during cleaning and disinfection processes. In this paper, a reconfigurable wall cleaning robot with autonomous wall following ability is proposed. The robot platform, Wasp, possess inter-reconfigurability, which enables it to be physically reconfigured into a wall-cleaning robot. The wall following ability has been implemented using a Fuzzy Logic System (FLS). The design of the robot and the FLS are presented in the paper. The platform and the FLS are tested and validated in several test cases. The experimental outcomes validate the real-world applicability of the proposed wall following method for a wall cleaning robot.

Complete area-coverage path planners are essential for robots performing tasks like cleaning, inspection, and surveying. However, they often involve complex calculations, mapping, and determining movement directions, leading to high computational or processing overheads and the risk of deadlocks. This paper proposes an approach for cleaning, i.e., by linear wiping of generic and discontinuous surfaces in hospital settings using inhouse assembled mobile dual-arm (MDA) robotic system. The proposed framework introduces key features: (a) a less resource-intensive approach for MDA positioning and cleaning surface mapping, (b) Modified Glasius Bioinspired Neural Network through use of heuristics (GBNN+H) to optimize surface linear wiping while obstacle avoidance, and traversal across discontinuous surfaces. The advantages of the proposed algorithm are highlighted in simulation with GBNN+H significantly reduces the number of steps and flight time required for complete coverage compared to existing algorithms. The proposed framework is also experimentally demonstrated in a hospital setting, paving the way for improved automation in cleaning and disinfection tasks. Overall, this work presents a generic and versatile, applicable to various surface orientations and complexities.

In reconfigurable robotics, intra-reconfiguration enables a robot to change its functional abilities, while inter-reconfiguration manipulates the specification limits of the robot hardware. Although the versatility of inter-reconfigurable robots is desired in advanced autonomous systems, the O(n $^{3})$ algorithm computational time complexity challenge comes when multiple modular robots combine and reconfigure into a bigger form structure for autonomous navigation tasks. This phenomenon has limited the inter-reconfiguration potential of expansion, versatility, and robustness. In this paper, a navigation framework with non-complex transformation states is proposed for inter-reconfigurable robots to perform combining and splitting control dimensions. Simulations have shown the complexity from O(n) to constant time O(1) in the reconfiguration states of the framework on a considerable number of robot agents. Additionally, a set of inter-reconfigurable robots, Wasp Biggie, was used to demonstrate the proof-of-concept in experiments as a fully functional centralized planner system. These experiments showed outperforming results on the consistent utility of CPU consumption while performing navigation and reconfiguration. Note to Practitioners —This study aims to provide controls for combining multiple robots into a single system. The research study enables the robots in the system to vary and manipulate their physical structure and mechanism limitations. Onboard computation resources are often finite and incapable of computing for multiple functions that are actively in demand. Hence, this paper is motivated by the severe increase in computational demands common in a multi-robot centralized system. The paper has provided the technical details of the system architecture of the state machine and how it integrates with a typical navigation stack. The state-machine of the framework can be easily constructed using the SMACH package in the Robot Operating System and integrated by reconstruction of the navigation stack by providing the command velocity as an input and producing the transformed command velocity for the controls of the respective robots. The outcome of the paper provides a method of control in inter-reconfigurability and takes in a consistent amount of computational resources as the number of robots varies in utilization.

Recent advancements in autonomous mobile robots have led to significant progress in area coverage tasks. However, challenges persist in optimizing the efficiency and computational complexity of complete coverage path planner (CCPP) algorithms for multi-robot systems, particularly in scenarios requiring revisiting or a double pass in specific locations, such as cleaning robots addressing spilled consumables. This paper presents an innovative approach to tackling the double-pass complete coverage problem using an autonomous inter-reconfigurable robot path planner. Our solution leverages a modified Glasius bio-inspired neural network (GBNN) to facilitate double-pass coverage through inter-reconfiguration between two robots. We compare our proposed algorithm with traditional multi-robot path planning in a centralized system, demonstrating a reduction in algorithm iterations and computation time. Our experimental results underscore the efficacy of the proposed solution in enhancing the efficiency of area coverage tasks. Furthermore, we discuss the implementation details and limitations of our study, providing insights for future research directions in autonomous robotics.