mlsanityData to 14 Oct 2026

Total Energy Shaping with Neural Interconnection and Damping Assignment -- Passivity Based Control

arXiv 2112.12999 ↗First posted 24 Dec 2021eess.SY cs.LG cs.ROcited by 5

Not on the map. Why?

Abstract (arXiv)

In this work we exploit the universal approximation property of Neural Networks (NNs) to design interconnection and damping assignment (IDA) passivity-based control (PBC) schemes for fully-actuated mechanical systems in the port-Hamiltonian (pH) framework. To that end, we transform the IDA-PBC method into a supervised learning problem that solves the partial differential matching equations, and fulfills equilibrium assignment and Lyapunov stability conditions. A main consequence of this, is that the output of the learning algorithm has a clear control-theoretic interpretation in terms of passivity and Lyapunov stability. The proposed control design methodology is validated for mechanical systems of one and two degrees-of-freedom via numerical simulations.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 8 of its 20 references that are in the map. First posted on arXiv 24 Dec 2021.

Builds on

8 of 20 references.

References · 8

  1. 2017Physics Informed Deep Learning (Part I): Data-driven Solutions of Nonlinear Partial Differential Equationscited by 373
  2. 2017Physics Informed Deep Learning (Part II): Data-driven Discovery of Nonlinear Partial Differential Equationscited by 161
  3. 2020Neural Lyapunov Controlcited by 142
  4. 2018The Lyapunov Neural Network: Adaptive Stability Certification for Safe Learning of Dynamical Systemscited by 88
  5. 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
  6. 2021Stabilizing Neural Control Using Self-Learned Almost Lyapunov Criticscited by 35
  7. 2020Computing Lyapunov functions using deep neural networkscited by 14
  8. 2021Optimal Energy Shaping via Neural Approximatorscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 0; 2026: 1.

5 papers.