Incremental learning of subtasks from unsegmented demonstration

74Citations
Citations of this article
93Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose to incrementally learn the segmentation of a demonstrated task into subtasks and the individual subtask policies themselves simultaneously. Previous robot learning from demonstration techniques have either learned the individual subtasks in isolation, combined known subtasks, or used knowledge of the overall task structure to perform segmentation. Our infinite mixture of experts approach instead automatically infers an appropriate partitioning (number of subtasks and assignment of data points to each one) directly from the data. We illustrate the applicability of our technique by learning a suitable set of subtasks from the demonstration of a finite-state machine robot soccer goal scorer. ©2010 IEEE.

Cite

CITATION STYLE

APA

Grollman, D. H., & Jenkins, O. C. (2010). Incremental learning of subtasks from unsegmented demonstration. In IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings (pp. 261–266). https://doi.org/10.1109/IROS.2010.5650500

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free