2022/11/15 by Tyree Lewis, Lewis, Tyree
Computer Science · #AI-based Problem Solving and Planning #FOS: Computer and information sciences #Machine Learning and Algorithms #Other Computer Science (cs.OH) #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.2211.08314
openalex publication_date 2022/11/15 · openalex created_date 2022/11/24 · openalex updated_date 2026/07/28
The functional object-oriented network (FOON) has been developed as a knowledge representation method that can be used by robots in order to perform task planning. A FOON can be observed as a graph that can provide an ordered plan for robots to retrieve a task tree, through the knowledge retrieval process. We compare two search algorithms to evaluate their performance in extracting task trees: iterative deepening search (IDS) and greedy best-first search (GBFS) with two different heuristic functions. Then, we determine which algorithm is capable of obtaining a task tree for various cooking recipes using the least number of functional units. Preliminary results show that each algorithm can perform better than the other, depending on the recipe provided to the search algorithm.