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

非欧几里得运动规划:基于测地凸集图的方法

Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets

Massachusetts Institute of Technology(麻省理工学院);Harvard University(哈佛大学)

Thomas Cohn, Mark Petersen, Max Simchowitz, Russ Tedrake

AI总结:

本文提出将构型空间建模为黎曼流形,通过归约将零曲率情形转化为混合整数凸优化问题,从而在非欧几里得空间中实现全局最优运动规划,并在PR2等平台上验证了高效无碰撞轨迹生成。

摘要:

为高维系统计算最优且无碰撞的轨迹是一个具有挑战性的问题。基于采样的规划器受限于维度,而轨迹优化器可能因优化景观中固有的非凸性而陷入局部最小值。使用混合整数规划来封装这些非凸性并寻找全局最优轨迹的方法近期展现出巨大潜力,这得益于紧凸松弛和高效近似策略大幅缩短了运行时间。这些方法此前仅限于欧几里得构型空间,无法用于移动基座或连续旋转关节。在本文中,我们通过将构型空间建模为黎曼流形来处理此类场景,并针对零曲率情形描述了一种将问题简化为混合整数凸优化问题的归约过程。我们在多种机器人平台上验证了结果,包括为PR2双臂移动操作器生成高效无碰撞轨迹。

英文摘要:

Computing optimal, collision-free trajectories for high-dimensional systems is a challenging problem. Sampling-based planners struggle with the dimensionality, whereas trajectory optimizers may get stuck in local minima due to inherent nonconvexities in the optimization landscape. The use of mixed-integer programming to encapsulate these nonconvexities and find globally optimal trajectories has recently shown great promise, thanks in part to tight convex relaxations and efficient approximation strategies that greatly reduce runtimes. These approaches were previously limited to Euclidean configuration spaces, precluding their use with mobile bases or continuous revolute joints. In this paper, we handle such scenarios by modeling configuration spaces as Riemannian manifolds, and we describe a reduction procedure for the zero-curvature case to a mixed-integer convex optimization problem. We demonstrate our results on various robot platforms, including producing efficient collision-free trajectories for a PR2 bimanual mobile manipulator.

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

↑