Trajectory clustering and stochastic approximation for robot programming by demonstration

  • Aleotti J
  • Caselli S
  • 46

    Readers

    Mendeley users who have this article in their library.
  • 27

    Citations

    Citations of this article.

Abstract

This paper describes the trajectory learning component of a programming by demonstration (PbD) system for manipulation tasks. In case of multiple user demonstrations, the proposed approach clusters a set of hand trajectories and recovers smooth robot trajectories overcoming sensor noise and human motion inconsistency problems. More specifically, we integrate a geometric approach for trajectory clustering with a stochastic procedure for trajectory evaluation based on hidden Markov models. Furthermore, we propose a method for human hand trajectory reconstruction with NURBS curves by means of a best-fit data smoothing algorithm. Some experiments show the viability and effectiveness of the approach.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

Error loading document authors.

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free