4 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…
A Framework for Combining Optimization-Based and Analytic Inverse Kinematics
Thomas Cohn, Lihan Tang, Alexandre Amice +1
Analytic and optimization methods for solving inverse kinematics (IK) problems have been deeply studied throughout the history of robotics. The two strategies have complementary st…
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…
Multi-Query Shortest-Path Problem in Graphs of Convex Sets
Savva Morozov, Tobia Marcucci, Alexandre Amice +4
The Shortest-Path Problem in Graph of Convex Sets (SPP in GCS) is a recently developed optimization framework that blends discrete and continuous decision making. Many relevant pro…