凸集合グラフのニューラル予測による混合離散連続動作計画の高速化
Accelerating Mixed Discrete-Continuous Motion Planning via Neural Graphs of Convex Sets
動作計画を凸集合グラフ(GCS)で定式化し、高コストな凸緩和をグラフ注意ネットワークによる候補経路予測と軽量ランキングで置き換え、早期探索終了で高速化する手法を提案。3Dクアッドロータや7自由度マニピュレータ、平面押し操作で最大2桁の高速化を達成。
詳しい要約
1. どんなもの？
2. 先行研究と比べてどこがすごい？
3. 技術・手法の肝は？
4. どうやって有効だと検証した？
5. 議論はある？
6. 次に読むべき論文は？
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Ananya Trivedi, Sarvesh Prajapati, Mohamed Khalid M Jaffar, Zhexin Xu, David Rosen, Taskin Padir
分類: cs.RO
原文アブストラクト
Motion planning problems such as collision-free navigation and contact-rich manipulation can be naturally formulated as optimization problems that couple discrete decisions with continuous trajectories. The Graphs of Convex Sets (GCS) framework offers a practical solution to these problems. It represents discrete decisions as nodes of a graph and encodes continuous trajectories in the edges connecting them. However, the resulting optimization subproblems can become computationally prohibitive for online replanning. In this work, we propose a learning-based strategy to mitigate this limitation. Specifically, we replace the costly convex relaxation step required by nominal GCS with a single forward pass through a Graph Attention Network that predicts a set of highly probable candidate paths through the graph. A lightweight ranking network then orders these candidates by their estimated trajectory cost. Evaluating them in this order, we terminate our search early while still recovering a near-optimal motion plan. We validate the resulting pipeline across diverse robotic tasks, including collision-free motion planning for a 3D quadrotor and a 7-DoF manipulator, and planning through contact for planar pushing. Across both convex and non-convex cost and constraint settings, our approach yields up to two orders of magnitude speedup over nominal GCS while maintaining a 100% success rate, at the cost of some suboptimality in the recovered solutions. Code implementations and video demonstrations can be found at https://neural-gcs.github.io/.