問題-最適解マップの学習:ロボティクスにおける大域最適化への分析と応用
Learning the Problem-Optimum Map: Analysis and Application to Global Optimization in Robotics
事前計算した問題サンプルの解をオンラインで検索・適応して新規問題を解くデータ駆動型大域最適化を提案し、近似精度を保証するサンプル数と配置の理論条件を示した。衝突回避逆運動学に適用し、標準PCでサブミリ秒の準大域最適解を実現した。
著者: Kris Hauser
分類: cs.RO
原文アブストラクト
This paper describes a data-driven framework for approximate global optimization in which precomputed solutions to a sample of problems are retrieved and adapted during online use to solve novel problems. This approach has promise for real-time applications in robotics, since it can produce near-globally optimal solutions orders of magnitude faster than standard methods. This paper establishes theoretical conditions on how many and where samples are needed over the space of problems to achieve a given approximation quality. The framework is applied to solve globally optimal collision-free inverse kinematics (IK) problems, wherein large solution databases are used to produce near-optimal solutions in sub-millisecond time on a standard PC.
