Approximating Robot Configuration Spaces with few Convex Sets using
Clique Covers of Visibility Graphs

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs

4 October 2023

Alexandre Amice

Daniela Rus

Papers citing "Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs"

7 / 7 papers shown

Title
A biconvex method for minimum-time motion planning through sequences of convex sets Tobia Marcucci Mathew Halm Will Yang Dongchan Lee Andrew D. Marchese 58 1 0 26 Apr 2025
Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning Jingtao Tang Zining Mao Lufan Yang Hang Ma 37 0 0 01 Mar 2025
Rigid Body Path Planning using Mixed-Integer Linear Programming Mingxin Yu Chuchu Fan 31 0 0 17 Sep 2024
GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets S. Y. C. Chia Rebecca H. Jiang B. P. Graesdal L. Kaelbling Russ Tedrake 51 9 0 11 Jul 2024
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 Zhichao Han Tianyue Wu Rui Jin Yuman Gao Chao Xu Fei Gao 53 12 0 05 Mar 2024
Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets Thomas Cohn Mark E. Petersen Max Simchowitz Russ Tedrake 29 15 0 10 May 2023
Fast Path Planning Through Large Collections of Safe Boxes Tobia Marcucci Parth Nobel Russ Tedrake Stephen P. Boyd 48 22 0 01 May 2023