Abstract
The reliability and robustness of cyber-physical systems (CPS) are critical aspects of the current industrial landscape. The high level of autonomous and distributed components associated with a large number of devices makes CPS prone to faults. Despite their importance and benefits, traditional fault tolerance methodologies, namely local and/or centralized, often overlook the potential benefits of collaboration between cyber-physical components. This paper introduces a collaborative fault diagnosis methodology for CPS, integrating self-fault diagnosis capabilities in agents and leveraging collaborative behavior to enhance fault diagnosis. The contribution of this paper relay in propose a methodology for fault diagnosis for CPS, based on multi-agent system (MAS) technology as a backbone of infra-structure, highlighting the components, agent behavior, functionalities, and interaction protocols, to explore the benefits of communication and collaboration between agents. The proposed methodology enhance the accuracy of fault diagnosis when compared with local approach. A case study was conducted in a laboratory-scale warehouse, focusing on diagnosing drift, bias, and precision faults in temperature and humidity sensors. Experimental results reveal that the collaborative methodology significantly outperforms the local approach in fault diagnosis, as evidenced by performance improvements in diagnosis classification. The statistical significance of these results was validated using the Wilcoxon signed-ranks test for paired samples. © 2013 IEEE.

Abstract
Multi-robot coordination aims to synchronize robots for optimized, collision-free paths in shared environments, addressing task allocation, collision avoidance, and path planning challenges. The Time Enhanced A* (TEA*) algorithm addresses multi-robot pathfinding offering a centralized and sequential approach. However, its sequential nature can lead to order-dependent variability in solutions. This study enhances TEA* through multi-threading, using thread pooling and parallelization techniques via OpenMP, and a sensitivity analysis enabling parallel exploration of robot-solving orders to improve robustness and the likelihood of finding efficient, feasible paths in complex environments. The results show that this approach improved coordination efficiency, reducing replanning needs and simulation time. Additionally, the sensitivity analysis assesses TEA*'s scalability across various graph sizes and number of robots, providing insights into how these factors influence the efficiency and performance of the algorithm.

Abstract
Rising industrial complexity demands efficient mobile robots to drive automation and productivity. Effective navigation relies on perception, localization, mapping, path planning, and motion control, with path planning being key. The Time Enhanced A* (TEA*) algorithm extends A* by adding time as a dimension to resolve temporal conflicts in multi-robot coordination. However, inconsistencies in edge lengths within the graph can hinder optimal path calculation. To address this, a Graph Decomposition submodule was developed to standardize edge lengths and temporal costs. Integrated into a ROS-based fleet coordination system, this approach significantly reduces execution time and improves coordination capacity.

Abstract
The advent of Industry 4.0, driven by automation and real-time data analysis, offers significant opportunities to revolutionize manufacturing, with mobile robots playing a central role in boosting productivity. In smart job shops, scheduling tasks involves not only assigning work to machines but also managing robot allocation and travel times, thus extending traditional problems like the Job Shop Scheduling Problem (JSSP) and Traveling Salesman Problem (TSP). Common solution methods include heuristics, metaheuristics, and hybrid methods. However, due to the complexity of these problems, existing models often struggle to provide efficient optimal solutions. Machine learning, particularly reinforcement learning (RL), presents a promising approach by learning from environmental interactions, offering effective solutions for task scheduling. This systematic literature review analyzes 71 papers published between 2014 and 2024, critically evaluating the current state of the art of task scheduling with mobile robots. The review identifies the increasing use of machine learning techniques and hybrid approaches to address more complex scenarios, thanks to their adaptability. Despite these advancements, challenges remain, including the integration of path planning and obstacle avoidance in the task scheduling problem, which is crucial for making these solutions stable and reliable for real-world applications and scaling for larger fleets of robots.

Abstract
Industry 4.0 is transforming manufacturing environments, with robotics being a key technology that enhances various capabilities. The flexibility of Autonomous Mobile Robots has led to the rise of multi-robot systems in industrial settings. Considering the high cost of these robots, it is essential to determine the best fit of number and type before making any major investments. Simulation and modeling are valuable decision-support tools, allowing the simulation of different setups to address robot fleet sizing issues. This paper introduces a decision-support framework that combines a fleet manager software stack with the FlexSim simulator, helping decision-makers determine the most suitable mobile robots fleet size tailored to their needs. Unlike previous approaches, the developed solution integrates the same real robot coordination software in both simulation and actual deployment, ensuring that tested scenarios accurately reflect real-world conditions. A case study was conducted to evaluate the framework, involving multiple tasks of loading and unloading materials within a warehouse. Five different scenarios with varying fleet sizes were simulated, and their performances assessed. The analysis concluded that, for the case study under consideration, a fleet of three robots was the most suitable, considering relevant key performance indicators. The results confirmed that the developed solution is an effective alternative for addressing the problem and represents a novel technology with no prior state-of-the-art equivalents.

Abstract
Mecanum wheeled mobile robots have become relevant due to their excellent maneuverability, enabling omnidirectional motion in constrained environments as a requirement in industrial automation, logistics, and service robotics. This paper addresses a low-level controller based on the H-Infinity (H-infinity) control method for a four-wheel Mecanum mobile robot. The proposed controller ensures stability and performance despite model uncertainties and external disturbances. The dynamic model of the robot was developed and introduced in MATLAB to generate the controller. Further, the controller's performance is validated and compared to a traditional PID controller using the SimTwo simulator, a realistic physics-based simulator with dynamics of rigid bodies incorporating non-linearities such as motor dynamics and friction effects. The preliminary simulation results show that the H-infinity reached a time-independent Euclidean error of 0.0091 m, compared to 0.0154 m error for the PID in trajectory tracking. Demonstrating that the H-infinity controller handles nonlinear dynamics and disturbances, ensuring precise trajectory tracking and improved system performance. This research validates the proposed approach for advanced control of Mecanum wheeled robots.