Diogo Miguel Matos

Abstract
Simulators have been increasingly used on development and tests on several areas. They allow to speed up the development without damage and no extra costs. On realistic simulators, where kinematics play an important role, the modelling process should be imported for each component to be accurately simulated. Some robots are not yet modelled, as for example the Monera. This paper presents a model of a small vibration robot (Monera) that is acquired in a developed test-bed. A localisation ground truth is used to acquire the position of the Monera with actuating it. Linear and angular speeds acquired from real experiments allow to validate the proposed methodology.

Abstract
There is an increasing need for autonomous mobile robots (AMRs) in industrial environments. The capability of autonomous movement and transportation of items in industrial environments provides a significant increase in productivity and efficiency. This need, coupled with the possibility of controlling groups of heterogeneous robots, simultaneously addresses a wide range of tasks with different characteristics in the same environment, further increasing productivity and efficiency. This paper will present an implementation of a system capable of coordinating a fleet of heterogeneous robots with robustness. The implemented system must be able to plan a safe and efficient path for these different robots. To achieve this task, the TEA* (Time Enhanced A*) graph search algorithm will be used to coordinate the paths of the robots, along with a graph decomposition module that will be used to improve the efficiency and safety of this system. The project was implemented using the ROS framework and the Stage simulator. Results validate the proposed approach since the system was able to coordinate a fleet of robots in various different tests efficiently and safely, given the heterogeneity of the robots.

Abstract
Navigation is one of the most important tasks for a mobile robot and the localisation is one of its main requirements. There are several types of localisation solutions such as LiDAR, Radio-frequency and acoustic among others. The well-known line follower has been a solution used for a long time ago and still remains its application, especially in competitions for young researchers that should be captivated to the scientific and technological areas. This paper describes two methodologies to estimate the position of a robot placed on a gradient line and compares them. The Least Squares and the Machine Learning methods are used and the results applied to a real robot allow to validate the proposed approach.

Abstract
Most path planning algorithms used presently in multi-robot systems are based on offline planning. The Timed Enhanced A* (TEA*) algorithm gives the possibility of planning in real time, rather than planning in advance, by using a temporal estimation of the robot's positions at any given time. In this article, the implementation of a control system for multi-robot applications that operate in environments where communication faults can occur and where entire sections of the environment may not have any connection to the communication network will be presented. This system uses the TEA* to plan multiple robot paths and a supervision system to control communications. The supervision system supervises the communication with the robots and checks whether the robot's movements are synchronized. The implemented system allowed the creation and execution of paths for the robots that were both safe and kept the temporal efficiency of the TEA* algorithm. Using the Simtwo2020 simulation software, capable of simulating movement dynamics and the Lazarus development environment, it was possible to simulate the execution of several different missions by the implemented system and analyze their results.

Abstract
Task Scheduling assumes an integral topic in the efficiency of multiple mobile robots systems and is a key part in most modern manufacturing systems. Advances in the field of combinatorial optimisation have allowed the implementation of algorithms capable of solving the different variants of the vehicle routing problem in relation to different objectives. However few of this approaches are capable of taking into account the nuances associated with the coordinated path planning in multi-AGV systems. This paper presents a new study about the implementation of the Simulated Annealing algorithm to minimise the time and distance cost of executing a tasks set while taking into account possible pathing conflicts that may occur during the execution of the referred tasks. This implementation uses an estimation of the planned paths for the robots, provided by the Time Enhanced A* (TEA*) to determine where possible pathing conflicts occur and uses the Simulated Annealing algorithm to optimise the attribution of tasks to each robot, in order to minimise the pathing conflicts. Results are presented that validate the efficiency of this algorithm and compare it to an approach that does not take into account the estimation of the robots paths.