通过凸集增强图进行具有优先级规格的运动规划
Motion Planning with Precedence Specifications via Augmented Graphs of Convex Sets
AI总结:
本文提出一种算法,用于规划避开障碍物并满足关键门优先级规格的轨迹。方法通过精确的凸集划分编码自由空间连通性,并构建增强图以精确编码优先级规格,通过求解最短路径问题提供精确解。
摘要:
我们提出了一种算法,用于规划避开障碍物并满足关键门优先级规格的轨迹。我们的方法包括一种新的精确凸集划分,该划分编码了自由空间集、关键集和门集之间的连通性。然后构建了一个增强的凸集图,精确编码了关键门优先级规格。通过在该增强图中求解最短路径问题,我们的流程在轨迹的有限参数化范围内提供精确解。为了展示本方法的有效性,我们提出了一种生成关键门迷宫的方法,以提供具有挑战性的实例,并通过数值实验评估所提出的流程。我们的流程比使用通用时序逻辑工具的最新最先进方法快了多个数量级。
英文摘要:
We present an algorithm for planning trajectories that avoid obstacles and satisfy key-door precedence specifications expressed with a fragment of signal temporal logic. Our method includes a novel exact convex partitioning of the obstacle free space that encodes connectivity among convex free space sets, key sets, and door sets. We then construct an augmented graph of convex sets that exactly encodes the key-door precedence specifications. By solving a shortest path problem in this augmented graph of convex sets, our pipeline provides an exact solution up to a finite parameterization of the trajectory. To illustrate the effectiveness of our approach, we present a method to generate key-door mazes that provide challenging problem instances, and we perform numerical experiments to evaluate the proposed pipeline. Our pipeline is faster by several orders of magnitude than recent state-of-the art methods that use general purpose temporal logic tools.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。