A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
Sylvain Calinon, Aude Billard
- Year
- 2008
- Citations
- 109
Abstract
We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a programming by demonstration (PbD) framework and for generalizing the acquired knowledge to various situations. In previous work, we proposed an approach based on Gaussian mixture regression (GMR) to find a controller for the robot reproducing the essential characteristics of a skill in joint space and in task space through Lagrange optimization. In this paper, we extend this approach to a more generic procedure handling simultaneously constraints in joint space and in task space by combining directly the probabilistic representation of the task constraints with a simple Jacobian-based inverse kinematics solution. Experiments with two 5-DOFs Katana robots are presented with manipulation tasks that consist of handling and displacing a set of objects.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002