Back to Results
First PageMeta Content
Motion planning / Shortest path problem / Graph / Directed graph / Search algorithms / Graph theory / Mathematics / Theoretical computer science


Learning to Plan for Constrained Manipulation from Demonstrations Mike Phillips Victor Hwang
Add to Reading List

Document Date: 2014-08-18 07:52:22


Open Document

File Size: 1,81 MB

Share Result on Facebook

City

D EMONSTRATION / B. Task / Barcelona / Taipei / Sampling / D. Task / Algarve / C. Task / cambridge / /

Company

Autonomous Systems / GE / /

Country

Taiwan / Portugal / Spain / /

/

Facility

Willow Garage / /

IndustryTerm

cheaper solutions / metal drawer / similar solution / graph search / valid solution / neural information processing systems / policy search / low enough solution / search tree / Search-based / planT oM anipulate algorithm / guarantees on completeness and solution / /

Organization

Drawer Cabinet / US Federal Reserve / Carnegie Mellon University / /

Person

Benjamin J. Cohen / Dmitry Berenson / Oriol Bohigas Nadal / T. Asfour / Yuandong Yang / H. Hoffmann / Xiaoxi Jiang / Petar Kormushev / Brenna Argall / Manuela M. Veloso / Brett Browning / D. G. Caldwell / S. Schaal / Maxim Likhachev / Nikolay Jetchev / Maria Porta Pleite / Pieter Abbeel / Marcelo Kallmann / Ken Goldberg / Christian Mongillo / James Kuffner / S. Calinon / David Ferguson / Marc Toussaint / Seibi Chiba / S. Chitta / Siddhartha Srinivasa / Michael Phillips / P. Pastor / Sonia Chernova / Sachin Chitta Maxim Likhachev / B.J. Cohen / Oliver Brock / Ioan A. Sucan / Sachin Chitta / M. Likhachev / Hiroaki Sakoe / Giuseppe Oriolo / Mike Phillips Victor Hwang Sachin / /

Position

motion planner / full planner / planner for incorporation into the E-Graph / complete planner / teacher / existing Experience Graph planner / A. Robot Results Our planner / planner / E-Graph planner / /

Product

PR2 / /

Technology

RRT algorithms / The planT oM anipulate algorithm / simulation / /

SocialTag