Home /Research /Small-variance asymptotics for non-parametric online robot learning
HRI

Small-variance asymptotics for non-parametric online robot learning

Ajay Kumar Tanwani, Sylvain Calinon

Year
2018
Citations
10

Abstract

Small-variance asymptotics is emerging as a useful technique for inference in large-scale Bayesian non-parametric mixture models. This paper analyzes the online learning of robot manipulation tasks with Bayesian non-parametric mixture models under small-variance asymptotics. The analysis yields a <i>scalable online sequence clustering</i> (SOSC) algorithm that is non-parametric in the number of clusters and the subspace dimension of each cluster. SOSC groups the new datapoint in low-dimensional subspaces by online inference in a non-parametric <i>mixture of probabilistic principal component analyzers</i> (MPPCA) based on a Dirichlet process, and captures the state transition and state duration information online in a <i>hidden semi-Markov model</i> (HSMM) based on a hierarchical Dirichlet process. A task-parameterized formulation of our approach autonomously adapts the model to changing environmental situations during manipulation. We apply the algorithm in a teleoperation setting to recognize the intention of the operator and remotely adjust the movement of the robot using the learned model. The generative model is used to synthesize both time-independent and time-dependent behaviors by relying on the principles of shared and autonomous control. Experiments with the Baxter robot yield parsimonious clusters that adapt online with new demonstrations and assist the operator in performing remote manipulation tasks.

Keywords

Variance (accounting)RobotParametric statisticsComputer scienceArtificial intelligenceOnline learningMathematicsStatisticsEconomicsMultimedia

Related papers

Browse all HRI papers