二足歩行の軌道最適化ベンチマークとSGD系手法の有効性検証
SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks
脚式ロボットの軌道最適化・姿勢生成の新ベンチマークを提案し、SQPとSGD系の確率的・逐次手法を比較。SGD系が難しい初期値で高い成功率を示し、コストと制約をランダム部分集合で更新するSQP変種が最大30%改善した。
著者: Martim Brandao, Kenji Hashimoto, Atsuo Takanishi
分類: cs.RO, cs.LG, math.OC
原文アブストラクト
Trajectory optimization and posture generation are hard problems in robot locomotion, which can be non-convex and have multiple local optima. Progress on these problems is further hindered by a lack of open benchmarks, since comparisons of different solutions are difficult to make. In this paper we introduce a new benchmark for trajectory optimization and posture generation of legged robots, using a pre-defined scenario, robot and constraints, as well as evaluation criteria. We evaluate state-of-the-art trajectory optimization algorithms based on sequential quadratic programming (SQP) on the benchmark, as well as new stochastic and incremental optimization methods borrowed from the large-scale machine learning literature. Interestingly we show that some of these stochastic and incremental methods, which are based on stochastic gradient descent (SGD), achieve higher success rates than SQP on tough initializations. Inspired by this observation we also propose a new incremental variant of SQP which updates only a random subset of the costs and constraints at each iteration. The algorithm is the best performing in both success rate and convergence speed, improving over SQP by up to 30% in both criteria. The benchmark's resources and a solution evaluation script are made openly available.
