paper-with-me

Papers

Model Tensor Planning

2025-05-02 · An T. Le, Khai Nguyen, Minh Nhat Vu, João Carvalho, Jan Peters

Sampling-based model predictive control (MPC) offers strong performance in nonlinear and contact-rich robotic tasks, yet often suffers from poor exploration due to locally greedy sampling schemes. We propose \emph{Model Tensor Planning} (MTP), a novel sampling-based MPC framework that introduces high-entropy control trajectory generation through structured tensor sampling. By sampling over randomized multipartite graphs and interpolating control trajectories with B-splines and Akima splines, MTP ensures smooth and globally diverse control candidates. We further propose a simple $\beta$-mixing strategy that blends local exploitative and global exploratory samples within the modified Cross-Entropy Method (CEM) update, balancing control refinement and exploration. Theoretically, we show that MTP achieves asymptotic path coverage and maximum entropy in the control trajectory space in the limit of infinite tensor depth and width. Our implementation is fully vectorized using JAX and compatible with MuJoCo XLA, supporting \emph{Just-in-time} (JIT) compilation and batched rollouts for real-time control with online domain randomization. Through experiments on various challenging robotic tasks, ranging from dexterous in-hand manipulation to humanoid locomotion, we demonstrate that MTP outperforms standard MPC and evolutionary strategy baselines in task success and control robustness. Design and sensitivity ablations confirm the effectiveness of MTP tensor sampling structure, spline interpolation choices, and mixing strategy. Altogether, MTP offers a scalable framework for robust exploration in model-based planning and control.

📄 PDF Abstract BibTeX arXiv:2505.01059

Code (1)

anindex/mtp 공식 구현 jax

Tasks

modelModel Predictive ControlMuJoCo

Similar Papers 제목 키워드 기반

Scalable Planning with Tensorflow for Hybrid Nonlinear Domains

2017-04-25 · NeurIPS 2017 12 · Ga Wu, Buser Say, Scott Sanner

Given recent deep learning results that demonstrate the ability to effectively optimize high-dimensional non-convex functions with gradient descent optimization on GPUs, we ask in this paper whether symbolic gradient opt…

Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space

2026-03-12 · Gerhard Reinerth, Riddhiman Laha, Marcello Romano arxiv

We present TANGO (Tensor ANd Graph Optimization), a novel motion planning framework that integrates tensor-based compression with structured graph optimization to enable efficient and scalable trajectory generation. Whil…

Motion Planning

Global Tensor Motion Planning

2024-11-28 · An T. Le, Kay Hansel, João Carvalho, Joe Watson 외

Batch planning is increasingly necessary to quickly produce diverse and quality motion plans for downstream learning applications, such as distillation and imitation learning. This paper presents Global Tensor Motion Pla…

Dataset GenerationDiversityGPUImitation Learning+1

CP-MDP: A CANDECOMP-PARAFAC Decomposition Approach to Solve a Markov Decision Process Multidimensional Problem

2021-02-27 · Daniela Kuinchtner, Afonso Sales, Felipe Meneguzzi

Markov Decision Process (MDP) is the underlying model for optimal planning for decision-theoretic agents in stochastic environments. Although much research focuses on solving MDP problems both in tabular form or using fa…

tensor algebraTensor Decomposition

Anytime Global Tensor Motion Planning

2026-08-26 · Sai Coumar, An T. Le, Zachary Kingston arxiv

Global Tensor Motion Planning (GTMP) solves motion planning with batched tensor operations over a layered multipartite graph. We generalize GTMP so that adjacent-layer edges are realized by any black-box local planner (e…

Motion Planning