Fetching the paper…
Reading the bibliography…
One of the most difficult parts of motion planning in configuration space is ensuring a trajectory does not collide with task-space obstacles in the environment.
Convergence properties of hit-and-run samplers
Claude Bélisle, Arnon Boneh, and Richard Caron · 1998
Earlier work this paper cites.
Convex optimization
Stephen P Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Approximate convex decomposition of polygons
Jyh-Ming Lien and Nancy M Amato · 2004
Earlier work this paper cites.
SNOPT: An SQP algorithm for large-scale constrained optimization
Philip E Gill, Walter Murray, and Michael A Saunders · 2005
Earlier work this paper cites.
A simple and efficient approach for 3d mesh approximate convex decomposition
Khaled Mamou and Faouzi Ghorbel · 2009
Cited alongside, same era.
Convex shape decomposition
Hairong Liu, Wenyu Liu, and Longin Jan Latecki · 2010
Cited alongside, same era.
Efficient mixed-integer planning for UAVs in cluttered environments
Robin Deits and Russ Tedrake · 2015
Cited alongside, same era.
MOSEK Optimizer API for C 10.0.34 , 2022
MOSEK ApS · 2022
Cited alongside, same era.
Computing large convex regions of obstacle-free space through semidefinite programming
Robin Deits and Russ Tedrake
Cited in the paper.
Motion Planning around Obstacles with Convex Optimization
Tobia Marcucci, Mark Petersen, David von Wrangel, and Russ Tedrake · 2022
Later among the works it cites.
Robotic Manipulation
Russ Tedrake · 2022
Later among the works it cites.
Alexandre Amice, Hongkai Dai, Peter Werner, Annan Zhang, and Russ Tedrake · 2023
Closest in time.
Gurobi Optimizer Reference Manual, 2023
Gurobi Optimization, LLC · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…