Abstract
Bin picking is a challenging problem that involves using a robotic manipulator to remove, one-by-one, a set of objects randomly stacked in a container. When the objects are prone to entanglement, having an estimation of their pose and shape is highly valuable for more reliable grasp and motion planning. This paper focuses on modeling entangled tubes with varying degrees of curvature. An unconventional machine learning technique, Inductive Logic Programming (ILP), is used to construct sets of rules (theories) capable of modeling multiple tubes when given the cylinders that constitute them. Datasets of entangled tubes are created via simulation in Gazebo. Experiments using Aleph and SWI-Prolog illustrate how ILP can build explainable theories with a high performance, using a relatively small dataset and low amount of time for training. Therefore, this work serves as a proof-of-concept that ILP is a valuable method to acquire knowledge and validate heuristics for pose and shape estimation in complex bin picking scenarios.

Abstract
The manipulation of deformable objects poses a significant challenge for the automotive industry. In particular, the assembly of flexible cables and wire-harnesses in vehicles is still performed manually as there is yet to be a reliable and general solution for this problem. This paper presents a simple yet efficient motion planning algorithm to mount a flexible wire in an assembly jig, where the wire must traverse a set of forks in order. The algorithm uses a heuristic based on a set of control points to guide the wire's movement. Various controlled assembly scenarios are built in simulation using MuJoCo, a physics engine that can emulate the dynamics of Deformable Linear Objects (DLO). Experimental results in simulation demonstrated that the amount and orientation of the forks has a large impact in the solution's performance and highlighted several key ideas and challenges moving forward. Thus, this work serves as a stepping stone towards the development of more complete solutions, capable of assembling flexible items in vehicles.

Abstract

Abstract

Abstract

Abstract
The estimation of a 3D sensor constellation for maximizing the observable surface area percentage of a given set of target objects is a challenging and combinatorial explosive problem that has a wide range of applications for perception tasks that may require gathering sensor information from multiple views due to environment occlusions. To tackle this problem, the Gazebo simulator was configured for accurately modeling 8 types of depth cameras with different hardware characteristics, such as image resolution, field of view, range of measurements and acquisition rate. Later on, several populations of depth sensors were deployed within 4 different testing environments targeting object recognition and bin picking applications with increasing level of occlusions and geometry complexity. The sensor populations were either uniformly or randomly inserted on a set of regions of interest in which useful sensor data could be retrieved and in which the real sensors could be installed or moved by a robotic arm. The proposed approach of using fusion of 3D point clouds from multiple sensors using color segmentation and voxel grid merging for fast surface area coverage computation, coupled with a random sample consensus algorithm for best views estimation, managed to quickly estimate useful sensor constellations for maximizing the observable surface area of a set of target objects, making it suitable to be used for deciding the type and spatial disposition of sensors and also guide movable 3D cameras for avoiding environment occlusions.