Imitative Planning using Conditional Normalizing Flow
A popular way to plan trajectories in dynamic urban scenarios for Autonomous Vehicles is to rely on explicitly specified and hand crafted cost functions, coupled with random sampling in the trajectory space to find the minimum cost trajectory. Such methods require a high number of samples to find a low-cost trajectory and might end up with a highly suboptimal trajectory given the planning time budget. We explore the application of normalizing flows for improving the performance of trajectory planning for autonomous vehicles (AVs). Our key insight is to learn a sampling policy in a low-dimensional latent space of expert-like trajectories, out of which the best sample is selected for execution. By modeling the trajectory planner's cost manifold as an energy function, we learn a scene conditioned mapping from the prior to a Boltzmann distribution over the AV control space. Finally, we demonstrate the effectiveness of our approach on real-world datasets over IL and hand-constructed trajectory sampling techniques.
Code (0)
등록된 구현이 없습니다.
Tasks
Autonomous VehiclesTrajectory PlanningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Projected Latent Markov Chain Monte Carlo: Conditional Sampling of Normalizing Flows
We introduce Projected Latent Markov Chain Monte Carlo (PL-MCMC), a technique for sampling from the high-dimensional conditional distributions learned by a normalizing flow. We prove that a Metropolis-Hastings implementa…
Locality-constrained autoregressive cum conditional normalizing flow for lattice field theory simulations
Normalizing flow-based sampling methods have been successful in tackling computational challenges traditionally associated with simulating lattice quantum field theories. Further works have incorporated gauge and transla…
CAFLOW: Conditional Autoregressive Flows
We introduce CAFLOW, a new diverse image-to-image translation model that simultaneously leverages the power of auto-regressive modeling and the modeling efficiency of conditional normalizing flows. We transform the condi…
Image GenerationImage-to-Image TranslationTranslationFlows for Flows: Training Normalizing Flows Between Arbitrary Distributions with Maximum Likelihood Estimation
Normalizing flows are constructed from a base distribution with a known density and a diffeomorphism with a tractable Jacobian. The base density of a normalizing flow can be parameterised by a different normalizing flow,…
Semi-Equivariant Conditional Normalizing Flows
We study the problem of learning conditional distributions of the form $p(G | \hat G)$, where $G$ and $\hat G$ are two 3D graphs, using continuous normalizing flows. We derive a semi-equivariance condition on the flow wh…