Landon Clark

Plan Optimal Collision-Free Trajectories with Non-Convex Cost Functions Using Graphs of Convex Sets

The recently developed approach to motion planning in graphs of convex sets (GCS) provides an efficient framework for computing shortest-distance collision-free paths using convex optimization. This new motion planner is notably more computationally efficient than popular sampling-based motion plann…