Approximate Task Tree Retrieval in a Knowledge Network for Robotic Cooking
Md. Sadman Sakib, David Paulius, and Yu Sun

TL;DR
This paper presents a method for generating and modifying robotic task plans using a knowledge graph called FOON, enabling robots to adapt to new recipes with unseen ingredients and states, achieving 76% accuracy.
Contribution
It introduces a novel approach to adapt task plans in a knowledge graph for robotic cooking, allowing for the creation of new recipes with unseen ingredients and states.
Findings
Task trees can be generated for new recipes with unseen ingredients.
The system achieves 76% correctness in depicting new ingredient combinations.
Semantic similarity aids in enriching FOON with novel recipes.
Abstract
Flexible task planning continues to pose a difficult challenge for robots, where a robot is unable to creatively adapt their task plans to new or unseen problems, which is mainly due to the limited knowledge it has about its actions and world. Motivated by a human's ability to adapt, we explore how task plans from a knowledge graph, known as the Functional Object- Oriented Network (FOON), can be generated for novel problems requiring concepts that are not readily available to the robot in its knowledge base. Knowledge from 140 cooking recipes are structured in a FOON knowledge graph, which is used for acquiring task plan sequences known as task trees. Task trees can be modified to replicate recipes in a FOON knowledge graph format, which can be useful for enriching FOON with new recipes containing unknown object and state combinations, by relying upon semantic similarity. We demonstrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Advanced Graph Neural Networks · AI-based Problem Solving and Planning
