5 papers
Semidefinite Relaxations for Collision-Free Motion Planning
Bernhard Paus Graesdal, Alexandre Amice, Pablo A. Parrilo +1
We study semidefinite relaxations for collision-free motion planning. We focus on a point robot moving from start to goal through spherical obstacles in , subject to…
Approximately Optimal Global Planning for Contact-Rich SE(2) Manipulation on a Graph of Reachable Sets
Simin Liu, Tong Zhao, Bernhard Paus Graesdal +5
If we consider human manipulation, it is clear that contact-rich manipulation (CRM)-the ability to use any surface of the manipulator to make contact with objects-can be far more e…
Physics-Driven Data Generation for Contact-Rich Manipulation via Trajectory Optimization
Lujie Yang, H. J. Terry Suh, Tong Zhao +5
We present a low-cost data generation pipeline that integrates physics-based simulation, human demonstrations, and model-based planning to efficiently generate large-scale, high-qu…
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets
Savva Morozov, Tobia Marcucci, Bernhard Paus Graesdal +3
We study the Shortest-Walk Problem (SWP) in a Graph of Convex Sets (GCS). A GCS is a graph where each vertex is paired with a convex program, and each edge couples adjacent program…
GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Shao Yuan Chew Chia, Rebecca H. Jiang, Bernhard Paus Graesdal +2
We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that genera…