Multi-modal Collision Avoidance
Designing efficient MPC schemes for avoiding collisions against obstacles with dynamic, multi-modal uncertainties
On this page, we highlight our work on efficient, non-conservative collision avoidance in the presence of multi-modal predictions of traffic vehicles, for autonomous driving.
Our main theoretical contributions include:
(1) Robust, Stochastic and Distributionally Robust MPC formulations that optimize over a novel feedback policy class designed to exploit additional structure in the multi-modal predictions, and that is amenable to convex programming .


The use of feedback policies for prediction is motivated by the need for reduced conservatism in handling multi-modal predictions of the surrounding vehicles, especially prevalent in urban driving scenarios.
(2) Convexified, optimization-based collision avoidance between convex sets in the presence of uncertainty.


Collision avoidance constraints in the presence of uncertainty, are typically imposed by conservatively approximating the vehicle geometry as a (i) point, (ii) affine space, (iii) spheres or (iv) ellipsoids, instead of using polytopes to avoid non-smooth constraints. We use the dual perspective of collision avoidance to find separating hyperplanes between vehicles expressed as polytopes, while simulatenously accounting for the uncertainty in their locations.

For more details, please see our papers from ITSC’22 and CDC’22.
Upcoming:
In addition to using multi-modal policies, we derive a convex formulation for simulataneous risk allocation and optimization of policies for multi-modal obstacle avoidance constraints. The figure below underscores the importance of this contribution. For \(x\) given by a Gaussian mixture (where \(x\) could denote the distance between vehicles), the figure depicts two formulations for shaping its multi-modal distribution via the means \(\mu\) to satisfy \(\mathbb{P}(x>0)\geq p^\star\).

The resulting distributions are shown on the right for the uniform risk and variable risk allocation formulations at the top and bottom respectively. The latter allows satisfaction of the chance constraint without agressive shaping of the distribution, by exploiting the difference in probabilities of the modes. Consequently, this improves the feasibility of MPC optimization problems by allocating less risk to unlikely modes, without compromising on safety! This approach was recently developed and implemented on a full-scale vehicle in collaboration with Hotae Lee and Eunhyek Joa:
The technical details will be available soon. Stay tuned!