SuPLE: Robot Learning with Lyapunov Rewards
Phu Nguyen, Daniel Polani, Stas Tiomkin

TL;DR
SuPLE leverages Lyapunov exponents to create system-appropriate rewards for robot learning, reducing reliance on domain knowledge and auxiliary exploration, thus improving stabilization tasks in dynamical systems.
Contribution
This paper introduces SuPLE, a novel reward function based on Lyapunov exponents, enabling effective robot learning without arbitrary initial states or domain-specific reward engineering.
Findings
SuPLE outperforms traditional rewards in stabilization tasks.
Eliminates the need for auxiliary exploration in training.
Effective on classical dynamical system benchmarks.
Abstract
The reward function is an essential component in robot learning. Reward directly affects the sample and computational complexity of learning, and the quality of a solution. The design of informative rewards requires domain knowledge, which is not always available. We use the properties of the dynamics to produce system-appropriate reward without adding external assumptions. Specifically, we explore an approach to utilize the Lyapunov exponents of the system dynamics to generate a system-immanent reward. We demonstrate that the `Sum of the Positive Lyapunov Exponents' (SuPLE) is a strong candidate for the design of such a reward. We develop a computational framework for the derivation of this reward, and demonstrate its effectiveness on classical benchmarks for sample-based stabilization of various dynamical systems. It eliminates the need to start the training trajectories at arbitrary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Advanced Control Systems Optimization · Neural Networks and Applications
