PISTO: Proximal Inference for Stochastic Trajectory Optimization
Hongzhe Yu, Zinuo Chang, and Yongxin Chen

TL;DR
PISTO is a novel derivative-free stochastic trajectory optimization algorithm that stabilizes updates using KL regularization, outperforming existing methods in robot motion planning and manipulation tasks.
Contribution
We introduce PISTO, a proximal inference-based algorithm that enhances stochastic trajectory optimization with KL regularization, enabling stable, efficient, and non-differentiable cost handling.
Findings
PISTO achieves 89% success rate on robot arm benchmarks, outperforming CHOMP and STOMP.
PISTO produces shorter, smoother paths at twice the speed of competing methods.
PISTO outperforms CEM and MPPI in contact-rich MuJoCo tasks.
Abstract
Stochastic trajectory optimization methods like STOMP enable planning with non-differentiable costs, offering substantial flexibility over gradient-based approaches. We show that STOMP implicitly minimizes the KL divergence from a Boltzmann trajectory distribution, revealing an elegant Variational Inference (VI) structure underlying its updates. Building on this insight, we propose the \textit{Proximal Inference for Stochastic Trajectory Optimization} (PISTO) algorithm that stabilizes the updates by augmenting the objective with a KL regularization between successive Gaussian proposals. This proximal formulation admits a trust-region interpretation and yields closed-form mean updates computable as expectations under a surrogate distribution. We estimate these expectations via importance-weighted Monte Carlo sampling, producing a simple, derivative-free algorithm that inherits STOMP's…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
