Deep learning can accelerate grasp-optimized motion planning

2020 ◽  
Vol 5 (48) ◽  
pp. eabd7710
Author(s):  
Jeffrey Ichnowski ◽  
Yahav Avigal ◽  
Vishal Satish ◽  
Ken Goldberg

Robots for picking in e-commerce warehouses require rapid computing of efficient and smooth robot arm motions between varying configurations. Recent results integrate grasp analysis with arm motion planning to compute optimal smooth arm motions; however, computation times on the order of tens of seconds dominate motion times. Recent advances in deep learning allow neural networks to quickly compute these motions; however, they lack the precision required to produce kinematically and dynamically feasible motions. While infeasible, the network-computed motions approximate the optimized results. The proposed method warm starts the optimization process by using the approximate motions as a starting point from which the optimizing motion planner refines to an optimized and feasible motion with few iterations. In experiments, the proposed deep learning–based warm-started optimizing motion planner reduces compute and motion time when compared to a sampling-based asymptotically optimal motion planner and an optimizing motion planner. When applied to grasp-optimized motion planning, the results suggest that deep learning can reduce the computation time by two orders of magnitude (300×), from 29 s to 80 ms, making it practical for e-commerce warehouse picking.

Robotica ◽  
2007 ◽  
Vol 25 (2) ◽  
pp. 201-211 ◽  
Author(s):  
Shuguo Wang ◽  
Jin Bao ◽  
Yili Fu

SUMMARYThis paper deals with sensor-based motion planning method for a robot arm manipulator operating among unknown obstacles of arbitrary shape. It can be applied to online collision avoidance with no prior knowledge of the obstacles. Infrared sensors are used to build a description of the robot's surroundings. This approach is based on the configuration space but the construction of the C-obstacle surface is avoided. The point automation is confined on some planes with square grids in the C-space. A path-searching algorithm based on square grids is used to guide the automation maneuvering around the C-obstacles on the selected planes. To avoid the construction of the C-obstacle surface, the robot geometry model is expanded, and the static collision detection method is used. Hence, the computation time is reduced and the algorithm can work in real time. The effectiveness of the proposed method is verified by a series of experiments.


2003 ◽  
Vol 15 (2) ◽  
pp. 200-207 ◽  
Author(s):  
Satoshi Kagami ◽  
◽  
James J. Kuffner ◽  
Koichi Nishiwaki ◽  
Kei Okada ◽  
...  

This paper describes an experimental stereo vision based motion planning system for humanoid robots. The goal is to automatically generate arm trajectories that avoid obstacles in unknown environments from high-level task commands. Our system consists of three components: 1) environment sensing using stereo vision with disparity map generation and online consistency checking, 2) probabilistic mesh modeling in order to accumulate continuous vision input, and 3) motion planning for the robot arm using RRTs (Rapidly exploring Random Trees). We demonstrate results from experiments using an implementation designed for the humanoid robot H7.


1993 ◽  
Vol 02 (02) ◽  
pp. 163-180 ◽  
Author(s):  
DIANE J. COOK ◽  
GARY LYONS

Heuristic search is a fundamental component of Artificial Intelligence applications. Because search routines are frequently also a computational bottleneck, numerous methods have been explored to increase the efficiency of search. Recently, researchers have begun investigating methods of using parallel MIMD and SIMD hardware to speed up the search process. In this paper, we present a massively-parallel SIMD approach to search named MIDA* search. The components of MIDA* include a very fast distribution algorithm which biases the search to one side of the tree, and an incrementally-deepening depthfirst search of all the processors in parallel. We show the results of applying MIDA* to instances of the Fifteen Puzzle problem and to the robot arm motion planning problem. Results reveal an efficiency of 74% and a speedup of 8553 and 492 over serial and 16-processor MIMD algorithms, respectively, when finding a solution to the Fifteen Puzzle problem that is close to optimal.


2019 ◽  
Vol 31 (3) ◽  
pp. 493-499
Author(s):  
Thibault Barbié ◽  
◽  
Takaki Nishio ◽  
Takeshi Nishida

Conventional motion planners do not rely on previous experience when presented with a new problem. Trajectory prediction algorithms solve this problem using a pre-existing dataset at runtime. We propose instead using a conditional variational autoencoder (CVAE) to learn the distribution of the motion dataset and hence to generate trajectories for use as priors within the traditional motion planning approaches. We demonstrate, through simulations and by using an industrial robot arm with six degrees of freedom, that our trajectory prediction algorithm generates more collision-free trajectories compared to the linear initialization, and reduces the computation time of optimization-based planners.


Sign in / Sign up

Export Citation Format

Share Document