MMP++: Motion Manifold Primitives with Parametric Curve Models
- URL: http://arxiv.org/abs/2310.17072v3
- Date: Wed, 27 Mar 2024 07:04:58 GMT
- Title: MMP++: Motion Manifold Primitives with Parametric Curve Models
- Authors: Yonghyeon Lee,
- Abstract summary: 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.
- Score: 5.982922468400902
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Motion Manifold Primitives (MMP), a manifold-based approach for encoding basic motion skills, can produce diverse trajectories, enabling the system to adapt to unseen constraints. Nonetheless, we argue that current MMP models lack crucial functionalities of movement primitives, such as temporal and via-points modulation, found in traditional approaches. This shortfall primarily stems from MMP's reliance on discrete-time trajectories. To overcome these limitations, we introduce Motion Manifold Primitives++ (MMP++), a new model that integrates the strengths of both MMP and traditional methods by incorporating parametric curve representations into the MMP framework. Furthermore, we identify a significant challenge with MMP++: performance degradation due to geometric distortions in the latent space, meaning that similar motions are not closely positioned. To address this, Isometric Motion Manifold Primitives++ (IMMP++) is proposed to ensure the latent space accurately preserves the manifold's geometry. Our experimental results across various applications, including 2-DoF planar motions, 7-DoF robot arm motions, and SE(3) trajectory planning, show that MMP++ and IMMP++ outperform existing methods in trajectory generation tasks, achieving substantial improvements in some cases. Moreover, they enable the modulation of latent coordinates and via-points, thereby allowing efficient online adaptation to dynamic environments.
Related papers
- Generalizable Implicit Motion Modeling for Video Frame Interpolation [51.966062283735596]
Motion is critical in flow-based Video Frame Interpolation (VFI)
General Implicit Motion Modeling (IMM) is a novel and effective approach to motion modeling VFI.
Our GIMM can be smoothly integrated with existing flow-based VFI works without further modifications.
arXiv Detail & Related papers (2024-07-11T17:13:15Z) - Towards Universal Mesh Movement Networks [13.450178050669964]
We introduce the Universal Mesh Movement Network (UM2N)
UM2N can be applied in a non-intrusive, zero-shot manner to move meshes with different size distributions and structures.
We evaluate our method on advection and Navier-Stokes based examples, as well as a real-world tsunami simulation case.
arXiv Detail & Related papers (2024-06-29T09:35:12Z) - Unleashing Network Potentials for Semantic Scene Completion [50.95486458217653]
This paper proposes a novel SSC framework - Adrial Modality Modulation Network (AMMNet)
AMMNet introduces two core modules: a cross-modal modulation enabling the interdependence of gradient flows between modalities, and a customized adversarial training scheme leveraging dynamic gradient competition.
Extensive experimental results demonstrate that AMMNet outperforms state-of-the-art SSC methods by a large margin.
arXiv Detail & Related papers (2024-03-12T11:48:49Z) - Physics-informed Neural Motion Planning on Constraint Manifolds [6.439800184169697]
Constrained Motion Planning (CMP) aims to find a collision-free path between the given start and goal configurations on the kinematic constraint manifold.
We propose the first physics-informed CMP framework that solves the Eikonal equation on the constraint manifold and trains neural function for CMP without expert data.
Our results show that the proposed approach efficiently solves various CMP problems in both simulation and real-world, including object manipulation under orientation constraints and door opening with a high-dimensional 6-DOF robot manipulator.
arXiv Detail & Related papers (2024-03-09T02:24:02Z) - Towards Efficient Modeling and Inference in Multi-Dimensional Gaussian
Process State-Space Models [11.13664702335756]
We propose to integrate the efficient transformed Gaussian process (ETGP) into the GPSSM to efficiently model the transition function in high-dimensional latent state space.
We also develop a corresponding variational inference algorithm that surpasses existing methods in terms of parameter count and computational complexity.
arXiv Detail & Related papers (2023-09-03T04:34:33Z) - Towards Consistent Stochastic Human Motion Prediction via Motion
Diffusion [8.10696589962658]
We propose DiffMotion as an end-to-end diffusion-based Human Motion Prediction framework.
Our results on benchmark datasets show that DiffMotion significantly outperforms previous methods in terms of both accuracy and fidelity.
arXiv Detail & Related papers (2023-05-21T19:31:56Z) - ProDMPs: A Unified Perspective on Dynamic and Probabilistic Movement
Primitives [0.0]
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)
arXiv Detail & Related papers (2022-10-04T11:20:20Z) - Collaborative Intelligent Reflecting Surface Networks with Multi-Agent
Reinforcement Learning [63.83425382922157]
Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks.
In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
arXiv Detail & Related papers (2022-03-26T20:37:14Z) - Permutation Invariant Policy Optimization for Mean-Field Multi-Agent
Reinforcement Learning: A Principled Approach [128.62787284435007]
We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture.
We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence.
In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
arXiv Detail & Related papers (2021-05-18T04:35:41Z) - Covert Model Poisoning Against Federated Learning: Algorithm Design and
Optimization [76.51980153902774]
Federated learning (FL) is vulnerable to external attacks on FL models during parameters transmissions.
In this paper, we propose effective MP algorithms to combat state-of-the-art defensive aggregation mechanisms.
Our experimental results demonstrate that the proposed CMP algorithms are effective and substantially outperform existing attack mechanisms.
arXiv Detail & Related papers (2021-01-28T03:28:18Z) - Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
We propose a novel optimization backbone for visual SLAM systems.
We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems.
Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
arXiv Detail & Related papers (2020-11-02T18:02:26Z)
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.