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

迈向 TAMP 中运动规划的实用有限样本界

Towards Practical Finite Sample Bounds for Motion Planning in TAMP

Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology(麻省理工学院计算机科学与人工智能实验室)

Seiji Shaw, Aidan Curtis, Leslie Pack Kaelbling, Tomás Lozano-Pérez, Nicholas Roy

AI总结:

本文针对 TAMP 中 PRM 采样数量难以确定的问题,基于样本复杂度理论给出高概率充分样本上界,并提出数值定界算法,在平面场景中验证其紧度并提升规划时间。

摘要:

在配置空间中使用 PRM 等基于采样的运动规划器时,很难确定需要多少样本才能使 PRM 稳定地找到解。这一问题在 Task and Motion Planning(TAMP,任务与运动规划)中尤为重要,因为其中有许多运动规划问题必须按顺序求解。我们试图解决该问题:借助确定性采样和样本复杂度理论方面的先前工作,证明一个样本数量上界,该数量以高概率足以找到解。我们还提出一种数值算法,用于根据所应用的样本复杂度定理的证明来计算更紧的样本数,而该定理被用于推导我们的界。实验表明,我们的数值定界算法在平面规划问题上的紧度保持在两个数量级以内,并且随着问题维度增加,界会变得更松。当将其作为启发式方法部署到 TAMP 规划器中以调度样本时,我们还观察到平面问题的规划时间有所改善。尽管实验表明,要收紧这些界仍有大量工作,但本文提出的思想是迈向实用样本界的一步。

英文摘要:

When using sampling-based motion planners, such as PRMs, in configuration spaces, it is difficult to determine how many samples are required for the PRM to find a solution consistently. This is relevant in Task and Motion Planning (TAMP), where many motion planning problems must be solved in sequence. We attempt to solve this problem by proving an upper bound on the number of samples that are sufficient, with high probability, to find a solution by drawing on prior work in deterministic sampling and sample complexity theory. We also introduce a numerical algorithm to compute a tighter number of samples based on the proof of the sample complexity theorem we apply to derive our bound. Our experiments show that our numerical bounding algorithm is tight within two orders of magnitude on planar planning problems and becomes looser as the problem's dimensionality increases. When deployed as a heuristic to schedule samples in a TAMP planner, we also observe planning time improvements in planar problems. While our experiments show much work remains to tighten our bounds, the ideas presented in this paper are a step towards a practical sample bound.

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

↑