日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

週刊ニュースレター購読
タスク計画arXiv:2608.21035v1

TaPeR: 少数のデモンストレーションからの疎なタスク先行関係グラフの確率的復元

TaPeR: Probabilistic Recovery of Sparse Task Precedence Graphs from a Handful of Demonstrations

シェア:XThreadsFacebookLINEはてブBluesky

人間のデモンストレーションから、タスクの部分的な順序関係(先行関係)を確率的に推定し、ロボットが柔軟にサブタスクを並べ替えられるようにする手法を提案した論文。

著者: Adrian Röfer, Karla Stepanova, Abhinav Valada

分類: cs.RO

原文アブストラクト

Long-horizon manipulation tasks are often only partially ordered. For example, when assembling an electronic device, the battery and circuit board may be installed in either order, but both must be in place before the enclosure is closed. Recovering such dependencies enables robots to flexibly reorder subtasks while preserving task validity. Existing approaches typically infer task structure from human demonstrations using both temporal and symbolic supervision. However, symbolic predicates require explicit grounding, which is difficult to obtain in realistic settings. In this work, we present an approach for extracting task dependency structures from demonstrations using only simple kinematic graphs and distributions over relative object poses. From these representations, our method estimates pairwise task-step-dependency probabilities and uses them to initialize the edge weights of a precedence graph. We then introduce a filtering pipeline that converts this graph of probability estimates into the final task dependency graph. We evaluate our approach on an existing benchmark and on a new dataset comprising longer tasks with more complex dependencies. We find that our method recovers more accurate task structures from fewer demonstrations than the baselines. Finally, we demonstrate that the inferred graphs can be used to generate multiple valid robotic execution orders for the same task.

関連論文