Task-Parameterized Motion Learning With Time-Sensitive Constraints

Teaching motion skills to robots through demonstrations has becomes widely popular. However, precise execution of start-, via-, and end-poses at given times is often not guaranteed, limiting the technology transfer to industrial application. To address this issue, we propose the novel <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Constrained Expectation Maximization</i> (CEM) algorithm, which enforces <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">time-sensitive constraints</i> (TSC) when learning Gaussian Mixture Models (GMM). Our approach applies to data on Riemannian manifolds and extends to task-parameterized scenarios. We validate CEM against state-of-the-art methods on handwritten data and real robot applications utilizing the KUKA LBR iiwa. By enforcing constraints within the learning process, CEM achieves improved and more efficient reproduction of the demonstration data.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-09-17
DOI
https://doi.org/10.1109/lra.2025.3611083
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Task-Parameterized Motion Learning With Time-Sensitive Constraints

J. Neal Richter, Niels Dehio, Christian Scheurer, Jochen J. Steil et al.
IEEE Robotics and Automation Letters
Robotic Mechanisms and Dynamics
article

Task-Parameterized Motion Learning With Time-Sensitive Constraints

J. Neal Richter, Niels Dehio, Christian Scheurer, Jochen J. Steil, João Oliveira
article en

Abstract

Teaching motion skills to robots through demonstrations has becomes widely popular. However, precise execution of start-, via-, and end-poses at given times is often not guaranteed, limiting the technology transfer to industrial application. To address this issue, we propose the novel <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Constrained Expectation Maximization</i> (CEM) algorithm, which enforces <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">time-sensitive constraints</i> (TSC) when learning Gaussian Mixture Models (GMM). Our approach applies to data on Riemannian manifolds and extends to task-parameterized scenarios. We validate CEM against state-of-the-art methods on handwritten data and real robot applications utilizing the KUKA LBR iiwa. By enforcing constraints within the learning process, CEM achieves improved and more efficient reproduction of the demonstration data.

IEEE Robotics and Automation LettersVol. 10(11)
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento (PT), KUKA (Germany) (DE), Technische Universität Braunschweig (DE)
Openalex Percentile: Top 69%
Robotic Mechanisms and Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.