Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot
Configuration Space

v1v2 (latest)

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

16 October 2024

Rebecca H. Jiang

ArXiv (abs)PDF HTML

Papers citing "Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space"

5 / 5 papers shown

Title
Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning Jinhao Liang Sven Koenig Ferdinando Fioretto 123 3 0 27 Aug 2025
A biconvex method for minimum-time motion planning through sequences of convex sets Tobia Marcucci Mathew Halm Will Yang Dongchan Lee Andrew D. Marchese 339 3 0 26 Apr 2025
Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning Peter Werner Richard Cheng Tom Stewart Russ Tedrake Daniela Rus 238 6 0 15 Apr 2025
Neural Configuration-Space Barriers for Manipulation Planning and Control Kehan Long Ki Myung Brian Lee Nikola Raicevic Niyas Attasseri Melvin Leok Nikolay Atanasov 343 3 0 06 Mar 2025
Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space Qianhao Wang Zhepei Wang Mingyang Wang Jialin Ji Xiaoying Li Tianyue Wu Rui Jin Yuman Gao Chao Xu Fei Gao 235 19 0 05 Mar 2024