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

任务和运动规划中的几何约束学习

Learning Geometric Constraints in Task and Motion Planning

Technische Universität Darmstadt(达姆施塔特工业大学);Huawei R&D London(华为伦敦研发中心)

Tianyu Ren, Alexander Imani Cowen-Rivers, Haitham Bou Ammar, Jan Peters

摘要:

任务与运动规划中几何参数的约束搜索是一个高维决策空间的有限时域随机规划问题。机器人操作器只能在其整个范围的子空间中移动,该子空间受到许多几何约束。TAMP求解器通常在为每个任务找到可行的绑定集之前进行多次探索。这是有利的,学习这些约束一次,然后将它们转移到同一工作空间内的不同任务。我们解决这个问题,表示约束知识与可转让的原语和贝叶斯优化(BO)的基础上,这些原语指导绑定搜索在进一步的任务。通过TAMP中的语义和几何回溯,我们构造了约束原语,分别以可重用的形式对几何约束进行编码。然后,我们设计了一个BO的方法,有效地利用累积的约束,指导基于MCTS的绑定规划器的节点扩展。我们进一步组成一个转移机制,使TAMP任务之间的自由知识流动。结果表明,我们的方法减少了昂贵的探索调用绑定搜索由43.6071.69相比,基线无指导规划。

英文摘要:

Searching for bindings of geometric parameters in task and motion planning (TAMP) is a finite-horizon stochastic planning problem with high-dimensional decision spaces. A robot manipulator can only move in a subspace of its whole range that is subjected to many geometric constraints. A TAMP solver usually takes many explorations before finding a feasible binding set for each task. It is favorable to learn those constraints once and then transfer them over different tasks within the same workspace. We address this problem by representing constraint knowledge with transferable primitives and using Bayesian optimization (BO) based on these primitives to guide binding search in further tasks. Via semantic and geometric backtracking in TAMP, we construct constraint primitives to encode the geometric constraints respectively in a reusable form. Then we devise a BO approach to efficiently utilize the accumulated constraints for guiding node expansion of an MCTS-based binding planner. We further compose a transfer mechanism to enable free knowledge flow between TAMP tasks. Results indicate that our approach reduces the expensive exploration calls in binding search by 43.60to 71.69 when compared to the baseline unguided planner.

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

↑