ProDMPs: A Unified Perspective on Dynamic and Probabilistic Movement
Primitives
- URL: http://arxiv.org/abs/2210.01531v1
- Date: Tue, 4 Oct 2022 11:20:20 GMT
- Title: ProDMPs: A Unified Perspective on Dynamic and Probabilistic Movement
Primitives
- Authors: Ge Li (1), Zeqi Jin (1), Michael Volpp (1), Fabian Otto (2 and 3),
Rudolf Lioutikov (1), and Gerhard Neumann (1) ((1) Karlsruhe Institute of
Technology, (2) Bosch Center for Artificial Intelligence, (3) University of
Tuebingen)
- Abstract summary: Movement Primitives (MPs) are a well-known concept to represent and generate modular trajectories.
MPs can be broadly categorized into two types: Dynamic Movement Primitives (DMPs) and Probabilistic Movement Primitives (ProMPs)
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Movement Primitives (MPs) are a well-known concept to represent and generate
modular trajectories. MPs can be broadly categorized into two types: (a)
dynamics-based approaches that generate smooth trajectories from any initial
state, e. g., Dynamic Movement Primitives (DMPs), and (b) probabilistic
approaches that capture higher-order statistics of the motion, e. g.,
Probabilistic Movement Primitives (ProMPs). To date, however, there is no
method that unifies both, i. e. that can generate smooth trajectories from an
arbitrary initial state while capturing higher-order statistics. In this paper,
we introduce a unified perspective of both approaches by solving the ODE
underlying the DMPs. We convert expensive online numerical integration of DMPs
into basis functions that can be computed offline. These basis functions can be
used to represent trajectories or trajectory distributions similar to ProMPs
while maintaining all the properties of dynamical systems. Since we inherit the
properties of both methodologies, we call our proposed model Probabilistic
Dynamic Movement Primitives (ProDMPs). Additionally, we embed ProDMPs in deep
neural network architecture and propose a new cost function for efficient
end-to-end learning of higher-order trajectory statistics. To this end, we
leverage Bayesian Aggregation for non-linear iterative conditioning on sensory
inputs. Our proposed model achieves smooth trajectory generation,
goal-attractor convergence, correlation analysis, non-linear conditioning, and
online re-planing in one framework.
Related papers
- AMP: Autoregressive Motion Prediction Revisited with Next Token Prediction for Autonomous Driving [59.94343412438211]
We introduce the GPT style next token motion prediction into motion prediction.
Different from language data which is composed of homogeneous units -words, the elements in the driving scene could have complex spatial-temporal and semantic relations.
We propose to adopt three factorized attention modules with different neighbors for information aggregation and different position encoding styles to capture their relations.
arXiv Detail & Related papers (2024-03-20T06:22:37Z) - Sample Complexity Characterization for Linear Contextual MDPs [67.79455646673762]
Contextual decision processes (CMDPs) describe a class of reinforcement learning problems in which the transition kernels and reward functions can change over time with different MDPs indexed by a context variable.
CMDPs serve as an important framework to model many real-world applications with time-varying environments.
We study CMDPs under two linear function approximation models: Model I with context-varying representations and common linear weights for all contexts; and Model II with common representations for all contexts and context-varying linear weights.
arXiv Detail & Related papers (2024-02-05T03:25:04Z) - MMP++: Motion Manifold Primitives with Parametric Curve Models [5.982922468400902]
Motion Manifold Primitives (MMP) is a manifold-based approach for encoding basic motion skills.
We introduce Motion Manifold Primitives++ (MMP++), a new model that integrates the strengths of both MMP and traditional methods.
We show that MMP++ and IMMP++ outperform existing methods in trajectory generation tasks.
arXiv Detail & Related papers (2023-10-26T00:28:37Z) - Tuning Pre-trained Model via Moment Probing [62.445281364055795]
We propose a novel Moment Probing (MP) method to explore the potential of LP.
MP performs a linear classification head based on the mean of final features.
Our MP significantly outperforms LP and is competitive with counterparts at less training cost.
arXiv Detail & Related papers (2023-07-21T04:15:02Z) - MotionDiffuser: Controllable Multi-Agent Motion Prediction using
Diffusion [15.146808801331774]
MotionDiffuser is a diffusion based representation for the joint distribution of future trajectories over multiple agents.
We propose a general constrained sampling framework that enables controlled trajectory sampling based on differentiable cost functions.
We obtain state-of-the-art results for multi-agent motion prediction on the Open Motion dataset.
arXiv Detail & Related papers (2023-06-05T17:55:52Z) - Formal Controller Synthesis for Markov Jump Linear Systems with
Uncertain Dynamics [64.72260320446158]
We propose a method for synthesising controllers for Markov jump linear systems.
Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS.
We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
arXiv Detail & Related papers (2022-12-01T17:36:30Z) - STGlow: A Flow-based Generative Framework with Dual Graphormer for
Pedestrian Trajectory Prediction [22.553356096143734]
We propose a novel generative flow based framework with dual graphormer for pedestrian trajectory prediction (STGlow)
Our method can more precisely model the underlying data distribution by optimizing the exact log-likelihood of motion behaviors.
Experimental results on several benchmarks demonstrate that our method achieves much better performance compared to previous state-of-the-art approaches.
arXiv Detail & Related papers (2022-11-21T07:29:24Z) - Making Linear MDPs Practical via Contrastive Representation Learning [101.75885788118131]
It is common to address the curse of dimensionality in Markov decision processes (MDPs) by exploiting low-rank representations.
We consider an alternative definition of linear MDPs that automatically ensures normalization while allowing efficient representation learning.
We demonstrate superior performance over existing state-of-the-art model-based and model-free algorithms on several benchmarks.
arXiv Detail & Related papers (2022-07-14T18:18:02Z) - Orientation Probabilistic Movement Primitives on Riemannian Manifolds [0.0]
Probabilistic movement primitives (ProMPs) stand out as a principled approach that models trajectory distributions learned from demonstrations.
When ProMPs are employed in operational space, their original formulation does not directly apply to full-pose movements.
This paper proposes a Riemannian formulation of ProMPs that enables encoding and retrieving of quaternion trajectories.
arXiv Detail & Related papers (2021-10-28T11:49:03Z) - Modular Deep Reinforcement Learning for Continuous Motion Planning with
Temporal Logic [59.94347858883343]
This paper investigates the motion planning of autonomous dynamical systems modeled by Markov decision processes (MDP)
The novelty is to design an embedded product MDP (EP-MDP) between the LDGBA and the MDP.
The proposed LDGBA-based reward shaping and discounting schemes for the model-free reinforcement learning (RL) only depend on the EP-MDP states.
arXiv Detail & Related papers (2021-02-24T01:11:25Z) - Variational Inference and Learning of Piecewise-linear Dynamical Systems [33.23231229260119]
We propose a variational approximation of piecewise linear dynamical systems.
We show that the model parameters can be split into two sets, static and dynamic parameters, and that the former parameters can be estimated off-line together with the number of linear modes, or the number of states of the switching variable.
arXiv Detail & Related papers (2020-06-02T14:40:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.