Discovering new motor primitives in transition graphs

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

Abstract

In this paper we propose a methodology for discovering new movement primitives in a database of example trajectories. The initial trajectory data, which is usually acquired from human demonstrations or by kinesthetic guiding, is clustered and organized into a binary tree, from which transition graphs at different levels of granularity are constructed. We show that new movements can be discovered by searching the transition graph, exploiting the interdependencies between the movements encoded by the graph. By connecting the results of the graph search with optimized interpolation and statistical generalization techniques, we can construct a complete representation for new movement primitives, which were not explicitly present in the original database of example trajectories. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Deniša, M., & Ude, A. (2013). Discovering new motor primitives in transition graphs. In Advances in Intelligent Systems and Computing (Vol. 193 AISC, pp. 219–230). Springer Verlag. https://doi.org/10.1007/978-3-642-33926-4_21

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