mlsanityData to 7 Oct 2026

RMP2: A Structured Composable Policy Class for Robot Learning

arXiv 2103.05922 ↗First posted 10 Mar 2021cs.RO cs.LG cs.SYcited by 8

Not on the map. Why?

Abstract (arXiv)

We consider the problem of learning motion policies for acceleration-based robotics systems with a structured policy class specified by RMPflow. RMPflow is a multi-task control framework that has been successfully applied in many robotics problems. Using RMPflow as a structured policy class in learning has several benefits, such as sufficient expressiveness, the flexibility to inject different levels of prior knowledge as well as the ability to transfer policies between robots. However, implementing a system for end-to-end learning RMPflow policies faces several computational challenges. In this work, we re-examine the message passing algorithm of RMPflow and propose a more efficient alternate algorithm, called RMP2, that uses modern automatic differentiation tools (such as TensorFlow and PyTorch) to compute RMPflow policies. Our new design retains the strengths of RMPflow while bringing in advantages from automatic differentiation, including 1) easy programming interfaces to designing complex transformations; 2) support of general directed acyclic graph (DAG) transformation structures; 3) end-to-end differentiability for policy learning; 4) improved computational efficiency. Because of these features, RMP2 can be treated as a structured policy class for efficient robot learning which is suitable encoding domain knowledge. Our experiments show that using structured policy class given by RMP2 can improve policy performance and safety in reinforcement learning tasks for goal reaching in cluttered space.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 10 Mar 2021.

Builds on

23 of 39 references.

References · 23

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  3. 2018Residual Reinforcement Learning for Robot Controlcited by 242
  4. 2018Safe Exploration in Continuous Action Spacescited by 237
  5. 2019Lyapunov-based Safe Policy Optimization for Continuous Controlcited by 140
  6. 2014Reinforcement and Imitation Learning via Interactive No-Regret Learningcited by 116
  7. 2020Reinforcement Learning for Safety-Critical Control under Model Uncertainty, using Control Lyapunov Functions and Control Barrier Functionscited by 61
  8. 2018Riemannian Motion Policiescited by 45
  9. 2020ImitationFlow: Learning Deep Stable Stochastic Dynamic Systems by Normalizing Flowscited by 33
  10. 2020Euclideanizing Flows: Diffeomorphic Reduction for Learning Stable Dynamical Systemscited by 32
  11. 2017Real-time Perception meets Reactive Motion Generationcited by 30
  12. 2018RMPflow: A Computational Graph for Automatic Motion Policy Generationcited by 18
11 more
  1. 2019Representing Robot Task Plans as Robust Logical-Dynamical Systemscited by 15
  2. 2020Learning Vision-based Reactive Policies for Obstacle Avoidancecited by 10
  3. 2020RMPflow: A Geometric Framework for Generation of Multi-Task Motion Policiescited by 7
  4. 2019Neural Autonomous Navigation with Riemannian Motion Policycited by 6
  5. 2019Riemannian Motion Policy Fusion through Learnable Lyapunov Function Reshapingcited by 6
  6. 2020Reinforcement Learning Experiments and Benchmark for Solving Robotic Reaching Taskscited by 5
  7. 2020Joint Space Control via Deep Reinforcement Learningcited by 4
  8. 2018Learning Latent Space Dynamics for Tactile Servoingcited by 3
  9. 2019Multi-Objective Policy Generation for Multi-Robot Systems Using Riemannian Motion Policiescited by 2
  10. 2019Stable, Concurrent Controller Composition for Multi-Objective Robotic Taskscited by 1
  11. 2020Towards Coordinated Robot Motions: End-to-End Learning of Motion Policies on Transform Treescited by 1

Built on by

Cited by year (2026 to 7 Oct)

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

8 papers.