Abstract
In this paper we present a new concept of robot-dependent reachability map (RDReachMap) for mobile platforms. In heterogeneous multi-robot systems, the reachability limit of robots motion and actuation must be considered when assigning tasks to them. We created an algorithm that generates those reachability maps, separating regions that can be covered by a robot from the unreachable ones, using morphological operations. Our method is dependent on the robot position, and is parameterized with the robot's size and actuation radius. For this purpose we introduce a new technique, the partial morphological closing operation. The algorithm was tested both in simulated and real environment maps. We also present a common problem of multi robot routing, which we solve with a planner that uses our reachability maps in order to generate valid plans. We contribute a heuristic that generates paths for two robots using the reachability concept.

Abstract
Traffic Control is one of the fundamental problems in the management of an Automated Guided Vehicle (AGV) system. Its main objectives are to assure efficient conflict free routes and to avoid/solve system deadlocks. In this sense, and as an extension of our previouswork, this paper focus on exploring the capabilities of the Time Enhanced A* (TEA*) to dynamically control a fleet of AGVs, responsible for the execution of a predetermined set of tasks, considering an automatic warehouse case scenario. During the trial execution the proposed algorithm, besides having shown high capability on preventing/dealing with the occurrence of deadlocks, it also has exhibited high efficiency in the generation of free collision trajectories. Moreover, it was also selected an alternative from the state-of-art, in order to validate the TEA* results and compare it.

Abstract
Autonomous vehicles have a large number of on-board sensors, not only for providing coverage all around the vehicle, but also to ensure multi-modality in the observation of the scene. Because of this, it is not trivial to come up with a single, unique representation that feeds from the data given by all these sensors. We propose an algorithm which is capable of mapping texture collected from vision based sensors onto a geometric description of the scenario constructed from data provided by 3D sensors. The algorithm uses a constrained Delaunay triangulation to produce a mesh which is updated using a specially devised sequence of operations. These enforce a partial configuration of the mesh that avoids bad quality textures and ensures that there are no gaps in the texture. Results show that this algorithm is capable of producing fine quality textures.

Abstract
Sports and physical activities allow people with disabilities to have better quality of life. The proposed work aimed to develop a multimodal interaction platform of robotic devices in a simulated environment for users to train different interface options. The suggested scenarios allow a user to interact with an Intelligent Wheelchair (IW) and with an Intelligent Robotic Ramp (IRR) performing different tasks individually or with a multiplayer option. The main objective of this multimodal interaction platform is to allow users, with severe disabilities, to move around and inclusive to play the Boccia Game more independently and autonomously. A preliminary set of experiments with 27 volunteers tested the scenarios and the multimodal interface for driving the intelligent wheelchair and to maneuver the IRR. The results show excellent performance when users maneuver the IRR in which the success achieved 90%. All dimensions of CEGEQ questionnaire presented good results. Therefore the solution created is quite satisfactory for a user point of view.

Abstract
Develop ground robots for crop monitoring and harvesting in steep slope vineyards is a complex challenge. Because of two main reasons: harsh condition of the terrain and unstable localization accuracy got from Global Positioning Systems (GPS). This paper presents a hybrid SLAM (VineSLAM) considering low cost landmarks to increase the robot localization accuracy, robustness and redundancy on these steep slope vineyards. Also, we present a cost-effective robot to carry-out crop monitoring tasks in steep slope vineyard environment. Test results got in a simulated and in a real test case supports the proposed approach and robot.

Abstract
We introduce in this paper visibility maps for robots of any shape, representing the reachability limit of the robot's motion and sensing in a 2D gridmap with obstacles. The brute-force approach to determine the optimal visibility map is computationally expensive, and prohibitive with dynamic obstacles. We contribute the Robot-Dependent Visibility Map (RDVM) as a close approximation to the optimal, and an effective algorithm to compute it. The RDVM is a function of the robot's shape, initial position, and sensor model. We first overview the computation of RDVM for the circular robot case in terms of the partial morphological closing operation and the optimal choice for the critical points position. We then present how the RDVM for any-shape robots is computed. In order to handle any robot shape, we introduce in the first step multiple layers that discretize the robot orientation. In the second step, our algorithm determines the frontiers of actuation, similarly to the case of the the circular robot case. We then derive the concept of critical points to the any-shape robot, as the points that maximize expected visibility inside unreachable regions. We compare our method with the ground-truth in a simulated map compiled to capture a variety of challenges of obstacle distribution and type, and discuss the accuracy of our approximation to the optimal visibility map.