Dario Lodi Rizzini

Head-mounted displays (HMDs) in room-scale virtual reality are usually tracked using inside-out visual SLAM algorithms. Alternatively, to track the motion of the HMD with respect to a fixed real-world reference frame, an outside-in instrumentation like a motion capture system can be adopted. However, outside-in tracking systems may temporarily lose tracking as they suffer by occlusion and blind spots. A possible solution is to adopt a hybrid approach where the inside-out tracker of the HMD is augmented with an outside-in sensing system. On the other hand, when the tracking signal of the outside-in system is recovered after a loss of tracking the transition from inside-out tracking to hybrid tracking may generate a discontinuity, i.e a sudden change of the virtual viewpoint, that can be uncomfortable for the user. Therefore, hybrid tracking solutions for HMDs require advanced sensor fusion algorithms to obtain a smooth transition. This work proposes a method for hybrid tracking of a HMD with smooth transitions based on an adaptive complementary filter. The proposed approach can be configured with several parameters that determine a trade-off between user experience and tracking error. A user study was carried out in a room-scale virtual reality environment, where users carried out two different tasks while multiple signal tracking losses of the outside-in sensor system occurred. The results show that the proposed approach improves user experience compared to a standard Extended Kalman Filter, and that tracking error is lower compared to a state-of-the-art complementary filter when configured for the same quality of user experience.

Accurate robot localization and mapping can be improved through the adoption of globally optimal registration methods, like the Angular Radon Spectrum (ARS). In this paper, we present Cud-ARS, an efficient variant of the ARS algorithm for 2D registration designed for parallel execution of the most computationally expensive steps on Nvidia™ Graphics Processing Units (GPUs). Cud-ARS is able to compute the ARS in parallel blocks, with each associated to a subset of input points. We also propose a global branch-and-bound method for translation estimation. This novel parallel algorithm has been tested on multiple datasets. The proposed method is able to speed up the execution time by two orders of magnitude while obtaining more accurate results in rotation estimation than state-of-the-art correspondence-based algorithms. Our experiments also assess the potential of this novel approach in mapping applications, showing the contribution of GPU programming to efficient solutions of robotic tasks.

In this paper, we present the anisotropic Angular Radon Spectrum (ARS), a novel feature for global estimation of rotation in a two dimension space. ARS effectively describes collinearity of points and has the properties of translation-invariance and shift-rotation. We derive the analytical expression of ARS for Gaussian Mixture Models (GMM) representing point clouds where the Gaussian kernels have arbitrary covariances. Furthermore, we developed a preliminary procedure for simplification of GMM suitable for efficient computation of ARS. Rotation between point clouds is estimated by searching of maximum of correlation between their spectra. Correlation is efficiently computed from Fourier series expansion of ARS. Experiments on datasets of distorted object shapes, laser scans and on robotic mapping datasets assess the accuracy and robustness to noise in global rotation estimation.

This paper presents a mobile manipulation platform designed for autonomous depalletizing tasks. The proposed solution integrates machine vision, control and mechanical components to increase flexibility and ease of deployment in industrial environments such as warehouses. A collaborative robot mounted on a mobile base is proposed, equipped with a simple manipulation tool and a 3D in-hand vision system that detects parcel boxes on a pallet, and that pulls them one by one on the mobile base for transportation. The robot setup allows to avoid the cumbersome implementation of pick-and-place operations, since it does not require lifting the boxes. The 3D vision system is used to provide an initial estimation of the pose of the boxes on the top layer of the pallet, and to accurately detect the separation between the boxes for manipulation. Force measurement provided by the robot together with admittance control are exploited to verify the correct execution of the manipulation task. The proposed system was implemented and tested in a simplified laboratory scenario and the results of experimental trials are reported.

This work presents a 3D vision system for automatic detection of cardboard parcel boxes of known size, located on the top layer of a pallet of known height. An industrial Time-of-Flight (ToF) sensor is adopted that can operate in different illumination conditions thanks to the use of an infrared light source. The perception system is intended for application in industrial warehousing for end-of-line operations, like robot depalletizing. The proposed method does not assume any predefined layout of parcels and, therefore, it can work even with an incomplete layer of misaligned cardboard boxes. The developed solution first extracts all possible object hypotheses, then an optimization problem is solved, based on a genetic algorithm, to exclude conflicts. Experiments have been performed on a real dataset including complex configurations of tightly packed parcels.

The problem of planar registration consists in finding the transformation that better aligns two point sets. In our setting, the search domain is the set of planar rigid transformations and the objective function is the sum of the distances between each point of the transformed source set and the destination set. We consider a Branch and Bound (BnB) method for finding the globally optimal solution. The algorithm recursively splits the search domain into boxes and computes an upper and a lower bound for the minimum value of the restricted problem. The main contribution of this work is the introduction of a novel lower bound, the relaxation bound, which corresponds to the solution of a concave relaxation of the objective function based on the linearization of the distance. In the BnB we also employ the so called cheap bound, equal to to the sum of the minimum distances between each point of source point set, transformed according to current box, and all the candidate points in the destination point set. We prove, both theoretically and practically, that the novel relaxation bound dominates the cheap bound over small boxes. More precisely, from the theoretical point of view, we prove that the relaxation bound is a second-order approximation of the minimum value, i.e., its distance from the minimum value decreases quadratically with respect to the diameter of the box (see Theorem 1), while the cheap bound is a first-order one (see Proposition 3). From the practical point of view, we show through different computational experiments that the addition of the relaxation bound considerably enhances the performance of the BnB algorithm, compensating the higher cost of its computation with respect to the cheap bound with a strong reduction of the number of BnB nodes to be explored.