デモンストレーションからの帰納論理プログラミングによる合成的シンボリックタスクルールの学習
Learning Compositional Symbolic Task Rules from Demonstrations with Inductive Logic Programming
複雑なロボットタスクを抽象度の異なる複数の単純な学習目標に分解し、帰納論理プログラミングでシンボリックなルールを学習する手法を提案。合成ブロック組み立てタスクで解釈可能性と汎化性能を評価した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Oleh Borys, Karla Stepanova
分類: cs.RO
原文アブストラクト
Learning from Demonstration~(LfD) should capture not only how a task is executed, but also its high-level task structure that explains the demonstrated behavior. As robots become more autonomous, such task representations must be inspectable, reusable, and human-interpretable. To address this, we study how to represent and learn robotic tasks with inductive logic programming~(ILP) by decomposing a complex task into a series of simpler learning objectives at different abstraction (ontological) levels. The system infers symbolic rules from demonstrations and prior (domain) knowledge, and reuses learned rules when learning higher-level task structure. We evaluate the approach in a synthetic block-assembly scenario and show that the learned abstractions are interpretable and support strong generalization to harder, held-out tasks with unseen objects. These results provide preliminary evidence that decomposed ILP is a feasible approach to task-level LfD.
