01 / Robot learning & planning
Representations for efficient algorithms
How can a change of representation simplify an algorithm and expose more parallel computation?
We represent candidate paths and their costs as tensors so GPUs can evaluate many plans in parallel. Our work covers graph search, optimal transport, and learned trajectory priors, including analysis of completeness and convergence.
GTMP searches layered graphs with tensor operations; Anytime GTMP finds more paths and improves their cost as computation continues. MPOT uses optimal transport to optimize trajectories without gradients, while PolyStep applies optimal transport to train non-differentiable networks. AAC compresses graph-search heuristics while preserving admissibility.
GTMP · Anytime GTMP · MPOT · MTP · MPD · CLOT · PolyStep · AAC































