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.

Abstract
When an autonomous vehicle is traveling through some scenario it receives a continuous stream of sensor data. This sensor data arrives in an asynchronous fashion and often contains overlapping or redundant information. Thus, it is not trivial how a representation of the environment observed by the vehicle can be created and updated over time. This paper presents a novel methodology to compute an incremental 3D representation of a scenario from 3D range measurements. We propose to use macro scale polygonal primitives to model the scenario. This means that the representation of the scene is given as a list of large scale polygons that describe the geometric structure of the environment. Furthermore, we propose mechanisms designed to update the geometric polygonal primitives over time whenever fresh sensor data is collected. Results show that the approach is capable of producing accurate descriptions of the scene, and that it is computationally very efficient when compared to other reconstruction techniques.

Abstract
In this paper we introduce the problem of planning for perception of a target position. Given a sensing target, the robot has to move to a goal position from where the target can be perceived. Our algorithm minimizes the overall path cost as a function of both motion and perception costs, given an initial robot position and a sensing target. We contribute a heuristic search method, PA*, that efficiently searches for an optimal path. We prove the proposed heuristic is admissible, and introduce a new goal state stopping condition.

Abstract
This paper discusses about a proposed solution to the obstacle avoidance problem in multi-robot systems when applied to active target tracking. It is explained how a nonlinear model predictive formation control (NMPFC) previously proposed solves this problem of fixed and moving obstacle avoidance. First, an approach is presented which uses potential functions as terms of the NMPFC. These terms penalize the proximity with mates and obstacles. A strategy to avoid singularity problems with the potential functions using a modified A* path planning algorithm was then introduced. Results with simulations and experiments with real robots are presented and discussed demonstrating the efficiency of the proposed approach.