Ken Goldberg

Ken Goldberg

Auto-generated profile, based on publicly available information

Ken Goldberg

Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley, CA 94709, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 October 2020
Verified
Conference Paper
Open access
MDMichael Danielczuk
Michael Danielczuk
AAAnelia Angelova
Anelia Angelova
VVVincent Vanhoucke
Vincent Vanhoucke
KGKen Goldberg
Ken Goldberg
For applications in e-commerce, warehouses, healthcare, and home service, robots are often required to search through heaps of objects to grasp a specific target object. For mechanical search, we introduce X-Ray, an algorithm based on learned occupancy distributions. We train a neural network using a synthetic dataset of RGBD heap images labeled for a set of standard bounding box targets with varying aspect ratios. X-Ray minimizes support of the learned distribution as part of a mechanical search policy in both simulated and real environments. We benchmark these policies against two baseline policies on 1,000 heaps of 15 objects in simulation where the target object is partially or fully occluded. Results suggest that X-Ray is significantly more efficient, as it succeeds in extracting the target object 82% of the time, 15% more often than the best-performing baseline. Experiments on an ABB YuMi robot with 20 heaps of 25 household objects suggest that the learned policy transfers easily to a physical system, where it outperforms baseline policies by 15% in success rate with 17% fewer actions. Datasets, videos, and experiments are available at https://sites.google.com/berkeley.edu/x-ray.

27 June 2022
Verified
Conference Paper
Open access
VVVainavi Viswanath
Vainavi Viswanath
KSKaushik Shivakumar
Kaushik Shivakumar
JKJustin Kerr
Justin Kerr
BTBrijen Thananjeyan
Brijen Thananjeyan
ENEllen Novoseller
Ellen Novoseller
KGKen Goldberg
Ken Goldberg

27 September 2021
Verified
Conference Paper
Open access
HHHuang Huang
Huang Huang
MDMarcus Dominguez-Kuhne
Marcus Dominguez-Kuhne
VSVishal Satish
Vishal Satish
MDMichael Danielczuk
Michael Danielczuk
KSKate Sanders
Kate Sanders
KGKen Goldberg
Ken Goldberg
Finding an occluded object in a lateral access environment such as a shelf or cabinet is a problem that arises in many contexts such as warehouses, retail, healthcare, shipping, and homes. While this problem, known as mechanical search, is well-studied in overhead access environments, lateral access environments introduce constraints on the poses of objects and on available grasp actions, and pushing actions are preferred to preserve the environment structure. We propose LAX-RAY (Lateral Access maXimal Reduction in support Area of occupancY distribution): a system that combines target object occupancy distribution prediction with a mechanical search policy that sequentially pushes occluding objects to reveal a given target object. For scenarios with extruded polygonal objects, we introduce two lateral-access search policies that encode a history of predicted target distributions and can plan up to three actions into the future. We introduce a First-Order Shelf Simulator (FOSS) and use it to evaluate these policies in 800 simulated random shelf environments per policy. We also evaluate in 5 physical shelf environments using a Fetch robot with an embedded PrimeSense RGBD Camera and an attached pushing blade. The policies outperform baselines by up to 25% in simulation and up to 60% in physical experiments. Additionally, the two-step prediction policy is the highest performing in simulation for 8 objects with a 69% success rate, suggesting a tradeoff between future information and prediction errors. Code, videos, and supplementary material can be found at https://sites.google.com/berkeley.edu/lax-ray.

1 May 2016
Verified
Conference Paper
Closed access
FPFlorian T. Pokorny
Florian T. Pokorny
DKDanica Kragic
Danica Kragic
LKLydia Kavraki
Lydia Kavraki
KGKen Goldberg
Ken Goldberg
Recent progress in motion planning has made it possible to determine homotopy inequivalent trajectories between an initial and terminal configuration in a robot configuration space. Current approaches have however either assumed the knowledge of differential one-forms related to a skeletonization of the collision space, or have relied on a simplicial representation of the free space. Both of these approaches are currently however not yet practical for higher dimensional configuration spaces. We propose 2D topological task projections (TTPs): mappings from the configuration space to 2-dimensional spaces where simplicial complex filtrations and persistent homology can identify topological properties of the high-dimensional free configuration space. Our approach only requires the availability of collision free samples to identify winding centers that can be used to determine homotopy inequivalent trajectories. We propose the Winding Augmented RRT and RRT* (WA-RRT/RRT*) algorithms using which homotopy inequivalent trajectories can be found. We evaluate our approach in experiments with configuration spaces of planar linkages with 2-10 degrees of freedom. Results indicate that our approach can reliably identify suitable topological task projections and our proposed WA-RRT and WA-RRT* algorithms were able to identify a collection of homotopy inequivalent trajectories in each considered configuration space dimension.

1 August 2017
Verified
Conference Paper
Closed access
CCCaleb Chuck
Caleb Chuck
MLMichael Laskey
Michael Laskey
SKSanjay Krishnan
Sanjay Krishnan
RJRuta Joshi
Ruta Joshi
RFRoy Fox
Roy Fox
KGKen Goldberg
Ken Goldberg
Automation using deep learning from demonstrations requires many training examples. Gathering this data is time consuming and expensive, and human demonstrators are prone to inconsistencies and errors that can delay or degrade learning. This paper explores how characterizing supervisor inconsistency and correcting for this noise can improve task performance with a limited budget of data. We consider a planar part extraction task (separating one part from a group) where human operators provide demonstrations by teleoperating a 2DOF robot. We analyze 30, 000 image-control pairs from 480 trajectories. After error corrections, trained CNN models show an improvement of 11.2% upon the baseline in mean absolute success rate.

1 August 2020
Verified
Conference Paper
Open access
KSKate Sanders
Kate Sanders
MDMichael Danielczuk
Michael Danielczuk
JMJeffrey Mahler
Jeffrey Mahler
ATAjay Tanwani
Ajay Tanwani
KGKen Goldberg
Ken Goldberg
A new generation of automated bin picking systems using deep learning is evolving to support increasing demand for e-commerce. To accommodate a wide variety of products, many automated systems include multiple gripper types and/or tool changers. However, for some objects, sequential grasp failures are common: when a computed grasp fails to lift and remove the object, the bin is often left unchanged; as the sensor input is consistent, the system retries the same grasp over and over, resulting in a significant reduction in mean successful picks per hour (MPPH). Based on an empirical study of sequential failures, we characterize a class of “sequential failure objects” (SFOs) – objects prone to sequential failures based on a novel taxonomy. We then propose three non-Markov picking policies that incorporate memory of past failures to modify subsequent actions. Simulation experiments on SFO models and the EGAD dataset [19] suggest that the non-Markov policies significantly outperform the Markov policy in terms of the sequential failure rate and MPPH. In physical experiments on 50 heaps of 12 SFOs the most effective Non-Markov policy increased MPPH over the Dex-Net Markov policy by 107%.