EUVIMEDEUVIMED entdecken
Crossref

GJK++: Leveraging Acceleration Methods for Faster Collision Detection

Louis Montaut, Quentin Le Lidec, Vladimir Petrik, Josef Sivic, Justin Carpentier

IEEE Transactions on Robotics · 2024 · 40 · 2564-2581

DOI: 10.1109/tro.2024.3386370 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Robotics, 2024. Verfasst von Louis Montaut und 4 weiteren Autor:innen. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 67 Literaturangaben. Gefördert von: European Regional Development, IMPACT, French government.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Collision detection is a fundamental problem in various domains, such as robotics, computational physics, and computer graphics. In general, collision detection is tackled as a computational geometry problem, with the so-called Gilbert, Johnson, and Keerthi (GJK) algorithm being the most adopted solution nowadays. While introduced in 1988, GJK remains the most effective solution to compute the distance or the collision between two 3-D convex geometries. Over the years, it was shown to be efficient, scalable, and generic, operating on a broad class of convex shapes, ranging from simple primitives (sphere, ellipsoid, box, cone, capsule, etc.) to complex meshes involving thousands of vertices. In this article, we introduce several contributions to accelerate collision detection and distance computation between convex geometries by leveraging the fact that these two problems are fundamentally optimization problems. Notably, we establish that the GJK algorithm is a specific subcase of the well-established Frank–Wolfe (FW) algorithm in convex optimization. By adapting recent works linking Polyak and Nesterov accelerations to FW methods, we also propose two accelerated extensions of the classic GJK algorithm. Through an extensive benchmark over millions of collision pairs involving objects of daily life, we show that these two accelerated GJK extensions significantly reduce the overall computational burden of collision detection, leading to computation times that are up to two times faster. Finally, we hope this work will significantly reduce the computational cost of modern robotic simulators, allowing the speedup of modern robotic applications that heavily rely on simulation, such as reinforcement learning or trajectory optimization.

Förderung

  • European Regional Development
  • IMPACT
  • French government
  • Investissements d'avenir
  • INEXACT
  • AGIMUS project
  • European Commission
  • ERC

Zitieren

APA

Montaut, L., Lidec, Q. L., Petrik, V., Sivic, J., & Carpentier, J. (2024). GJK++: Leveraging Acceleration Methods for Faster Collision Detection. IEEE Transactions on Robotics, 40, 2564-2581. https://doi.org/10.1109/tro.2024.3386370

Vancouver

Montaut L, Lidec QL, Petrik V, Sivic J, Carpentier J. GJK++: Leveraging Acceleration Methods for Faster Collision Detection. IEEE Transactions on Robotics. 2024;40:2564-2581. doi:10.1109/tro.2024.3386370

BibTeX
@article{Montaut2024,
  author = {Montaut, Louis and Lidec, Quentin Le and Petrik, Vladimir and Sivic, Josef and Carpentier, Justin},
  title = {GJK++: Leveraging Acceleration Methods for Faster Collision Detection},
  journal = {IEEE Transactions on Robotics},
  year = {2024},
  volume = {40},
  pages = {2564--2581},
  doi = {10.1109/tro.2024.3386370}
}
Kostenlos starten →