Abstract-The goal of this paper is to develop efficient regrasp algorithms for single-arm and dual-arm regrasp and compares the performance of single-arm and dual-arm regrasp by running the two algorithms thousands of times. We focus on pick-and-place regrasp which reorients an object from one placement to another by using a sequence of pick-ups and placedowns. After analyzing the simulation results, we find dual-arm regrasp is not necessarily better than single-arm regrasp: Dualarm regrasp is flexible. When the two hands can grasp the object with good clearance, dual-arm regrasp is better and has higher successful rate than single-arm regrasp. However, dualarm regrasp suffers from geometric constraints caused by the two arms. When the grasps overlap, dual-arm regrasp is bad. Developers need to sample grasps with high density to reduce overlapping. This leads to exploded combinatorics in previous methods, but is possible with the algorithms presented in this paper. Following the results, practitioners may choose singlearm or dual-arm robots by considering the object shapes and grasps. Meanwhile, they can reduce overlapping and implement practical dual-arm regrasp by using the presented algorithms.

The goal of this paper is to develop a regrasp planning algorithm general enough to perform statistical analysis with thousands of experiments and arbitrary mesh models. We focus on pick-and-place regrasp which reorients an object from one placement to another by using a sequence of pickups and place-downs. We improve the pick-and-place regrasp approach developed in 1990s and analyze its performance in robotic assembly with different work surfaces in the workcell. Our algorithm will automatically compute the stable placements of an object, find several force-closure grasps, generate a graph of regrasp actions, and search for regrasp sequences. We demonstrate the advantages of our algorithm with various mesh models and use the algorithm to evaluate the completeness, the cost and the length of regrasp sequences with different mesh models and different assembly tasks in the presence of different work surfaces. Our results show that spare work surfaces are beneficial to assembly. Tilted work surfaces are only sometimes beneficial, depending on the objects.

No abstract

No abstract

Robots are increasingly operating in indoor environments designed for and shared with people. However, robots working safely and autonomously in uneven and unstructured environments still face great challenges. Many modern indoor environments are designed with wheelchair accessibility in mind. This presents an opportunity for wheeled robots to navigate through sloped areas while avoiding staircases. In this paper, we present an integrated software and hardware system for autonomous mobile robot navigation in uneven and unstructured indoor environments. This modular and reusable software framework incorporates capabilities of perception and navigation. Our robot first builds a 3D OctoMap representation for the uneven environment with the 3D mapping using wheel odometry, 2D laser and RGB-D data. Then we project multilayer 2D occupancy maps from OctoMap to generate the the traversable map based on layer differences. The safe traversable map serves as the input for efficient autonomous navigation. Furthermore, we employ a variable step size Rapidly Exploring Random Trees that could adjust the step size automatically, eliminating tuning step sizes according to environments. We conduct extensive experiments in simulation and real-world, demonstrating the efficacy and efficiency of our system. (Supplemented video link: https://youtu.be/6XJWcsH1fk0) * Indicates equal contribution.

No abstract

No abstract

This paper proposes a novel method for randomized bin-picking based on learning. When a two-fingered gripper tries to pick an object from the pile, a finger often contacts a neighboring object. Even if a finger contacts a neighboring object, the target object will be successfully picked depending on the configuration of neighboring objects. In our proposed method, we use the visual information on neighboring objects to train the discriminator. Corresponding to a grasping posture of an object, the discriminator predicts whether or not the pick will be successful even if a finger contacts a neighboring object. We examine two learning algorithms, the linear support vector machine (SVM) and the random forest (RF) approaches. By using both methods, we demonstrate that the picking success rate is significantly higher than with conventional methods without learning.