基于块坐标下降法的质心动力学快速凸优化
Rapid Convex Optimization of Centroidal Dynamics using Block Coordinate Descent
摘要:
在本文中,我们探讨了使用块坐标下降(BCD)优化质心动量动力学的动态一致的多接触行为。质心动力学最近得到了大量的关注,以创建物理上可实现的运动的手和脚的机器人,而计算上更容易处理比全刚体动力学模型。我们的贡献在于利用结构的动力学,以简化原来的非凸问题成两个凸子问题。我们在这两个子问题之间进行一定数量的迭代,或者直到达成共识。我们探讨了所提出的优化方法的质心动力学的属性,并在模拟中验证,我们的方法产生的运动可以跟踪的四足动物Solo12。此外,我们将我们的方法与最近提出的使用凸松弛序列的凸化以及在现成的求解器IPOPT中使用的更标准的内点方法进行比较,以表明我们的方法找到类似的(如果不是更好的话)轨迹(在成本方面),并且比这两种方法快四倍以上。最后,与以前的方法相比,我们注意到它的实用性,由于每个子问题的凸性质,使我们的方法可以与任何现成的二次规划求解器。
英文摘要:
In this paper we explore the use of block coordinate descent (BCD) to optimize the centroidal momentum dynamics for dynamically consistent multi-contact behaviors. The centroidal dynamics have recently received a large amount of attention in order to create physically realizable motions for robots with hands and feet while being computationally more tractable than full rigid body dynamics models. Our contribution lies in exploiting the structure of the dynamics in order to simplify the original non-convex problem into two convex subproblems. We iterate between these two subproblems for a set number of iterations or until a consensus is reached. We explore the properties of the proposed optimization method for the centroidal dynamics and verify in simulation that motions generated by our approach can be tracked by the quadruped Solo12. In addition, we compare our method to a recently proposed convexification using a sequence of convex relaxations as well as a more standard interior point method used in the off- the-shelf solver IPOPT to show that our approach finds similar, if not better, trajectories (in terms of cost), and is more than four times faster than both approaches. Finally, compared to previous approaches, we note its practicality due to the convex nature of each subproblem which allows our method to be used with any off-the-shelf quadratic programming solver.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。