In this work, we propose a novel robot learning framework called Neural Task Programming (NTP), which bridges the idea of few-shot learning from demonstration and neural program induction. NTP takes as input a task specification (e.g., video demonstration of a task) and recursively decomposes it into finer sub-task specifications. These specifications are fed to a hierarchical neural program, where bottom-level programs are callable subroutines that interact with the environment. We validate our method in three robot manipulation tasks. NTP achieves strong generalization across sequential tasks that exhibit hierarchal and compositional structures. The experimental results show that NTP learns to generalize well towards unseen tasks with increasing lengths, variable topologies, and changing objectives.stanfordvl.github.io/ntp/.
Neural Task Programming: Learning to Generalize Across Hierarchical Tasks
Danfei Xu,Suraj Nair,Yuke Zhu,J. Gao,Animesh Garg,Li Fei-Fei,S. Savarese
Published 2017 in IEEE International Conference on Robotics and Automation
ABSTRACT
PUBLICATION RECORD
- Publication year
2017
- Venue
IEEE International Conference on Robotics and Automation
- Publication date
2017-10-04
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-43 of 43 references · Page 1 of 1