Confidence-Based Skill Reproduction Through Perturbation Analysis
Brendan Hertel, S. Reza Ahmadzadeh
TL;DR
This work introduces a convex elastic-map formulation for Learning from Demonstration, enabling trajectory reproductions with a tunable confidence metric derived from perturbation analysis and Lagrangian duality. By framing the LfD problem as a constrained convex optimization with elastic-map energies, the authors derive primal and dual forms and show how constraint perturbations reveal the sensitivity of the optimal solution, which in turn defines confidence levels. The method supports constraint pruning by removing inactive constraints (where the dual variable is zero) and allows adjustable trade-offs between smoothness and constraint satisfaction, demonstrated through simulated via-point and obstacle tasks as well as a real-world door-opening with a Kinova Jaco2. The results suggest practical benefits for robust, explainable skill reproduction under varying constraints, with potential for online adaptation and handling non-stationary environments in future work.
Abstract
Several methods exist for teaching robots, with one of the most prominent being Learning from Demonstration (LfD). Many LfD representations can be formulated as constrained optimization problems. We propose a novel convex formulation of the LfD problem represented as elastic maps, which models reproductions as a series of connected springs. Relying on the properties of strong duality and perturbation analysis of the constrained optimization problem, we create a confidence metric. Our method allows the demonstrated skill to be reproduced with varying confidence level yielding different levels of smoothness and flexibility. Our confidence-based method provides reproductions of the skill that perform better for a given set of constraints. By analyzing the constraints, our method can also remove unnecessary constraints. We validate our approach using several simulated and real-world experiments using a Jaco2 7DOF manipulator arm.
