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
The rise of Industry 4.0 has revolutionized manufacturing by integrating real-time data analysis, artificial intelligence (AI), automation, and interconnected systems, enabling adaptive and resilient smart factories. Autonomous Mobile Robots (AMRs), with their advanced mobility and navigation capabilities, are a pillar of this transformation. However, their deployment in job shop environments adds complexity to the already challenging Job Shop Scheduling Problem (JSSP), expanding it to include task allocation, robot scheduling, and travel time optimization, creating a multi-faceted, non-deterministic polynomial-time hardness (NP-hard) problem. Traditional approaches such as heuristics, meta-heuristics, and mixed integer linear programming (MILP) are commonly used. Recent AI advancements, particularly large language models (LLM), have shown potential in addressing these scheduling challenges due to significant improvements in reasoning and decision-making from textual data. This paper examines the application of LLM to tackle scheduling complexities in smart job shops with mobile robots. Guided by tailored prompts inserted manually, LLM are employed to generate scheduling solutions, being these compared to an heuristic-based method. The results indicate that LLM currently have limitations in solving complex combinatorial problems, such as task scheduling with mobile robots. Due to issues with consistency and repeatability, they are not yet reliable enough for practical implementation in industrial environments. However, they offer a promising foundation for augmenting traditional approaches in the future.

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
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
This paper presents an approach for a multi-agent-based cyber-physical system dedicated to operating the warehouse plant with a distributed approach. The recent technological evolution has improved the quality and robustness of the services for current warehouses. However, systems that operate warehouses do not follow this evolution, presenting predominantly central monolithic or hierarchical approaches, resulting in fragility related to flexibility, scalability, and robustness in the face of disturbances. In the proposed approach, each warehouse physical component has a computational unit associated, i.e. a cyber agent, with communication, negotiation, and data analysis capabilities. Agents contain all the information, algorithms, and functions necessary to operate the physical component, and instead of receiving orders from higher-layer agents, they negotiate and collaborate to perform the tasks. The proposed system was tested in a laboratory testbed, composed of six racks and up to eight robots for transporting products. Extensive experiments show the feasibility of the approach. Copyright (c) 2023 The Authors.

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.