2024/07/17 by Jon Arrizabalaga, Arrizabalaga, Jon, Zachary Manchester +3 · 3 citations
Computer Science · Engineering · #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Robotics (cs.RO) #Traffic control and management
paper · pdf · doi:10.48550/arxiv.2407.12283
openalex publication_date 2024/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents a method to compute differentiable collision-free parametric corridors. In contrast to existing solutions that decompose the obstacle-free space into multiple convex sets, the continuous corridors computed by our method are smooth and differentiable, making them compatible with existing numerical techniques for learning and optimization. To achieve this, we represent the collision-free corridors as a path-parametric off-centered ellipse with a polynomial basis. We show that the problem of maximizing the volume of such corridors is convex, and can be efficiently solved. To assess the effectiveness of the proposed method, we examine its performance in a synthetic case study and subsequently evaluate its applicability in a real-world scenario from the KITTI dataset.