Literature
Display
← All papers

Scalable Learning of High-Dimensional Demonstrations with Composition of Linear Parameter Varying Dynamical Systems

Agrawal, Shreenabh · Kussaba, Hugo T. M. · Chen, Lingyun · Binny, Allen Emmanuel · Swikir, Abdalla · Jagtap, Pushpak · Haddadin, Sami

· IEEE/RSJ International Conference on Intelligent Robots and Systems 2025 ↗

Robotics4 min text · CondensedOriginal paper ↗
Contents

At a glance

A compositional method learns stable linear parameter-varying dynamical systems (LPV-DS) from high-dimensional demonstrations. It fits smaller interconnected subsystems, then searches for a global stability certificate. Seven-dimensional robot-joint examples become tractable where the tested monolithic optimization fails, and a physical arm tracks the learned motions.

I Introduction

Joint-space learning can preserve demonstrated coordination and orientation without inverse kinematics, but stable LPV-DS fitting becomes numerically difficult as dimension grows. The proposed divide-and-conquer method retains the joint coordinates, partitions the dynamics into coupled subsystems, and certifies their interconnection. It targets the bilinear matrix inequalities (BMIs) that make direct fitting nonconvex.

Original figure
Fig. 1: Our proposed approach consists of three main steps: subsystem decomposition, subsystem-level optimization and compositional construction of the DS and of the Lyapunov function certifying its stability.

II Preliminaries

States are concatenations of subsystem coordinates. Symmetric matrix inequalities express positivity, while the interconnection matrix specifies which coordinates serve as inputs to each subsystem.

II-A Learning Stable Dynamical Systems

Demonstrated position–velocity pairs define a regression objective with a chosen equilibrium and Lyapunov decrease constraints. An LPV model combines local linear dynamics through Gaussian mixture model (GMM) weights. Searching jointly for dynamics and a general quadratic Lyapunov function gives expressive models but introduces nonconvex bilinear constraints.

Equations 1–5
x˙​(t)=f​(x​(t)),\dot{x}(t)=f(x(t)), (1)
min⁡∑k=1Mf⁡‖x~˙(k)−f⁡(x~(k))‖2,\min_{f}\,\,\sum\nolimits_{k=1}^{M}\|{\dot{\tilde{x}}^{(k)}}-f({\tilde{x}}^{(k)})\|^{2}, (2a)
such that
f⁡(0)=0,\displaystyle f(0)=0, (2b)
δ¯​‖x‖2≤V⁡(x)≤δ¯​‖x‖2,\displaystyle\underline{\delta}\|x\|^{2}\leq V(x)\leq\overline{\delta}\|x\|^{2}, ∀x∈ℝn,\displaystyle\hskip 30.00005pt\forall x\in\mathbb{R}^{n}, (2c)
V˙​(x):=∂V⁡(x)∂x​f​(x)≤−ξ​V​(x),\displaystyle\dot{V}(x):=\frac{\partial{V(x)}}{\partial{x}}f(x)\leq-\xi V(x), ∀x∈ℝn.\displaystyle\hskip 30.00005pt\forall x\in\mathbb{R}^{n}. (2d)
f⁡(x)=∑k=1Kγk​(x)​𝐀k​x,f(x)=\sum\nolimits_{k=1}^{K}\nolimits\gamma_{k}(x)\,\mathbf{A}_{k}\,x, (3)
γk​(𝐱)≔πk​p​(𝐱|k)∑jπj​p​(𝐱|j),\gamma_{k}(\mathbf{x})\coloneqq\frac{\pi_{k}\,p(\mathbf{x}|k)}{\sum\nolimits_{j}\pi_{j}\,p(\mathbf{x}|j)}, (4)
x˙​(t)=∑k=1Kγk​(x)​𝐀k​x,\dot{x}(t)=\sum\nolimits_{k=1}^{K}\nolimits\gamma_{k}(x)\,\mathbf{A}_{k}\,x, (5)

