Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations
cs.RO
Submitted: 2026-08-15
Updated: 2026-09-15
Project page: https://neural-gcs.github.io
Terminology
Sources
- Towards Tight Convex Relaxations for Contact-Rich Manipulation
- How Attentive are Graph Attention Networks?
- A Unified and Scalable Method for Optimization over Graphs of Convex Sets
- Graph Neural Networks for Motion Planning
- Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning
- Multi-Query Shortest-Path Problem in Graphs of Convex Sets
- Implicit Graph Search for Planning on Graphs of Convex Sets
- GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
- $A^*$ for Graphs of Convex Sets
- Certifiable Factor Graph Optimization
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies
- Fine-tuning is Not Enough: A Parallel Framework for Collaborative Imitation and Reinforcement Learning in End-to-end Autonomous Driving