论文标题
基于序列的计划可行性预测有效的任务和运动计划
Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning
论文作者
论文摘要
我们提出了一种支持学习的任务和运动计划(TAMP)算法,用于解决许多明确和可移动障碍的环境中的移动操纵问题。我们的想法是通过学习的计划可行性预测因子来偏向传统的TAMP计划者的搜索程序。我们算法的核心是Piginet,这是一种基于变压器的新型学习方法,该方法采用了任务计划,目标和初始状态,并预测找到与任务计划相关的运动轨迹的概率。我们将Yieginet整合到薄纱计划器中,该套头可以生成一套高级的高级任务计划,并根据预测的可行性可能对其进行分类,并按照该顺序进行完善。我们评估了七个厨房重排问题家族的tamp算法的运行时间,将其性能与非学习基线的性能进行了比较。我们的实验表明,在仅接受150-600个问题的培训后,含量可提高计划效率,在小州空间的问题上减少运行时,在小州空间的问题上减少了80%,而较大的空间则减少了10%-50%。最后,由于其对象的可视化编码,它还将零射门的概括性归因于看不见的对象类别的问题。项目页面https://piginet.github.io/。
We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. Our idea is to bias the search procedure of a traditional TAMP planner with a learned plan feasibility predictor. The core of our algorithm is PIGINet, a novel Transformer-based learning method that takes in a task plan, the goal, and the initial state, and predicts the probability of finding motion trajectories associated with the task plan. We integrate PIGINet within a TAMP planner that generates a diverse set of high-level task plans, sorts them by their predicted likelihood of feasibility, and refines them in that order. We evaluate the runtime of our TAMP algorithm on seven families of kitchen rearrangement problems, comparing its performance to that of non-learning baselines. Our experiments show that PIGINet substantially improves planning efficiency, cutting down runtime by 80% on problems with small state spaces and 10%-50% on larger ones, after being trained on only 150-600 problems. Finally, it also achieves zero-shot generalization to problems with unseen object categories thanks to its visual encoding of objects. Project page https://piginet.github.io/.