arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.09352cs.RO
收藏

基于碰撞基元的可微分碰撞避免

Differentiable Collision Avoidance Using Collision Primitives

ETH(苏黎世联邦理工学院);University of Haifa(海法大学)

Simon Zimmermann, Matthias Busenhart, Simon Huber, Roi Poranne, Stelian Coros

摘要:

机器人运动规划的一个中心方面是避免碰撞,其中目前使用多种不同的方法。基于优化的运动规划是一种方法,其通常严重依赖于机器人与障碍物之间的距离计算。这些计算很容易成为瓶颈,因为它们不能很好地扩展机器人或环境的复杂性。为了提高性能,许多不同的方法建议使用碰撞基元,即近似更复杂的刚体的简单形状,并且更容易计算距离。然而,每对原语都需要自己的专用代码,并且已知某些对会遇到数值问题。在本文中,我们提出了一个易于使用的,统一的处理各种各样的原语。我们制定的距离计算作为一个最小化的问题,我们迭代解决。我们将展示如何采取衍生物的最小化问题,使其无缝集成到一个轨迹优化方法。我们的实验表明,我们的方法表现良好,无论是在时间和质量的轨迹。我们实现的源代码将在验收后发布。

英文摘要:

A central aspect of robotic motion planning is collision avoidance, where a multitude of different approaches are currently in use. Optimization-based motion planning is one method, that often heavily relies on distance computations between robots and obstacles. These computations can easily become a bottleneck, as they do not scale well with the complexity of the robots or the environment. To improve performance, many different methods suggested to use collision primitives, i.e. simple shapes that approximate the more complex rigid bodies, and that are simpler to compute distances to and from. However, each pair of primitives requires its own specialized code, and certain pairs are known to suffer from numerical issues. In this paper, we propose an easy-to-use, unified treatment of a wide variety of primitives. We formulate distance computation as a minimization problem, which we solve iteratively. We show how to take derivatives of this minimization problem, allowing it to be seamlessly integrated into a trajectory optimization method. Our experiments show that our method performs favourably, both in terms of timing and the quality of the trajectory. The source code of our implementation will be released upon acceptance.

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

↑