arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.09265cs.RO
收藏

质心动量动力学的时间优化

On Time Optimization of Centroidal Momentum Dynamics

Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);University of Southern California(南加利福尼亚大学);New York University(纽约大学)

Brahayam Ponton, Alexander Herzog, Andrea Del Prete, Stefan Schaal, Ludovic Righetti

摘要:

最近,质心动量动力学已受到相当大的关注,规划动态一致的运动与手臂和腿的机器人在多接触的情况下。然而,它也是非凸的,这使得任何优化方法都很困难,并且在大多数轨迹优化技术中,定时通常保持固定,以不向问题引入额外的非凸性。但这会限制算法的通用性。在我们以前的工作中,我们提出了一个凸松弛的问题,允许有效地计算动量轨迹和接触力。然而,我们的方法不能最小化所需的角动量目标,这严重限制了它的适用性。注意到时间变量引入的非凸性与质心动力学的非凸性具有相似的性质,我们提出了两个基于信赖域和软约束的凸松弛问题。所得到的方法可以计算时间优化的动态一致的轨迹足够快,使该方法实时能力。该算法的性能表现在几个多接触的情况下的人形机器人。特别是,我们表明,提出的凸松弛的原始问题的解决方案是一致的,与原来的非凸问题,并说明如何定时优化允许找到运动计划,这将是难以计划与固定的时间。

英文摘要:

Recently, the centroidal momentum dynamics has received substantial attention to plan dynamically consistent motions for robots with arms and legs in multi-contact scenarios. However, it is also non convex which renders any optimization approach difficult and timing is usually kept fixed in most trajectory optimization techniques to not introduce additional non convexities to the problem. But this can limit the versatility of the algorithms. In our previous work, we proposed a convex relaxation of the problem that allowed to efficiently compute momentum trajectories and contact forces. However, our approach could not minimize a desired angular momentum objective which seriously limited its applicability. Noticing that the non-convexity introduced by the time variables is of similar nature as the centroidal dynamics one, we propose two convex relaxations to the problem based on trust regions and soft constraints. The resulting approaches can compute time-optimized dynamically consistent trajectories sufficiently fast to make the approach realtime capable. The performance of the algorithm is demonstrated in several multi-contact scenarios for a humanoid robot. In particular, we show that the proposed convex relaxation of the original problem finds solutions that are consistent with the original non-convex problem and illustrate how timing optimization allows to find motion plans that would be difficult to plan with fixed timing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