Home /Research /Trajectory clustering and stochastic approximation for robot programming by demonstration
MANIPULATION

Trajectory clustering and stochastic approximation for robot programming by demonstration

Jacopo Aleotti, Stefano Caselli

Year
2005
Citations
40

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.

Keywords

TrajectoryCluster analysisComputer scienceSmoothingRobotProgramming by demonstrationComponent (thermodynamics)Noise (video)Artificial intelligenceHidden Markov model

Related papers

Browse all MANIPULATION papers