Analytic Conditions for Differentiable Collision Detection in Trajectory Optimization
Abstract
Optimization-based methods are widely used for computing fast, diverse solutions for complex tasks such as collision-free movement or planning in the presence of contacts. However, most of these methods require enforcing non-penetration constraints between objects, resulting in a non-trivial and computationally expensive problem. This makes the use of optimization-based methods for planning and control challenging. In this paper, we present a method to efficiently enforce non-penetration of sets while performing optimization over their configuration, which is directly applicable to problems like collision-aware trajectory optimization. We introduce novel differentiable conditions with analytic expressions to achieve this. To enforce non-collision between non-smooth bodies using these conditions, we introduce a method to approximate polytopes as smooth semi-algebraic sets. We present several numerical experiments to demonstrate the performance of the proposed method and compare the performance with other baseline methods recently proposed in the literature.
Cite
@article{arxiv.2509.26459,
title = {Analytic Conditions for Differentiable Collision Detection in Trajectory Optimization},
author = {Akshay Jaitly and Devesh K. Jha and Kei Ota and Yuki Shirai},
journal= {arXiv preprint arXiv:2509.26459},
year = {2025}
}
Comments
8 pages, 8 figures. Accepted to the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2025