VEGA: Decomposition Solver for Graphs of Convex Sets
Parallel decomposition methods and benchmark infrastructure for large graph-of-convex-sets planning relaxations.
•
1 min read
Parallel decomposition methods and benchmark infrastructure for large graph-of-convex-sets planning relaxations.
A C++ and CUDA solver family for the structured convex programs that appear in robotics, control, and graph-of-convex-sets relaxations.
Formally verifying the safety of complicated trajectories at scale.
Provably correct descriptions of Configuration Space for collision-free motion planning
Solving linear systems of equations is a fundamental subroutine in many algorithms. What structures are amenable to solving linear equations even faster.
Resiliency of control systems and learning algorithms via counter-factual optimization
Guaranteed performance of heuristic strategies for a known, hard problem.