An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
The Open Motion Planning Library
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.RO 2years
2026 2representative citing papers
citing papers explorer
-
A Ray Intersection Algorithm for Fast Growth Distance Computation Between Convex Sets
An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
- Multi-Robot Motions in Milliseconds: Vector-Accelerated Primitives for Sampling-Based Planning