GraphDistNet: グラフベースの衝突距離推定器による勾配ベース軌道最適化
GraphDistNet: A Graph-based Collision-distance Estimator for Gradient-based Trajectory Optimization
2つの形状間の構造情報をエッジ特徴量ベースの畳み込みで符号化し、衝突距離と勾配を効率的に予測するGraphDistNetを提案。注意機構により未知の複雑形状にも汎化し、軌道最適化の精度と安全性を向上させた。
著者: Yeseung Kim, Jinwoo Kim, Daehyung Park
分類: cs.RO
原文アブストラクト
Trajectory optimization (TO) aims to find a sequence of valid states while minimizing costs. However, its fine validation process is often costly due to computationally expensive collision searches, otherwise coarse searches lower the safety of the system losing a precise solution. To resolve the issues, we introduce a new collision-distance estimator, GraphDistNet, that can precisely encode the structural information between two geometries by leveraging edge feature-based convolutional operations, and also efficiently predict a batch of collision distances and gradients through 25,000 random environments with a maximum of 20 unforeseen objects. Further, we show the adoption of attention mechanism enables our method to be easily generalized in unforeseen complex geometries toward TO. Our evaluation show GraphDistNet outperforms state-of-the-art baseline methods in both simulated and real world tasks.
