PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 16, 20250 citationsOpen Access

Learning Lie Group Generators from Trajectories

View Full Paper
LHLiqun Hu

Key Points

  • The method accurately reconstructs latent generators from discretized trajectories, improving recovery methods.
  • Using a feedforward neural network, the system maps discrete increments to constant generators in various lie groups.
  • The approach validates strong empirical accuracy under both clean and noisy conditions across tested groups.
  • Data-driven techniques for generator recovery may enable new applications in robotics and motion planning.

Abstract

This work investigates the inverse problem of generator recovery in matrix Lie groups from discretized trajectories. Let G be a real matrix Lie group and g = Lie (G) its corresponding Lie algebra. A smooth trajectory (t) generated by a fixed Lie algebra element g follows the exponential flow (t) = g₀ (t). The central task addressed in this work is the reconstruction of such a latent generator from a discretized sequence of poses \g₀, g₁, , gT\ G, sampled at uniform time intervals. This problem is formulated as a data-driven regression from normalized sequences of discrete Lie algebra increments (gₓ^-1 gₓ+₁) to the constant generator g. A feedforward neural network is trained to learn this mapping across several groups, including SE (2), SE (3), SO (3), and SL (2, R). It demonstrates strong empirical accuracy under both clean and noisy conditions, which validates the viability of data-driven recovery of Lie group generators using shallow neural architectures. This is Lie-RL GitHub Repo https: //github. com/Anormalm/LieRL-on-Trajectories. Feel free to make suggestions and collaborations!

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Liqun Hu (2025) studied this question.

synapsesocial.com/papers/68f147cc724575985c3fcfc4https://doi.org/10.48550/arxiv.2504.03220
Ask AI
Helpful
Bookmark
Share
View Full Paper