II-B Interconnected Systems

Each subsystem has its own state and internal inputs. A fixed interconnection matrix couples these inputs to the other subsystem states. The resulting vector field is assembled from all local vector fields; subsystem fitting alone does not establish stability of the interconnected model.

Equations 6–8
Ψi:{x˙i​(t)=fi​(xi​(t),wi​(t)),yi​(t)=xi​(t),\Psi_{i}\colon\left\{\hskip-4.2679pt\begin{array}[]{l}\dot{x}_{i}(t)=f_{i}(x_{i}(t),w_{i}(t)),\\ y_{i}(t)=x_{i}(t),\\ \end{array}\right.\quad (6)
Ψ:x˙​(t)=f​(x​(t)),\Psi\colon\dot{x}(t)=f({x}(t)), (7)
f⁡(x)≔[f1​(x1,w1);…;fN​(xN,wN)].f(x)\coloneq[f_{1}(x_{1},w_{1});\dots;f_{N}(x_{N},w_{N})].
[w1;…​…;wN]=M⁡[x1;…;xN].[{w_{1};\ldots\ldots;w_{N}}]=M[x_{1};\ldots;x_{N}]. (8)

III Compositional Framework

Each local optimization fits demonstration velocities together with a sub-Lyapunov function and a matrix describing its interaction with other subsystems. Theorem 1 gives sufficient global coupling conditions so a weighted sum of these functions certifies the full system. Theorem 2 expresses local conditions as linear and bilinear matrix inequalities for LPV subsystems. The retained algorithm fits GMMs, solves the local problems, and then finds the global certificate. The decomposition is chosen manually and can affect accuracy and computation; automated selection remains future work.

Equations 9a–23
min⁡∑k=1Mfi⁡‖x~˙i(k)−fi​(x~i(k),w~i(k))‖2,\min_{f_{i}}\,\,\sum\nolimits_{k=1}^{M}\|{{\dot{\tilde{x}}_{i}^{(k)}}}-f_{i}({\tilde{x}_{i}}^{(k)},{{\tilde{w}_{i}}^{(k)}})\|^{2}, (9a)
such that
fi​(0,0)=0,\displaystyle f_{i}(0,0)=0, (9b)
δ¯i​‖xi‖2≤Vi​(xi)≤δ¯i​‖xi‖2,\displaystyle\underline{\delta}_{i}\|x_{i}\|^{2}\leq V_{i}(x_{i})\leq\overline{\delta}_{i}\|x_{i}\|^{2}, (9c)
∂Vi​(xi)∂xi​fi​(xi,wi)≤−ξi​Vi​(xi)+\displaystyle\frac{\partial{V_{i}(x_{i})}}{\partial{x_{i}}}f_{i}(x_{i},w_{i})\leq-\xi_{i}V_{i}(x_{i})+
[wixi]T​[Di11Di12Di21Di22]⏟Di​[wixi],\displaystyle\quad\quad\left[\begin{array}[]{c}w_{i}\\ x_{i}\end{array}\right]^{T}\underbrace{\left[\begin{array}[]{ll}D^{11}_{i}&D^{12}_{i}\\ D^{21}_{i}&D^{22}_{i}\end{array}\right]}_{D_{i}}\left[\begin{array}[]{c}w_{i}\\ x_{i}\end{array}\right],
[MIn]T​𝐃​(μ1​D1,…,μN​DN)​[MIn]⪯0,\displaystyle{\left[\begin{array}[]{c}M\\ I_{n}\end{array}\right]^{T}\mathbf{D}\left(\mu_{1}D_{1},\ldots,\mu_{N}D_{N}\right)\left[\begin{array}[]{c}M\\ I_{n}\end{array}\right]\preceq 0,}
𝐃⁡(μ1​D1,…,μN​DN):=\displaystyle\mathbf{D}\left(\mu_{1}D_{1},\ldots,\mu_{N}D_{N}\right):=
[μ1​D111μ1​D112⋱⋱μN​DN11μN​DN12μ1​D121μ1​D122⋱⋱μN​DN21μN​DN22].\displaystyle{\left[\begin{array}[]{llllll}\mu_{1}D_{1}^{11}&&&\mu_{1}D_{1}^{12}&&\\ &\ddots&&&\ddots&\\ &&\mu_{N}D_{N}^{11}&&&\mu_{N}D_{N}^{12}\\ \mu_{1}D_{1}^{21}&&&\mu_{1}D_{1}^{22}&&\\ &\ddots&&&\ddots&\\ &&\mu_{N}D_{N}^{21}&&&\mu_{N}D_{N}^{22}\end{array}\right].}
V⁡(x)≔∑i=1Nμi​Vi​(xi),V(x)\coloneq\sum\nolimits_{i=1}^{N}\mu_{i}V_{i}(x_{i}), (20)
fi​(xi,wi)=∑k=1Kγk​(xi)​(Ak​i​xi+Bk​i​wi),f_{i}(x_{i},w_{i})=\sum\nolimits_{k=1}^{K}\gamma_{k}(x_{i})(A_{ki}x_{i}+B_{ki}w_{i}), (21)
δ¯i​Ini⪯Pi⪯δ¯i​Ini,\underline{\delta}_{i}I_{n_{i}}\preceq P_{i}\preceq\overline{\delta}_{i}I_{n_{i}}, (22)
[−Di11Bk​iT​Pi−Di12⋆ξi​Pi+Ak​iT​Pi+Pi​Ak​i−Di22]≺0.\begin{bmatrix}-D_{i}^{11}&B_{ki}^{T}P_{i}-D_{i}^{12}\\ \star&\xi_{i}P_{i}+A_{ki}^{T}P_{i}+P_{i}A_{ki}-D_{i}^{22}\end{bmatrix}\prec 0. (23)
Algorithm 1 Proposed Framework
Input: Demonstrated data {(x~(k),x~˙(k))}k=1M\{(\tilde{x}^{(k)},\dot{\tilde{x}}^{(k)})\}_{k=1}^{M}
Output: Dynamics ff and Lyapunov function VV
Initialize: Shift equilibrium point to origin;
Subsystem Decomposition
   Choose subsystem configuration and specify connections defining the matrix M{\color[rgb]{0.75,0.5,0.25}M}:
   [w1;…;wN]=M⁡[x1;…;xN][{w_{1};\ldots;w_{N}}]={\color[rgb]{0.75,0.5,0.25}M}[x_{1};\ldots;x_{N}];
   for each subsystem Ψi\Psi_{i} do
      Obtain (x~i(k),x~˙i(k))k=1M{({\tilde{x}_{i}}^{(k)},{{\dot{\tilde{x}}_{i}^{(k)}}})_{k=1}^{M}} by projecting x~(k){\tilde{x}}^{(k)} and x~˙(k){\dot{\tilde{x}}^{(k)}} onto XiX_{i}.
      Learn GMM parameters of γk{\color[rgb]{1,0,0}\gamma_{k}} as in [23].;
Subsystem Optimization (Theorem 2)
   for each subsystem Ψi\Psi_{i} do
      Minimize (9a) subject to (21)–(23) to find Ak​i{\color[rgb]{1,0,1}A_{ki}}, Bk​i{\color[rgb]{1,0,1}B_{ki}}, Pi{\color[rgb]{0.18,0.545,0.34}P_{i}}, Di11D_{i}^{11}, Di12D_{i}^{12}, Di22D_{i}^{22};
Compositional Construction (Theorem 1)
   Replace the numerical values of the found matrices M{\color[rgb]{0.75,0.5,0.25}M} and DiD_{i} in the quadratic inequality (3) and find μi{\color[rgb]{0,0,0.5}\mu_{i}} that satisfy this constraint ;
   Let
   fi​(xi,wi)=∑k=1Kγk​(xi)​(Ak​i​xi+Bk​i​wi){\color[rgb]{1,0.04,0.61}f_{i}}(x_{i},w_{i})=\sum\nolimits_{k=1}^{K}{\color[rgb]{1,0,0}\gamma_{k}}(x_{i})({\color[rgb]{1,0,1}A_{ki}}x_{i}+{\color[rgb]{1,0,1}B_{ki}}w_{i}) ;
   Vi​(xi)=xi⊤​Pi​xi{\color[rgb]{0,0.6,0}{V}_{i}}(x_{i})=x_{i}^{\top}{\color[rgb]{0.18,0.545,0.34}P_{i}}x_{i};
   Define the interconnected system dynamics f⁡(x)f(x) and Lyapunov function V⁡(x)V(x) as:;
   f⁡(x)=[f1​(x1,w1);…;fN​(xN,wN)]f(x)=[{\color[rgb]{1,0.04,0.61}f_{1}}(x_{1},w_{1});\dots;{\color[rgb]{1,0.04,0.61}f_{N}}(x_{N},w_{N})], ;
   V⁡(x)=∑i=1Nμi​Vi​(xi)V(x)=\sum\nolimits_{i=1}^{N}{\color[rgb]{0,0,0.5}\mu_{i}}{\color[rgb]{0,0.6,0}V_{i}}(x_{i})

IV Simulation

Two seven-dimensional joint-space datasets are fitted in MATLAB R2024a using YALMIP and PENLAB on an Apple M2 MacBook Pro with 8 GB of memory. Results concern these datasets and solver configurations, rather than a universal complexity or convergence bound.

IV-A Example 1: Individual Joint Subsystems

Using one subsystem per joint, local optimization takes about 92 seconds and composition another 9 seconds. Table I reports mean squared error 2.76 in 101 seconds, versus 3.39 in 72.35 seconds for the stable neural dynamical system baseline (SNDS). The monolithic LPV-DS solver does not converge in this example. The compositional method is therefore more accurate here, but not faster than SNDS.

Original figure
Fig. 2: Comparison between demonstrated trajectories (red) in the joint-space and a generated trajectory (blue) from the learned DS using our proposed algorithm with the interconnection defined in Example 1.

IV-B Example 2: Flexible Subsystem Structure

A second hand-selected coupling structure models a more curved trajectory. Table I reports error 0.37 in 146.32 seconds, versus SNDS error 7.00 in 559.66 seconds after 1,000 epochs; the 150-epoch neural run and monolithic LPV-DS fit fail. The prose gives a slightly different 146.36-second runtime, so the table value is used here.

TABLE I: Comparison of mean squared error (MSE) and run time in seconds. The symbol ×\times indicates the learning method failed to produce a stable DS due to numerical error or solver failure.
Simulation Method MSE Run Time (s)
Example 1 Compositional 2.76 101
LPV-DS ×\times ×\times
SNDS (150 epochs) 3.39 72.35
Example 2 Compositional 0.37 146.32
LPV-DS ×\times ×\times
SNDS (150 epochs) ×\times ×\times
SNDS (1000 epochs) 7.00 559.66
Original figure
Fig. 3: Interconnection between subsystems in Example 2.
Original figure
Fig. 4: Comparison between demonstrated trajectories (red) in the joint-space and a generated trajectory (blue) from the learned DS using our proposed algorithm with the interconnection defined in Example 2.

V Experiment

A seven-degree-of-freedom Franka Emika arm tracks the learned joint velocities through its internal joint impedance controller. The Franka Control Interface (FCI) runs at 1 kHz on an Intel i5 workstation with a real-time Linux kernel.

V-A Experiment 1

The first physical experiment reproduces a nonlinear motion with varying end-effector position and orientation. Recorded trajectories closely follow the demonstrations, illustrating the benefit of learning coordinated joint motion directly.

Refer to caption
Fig. 5: Experimental setup corresponding to Experiment 1. The task is to move the end effector sequentially through poses \raisebox{-0.9pt}{1}⃝ to \raisebox{-0.9pt}{6}⃝, matching the pose shown in the corresponding snapshots.
Refer to caption
Fig. 6: Reference trajectories (red), DS-generated trajectory (blue), and trajectory executed by the DS-controlled robot (black) are shown in the task space, along with orientations using RGB stick axes.

V-B Experiment 2

The second dataset demonstrates extracting an object from a box along a curved path. The learned model reproduces the motion while avoiding the walls in the shown experiment. Stability toward an equilibrium does not itself certify obstacle avoidance everywhere; the paper does not establish a general collision-safety guarantee for this learned field.

Refer to caption
Fig. 7: Experimental setup corresponding to Experiment 2. The task is to move the end effector sequentially through poses \raisebox{-0.8pt}{1}⃝ to \raisebox{-0.8pt}{6}⃝, matching the pose shown in the corresponding snapshots.
Refer to caption
Fig. 8: Reference trajectories (red), DS-generated trajectory (blue), and trajectory executed by the DS-controlled robot (black) are shown in the task space.

VI Conclusion

Decomposing the nonconvex fit makes these high-dimensional LPV models practical to learn in minutes. The method still relies on successful numerical local solves and a feasible interconnection certificate. The experiments demonstrate seven-dimensional scalability and reproduction of two motions; broader scaling and automatic decomposition are open.

Appendix A

The appendix proves the composition and LPV matrix-inequality results under their stated assumptions.

Proof of Theorem 1

The demonstration-fitting objective separates by subsystem coordinates. Bounds on local sub-Lyapunov functions and the coupling inequality then establish a positive global Lyapunov function and a negative derivative for the interconnected dynamics.

Equations
∑k=1M‖x~˙(k)−f⁡(x~(k))‖2=∑k=1M‖x~˙1(k)−f1​(x~1(k),w~1(k))‖2\displaystyle\textstyle\sum\nolimits_{k=1}^{M}\|{\dot{\tilde{x}}^{(k)}}-f({\tilde{x}}^{(k)})\|^{2}=\textstyle\sum\nolimits_{k=1}^{M}\|{{\dot{\tilde{x}}_{1}^{(k)}}}-f_{1}(\tilde{x}_{1}^{(k)},\tilde{w}_{1}^{(k)})\|^{2}
+⋯+∑k=1M‖x~˙N(k)−fN​(x~N(k),w~N(k))‖2,\displaystyle+\dots+\textstyle\sum\nolimits_{k=1}^{M}\|{{\dot{\tilde{x}}_{N}^{(k)}}}-f_{N}(\tilde{x}_{N}^{(k)},\tilde{w}_{N}^{(k)})\|^{2},
∑i=1Nδ¯i​‖xi‖2≤∑i=1NVi​(xi)≤∑i=1Nδ¯i​‖xi‖2,\displaystyle\sum\nolimits_{i=1}^{N}\underline{\delta}_{i}\|x_{i}\|^{2}\leq\sum\nolimits_{i=1}^{N}V_{i}(x_{i})\leq\sum\nolimits_{i=1}^{N}\overline{\delta}_{i}\|x_{i}\|^{2},
δ¯​‖x‖2≤V⁡(x)≤δ¯​‖x‖2,\displaystyle\underline{\delta}\|x\|^{2}\leq V(x)\leq\overline{\delta}\|x\|^{2},
V˙​(x)=∑i=1Nμi​V˙i​(xi)\displaystyle\dot{V}(x)=\sum\nolimits_{i=1}^{N}\mu_{i}\dot{V}_{i}(x_{i})
≤∑i=1N−μiξiVi(xi)+μi[wixi]T[Di11Di12Di21Di22][wixi]\displaystyle\leq\sum\nolimits_{i=1}^{N}-\mu_{i}\xi_{i}V_{i}(x_{i})\!+\!\mu_{i}\left[\begin{array}[]{c}w_{i}\\ x_{i}\end{array}\right]^{T}\!\!\left[\begin{array}[]{cc}D_{i}^{11}&D_{i}^{12}\\ D_{i}^{21}&D_{i}^{22}\end{array}\right]\!\!\left[\begin{array}[]{c}w_{i}\\ x_{i}\end{array}\right]
≤∑i=1N−μiξiVi(xi)+\displaystyle\leq\sum\nolimits_{i=1}^{N}-\mu_{i}\xi_{i}V_{i}(x_{i})+
[x1⋮xN]T​[MIn]T​𝐃​(μ1​D1,…,μN​DN)​[MIn]​[x1⋮xN]\displaystyle\left[\begin{array}[]{c}x_{1}\\ \vdots\\ x_{N}\end{array}\right]^{T}\!\!\left[\begin{array}[]{c}M\\ I_{n}\end{array}\right]^{T}\!\mathbf{D}(\mu_{1}D_{1},\ldots,\mu_{N}D_{N})\left[\begin{array}[]{c}M\\ I_{n}\end{array}\right]\!\!\left[\begin{array}[]{c}x_{1}\\ \vdots\\ x_{N}\end{array}\right]
≤∑i=1N−μiξiVi(xi).\displaystyle\leq\sum\nolimits_{i=1}^{N}-\mu_{i}\xi_{i}V_{i}(x_{i}).

Proof of Theorem 2

Substituting quadratic sub-Lyapunov functions converts the required bounds into matrix inequalities. Each local linear component satisfies the derivative condition, and nonnegative GMM weights preserve it when the components are mixed.

Equations 24–25
δ¯i​‖xi‖2≤xi⊤​Pi​xi≤δ¯i​‖xi‖2,∀xi∈Xi.\underline{\delta}_{i}\|x_{i}\|^{2}\leq x_{i}^{\top}P_{i}x_{i}\leq\overline{\delta}_{i}\|x_{i}\|^{2},\quad\forall x_{i}\in X_{i}.
2​xiT​Pi​Ak​i​xi+2​xiT​Pi​Bk​i​wi≤\displaystyle 2x_{i}^{T}P_{i}A_{ki}x_{i}+2x_{i}^{T}P_{i}B_{ki}w_{i}\leq (24)
−ξi​xiT​Pi​xi+wiT​Di11​wi+2​wiT​Di12​xi+xiT​Di22​xi,\displaystyle-\xi_{i}x_{i}^{T}P_{i}x_{i}+w_{i}^{T}D_{i}^{11}w_{i}+2w_{i}^{T}D_{i}^{12}x_{i}+x_{i}^{T}D_{i}^{22}x_{i},
∑k=1Kγk​(xi)=1​ and ​γk​(xi)>0\sum\nolimits_{k=1}^{K}\gamma_{k}(x_{i})=1\text{ and }\gamma_{k}(x_{i})>0 (25)
2​xiT​Pi​∑k=1Kγk​(xi)​(Ak​i​xi+Bk​i​wi)≤\displaystyle 2x_{i}^{T}P_{i}\sum\nolimits_{k=1}^{K}\gamma_{k}(x_{i})(A_{ki}x_{i}+B_{ki}w_{i})\leq
−ξi​xiT​Pi​xi+wiT​Di11​wi+2​wiT​Di12​xi+xiT​Di22​xi,\displaystyle-\xi_{i}x_{i}^{T}P_{i}x_{i}+w_{i}^{T}D_{i}^{11}w_{i}+2w_{i}^{T}D_{i}^{12}x_{i}+x_{i}^{T}D_{i}^{22}x_{i},
Concept demonstration

Open image ↗