CGCarl Gaebert

Carl Gaebert

*This is an algorithmically generated author record based on publicly available information.

Carl Gaebert has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Grasp Pose Generation for Human-to-Robot Handovers Using Simulation-to-Reality Transfer

    by Carl Gaebert, Chaitanya Bandi, Ulrike Thomas

    Human-to-robot handovers play an important role in collaborative tasks in industry or household assistance. Due to the vast amount of possible unknown objects, learning-based approaches gained interest for robust and general grasp synthesis. However, obtaining real training data for such methods requires expensive human demonstrations. Simulated data, on the other hand, is easy to generate and can be randomized to cover the distribution of real-world data. The first contribution of this work is a dataset for human grasps generated in simulation. For this, we use a simulated hand and models of 10 objects from the YCB dataset [1]. It can also be easily extended to include new objects. The method thus allows for generating an arbitrary amount of training data without human interactions. Secondly, we combine a generative neural grasp generator with an evaluator model for grasp pose generation. In contrast to previous works, we obtain grasp poses from simulated RGB images which allows for reducing the negative effects of depth sensor noise. To this end, our generator model is provided with a cropped image of the human hand and learns the distribution of grasps in the wrist system. The evaluator then narrows down the list of grasps to the most promising ones. The presented approach requires the model to extract relevant features from images instead of point clouds. A cost-efficient method for generating large amounts of training data is therefore needed. We test our approach in simulation and transfer it to a real robot system. We use the same objects as in the training dataset but also test the generalization capabilities toward new objects. The presented dataset is available for download: https://tuc.cloud/index.php/s/g3noZD7oCqbQR9d .

  • Open Access

    Towards Smooth Human–Robot Interaction Using Potential Gradient-Based Sampling

    by Sascha Kaden, Carl Gaebert, Ulrike Thomas

    Successful human–robot interaction calls for fast generation of collision-free and optimized motions. To this end, sampling-based motion planning algorithms have been widely used. However, they often require long planning times to achieve optimized motions. While not being a critical issue in traditional industrial applications, planning time delays or poorly optimized motions have very negative effects on human–robot cooperation. Including artificial potential fields in the sampling algorithm can drastically improve the quality and planning time of such methods. Previous works in this direction are often tailored towards minimizing distance costs such as path length. In this work, we propose a heuristic based on potential fields that can also be used with a variety of state cost functions. We demonstrate the effectiveness of our approach using two cost functions related to human–robot interaction. We achieve drastically improved results in both scenarios. This allows for reducing total planning time and achieving a smoother interaction between human and robot.

  • Open Access

    Paramater Optimization for Manipulator Motion Planning using a Novel Benchmark Set

    by Carl Gaebert, Sascha Kaden, Benjamin Fischer, Ulrike Thomas

    Sampling-based motion planning algorithms have been continuously developed for more than two decades. Apart from mobile robots, they are also widely used in manipulator motion planning. Hence, these methods play a key role in collaborative and shared workspaces. Despite numerous improvements, their performance can highly vary depending on the chosen parameter setting. The optimal parameters depend on numerous factors such as the start state, the goal state and the complexity of the environment. Practitioners usually choose these values using their experience and tedious trial and error experiments. To address this problem, recent works combine hyperparameter optimization methods with motion planning. They show that tuning the planner's parameters can lead to shorter planning times and lower costs. It is not clear, however, how well such approaches generalize to a diverse set of planning problems that include narrow passages as well as barely cluttered environments. In this work, we analyze optimized planner settings for a large set of diverse planning problems. We then provide insights into the connection between the characteristics of the planning problem and the optimal parameters. As a result, we provide a list of recommended parameters for various use-cases. Our experiments are based on a novel motion planning benchmark for manipulators which we provide at https://mytuc.org/rybj.