3 citations · 6 across the 25 of their papers we have counts for
6 papers · 1 filter
Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
Peter Werner, Thomas Cohn, Rebecca H. Jiang +4
We propose two novel algorithms for constructing convex collision-free polytopes in robot configuration space. Finding these polytopes enables the application of stronger motion-pl…
Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces
Shruti Garg, Thomas Cohn, Russ Tedrake
Optimization based motion planning provides a useful modeling framework through various costs and constraints. Using Graph of Convex Sets (GCS) for trajectory optimization gives gu…
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…
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…
Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion
Boyuan Chen, Diego Marti Monso, Yilun Du +3
This paper presents Diffusion Forcing, a new training paradigm where a diffusion model is trained to denoise a set of tokens with independent per-token noise levels. We apply Diffu…
PoCo: Policy Composition from and for Heterogeneous Robot Learning
Lirui Wang, Jialiang Zhao, Yilun Du +2
Training general robotic policies from heterogeneous data for different tasks is a significant challenge. Existing robotic datasets vary in different modalities such as color, dept…