Efficient Iterative Proximal Variational Inference Motion Planning
Zinuo Chang, Hongzhe Yu, Patricio Vela, and Yongxin Chen

TL;DR
This paper introduces a fast, parallelized variational inference method for motion planning under uncertainty, applicable to both linear and nonlinear stochastic systems, leveraging GPU acceleration and Gaussian Belief Propagation.
Contribution
It proposes P-GVIMP, a novel parallel Gaussian variational inference framework for efficient motion planning, including an iterative approach for nonlinear systems using SLR techniques.
Findings
Significant speed improvements with GPU-based parallel computation.
Successful planning for nonlinear stochastic systems.
Open-source implementation available.
Abstract
We cast motion planning under uncertainty as a stochastic optimal control problem, where the optimal posterior distribution has an explicit form. To approximate this posterior, this work frames an optimization problem in the space of Gaussian distributions by solving a Variational Inference (VI) in the path distribution space. For linear-Gaussian stochastic dynamics, a proximal algorithm is proposed to solve for an optimal Gaussian proposal iteratively. The computational bottleneck is evaluating the gradients with respect to the proposal over a dense trajectory. To tackle this issue, the sparse planning factor graph and Gaussian Belief Propagation (GBP) are exploited, allowing for parallel computation of these gradients on Graphics Processing Units (GPUs). We term the novel paradigm the \textit{Parallel Gaussian Variational Inference Motion Planning (P-GVIMP)}. Building on the efficient…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification
