论文标题
对Foon图上不同搜索算法的性能的比较研究
A comparative study of the performance of different search algorithms on FOON graphs
论文作者
论文摘要
机器人发现很难创造性地学习并适应新的看不见的挑战。这主要是因为它可以访问或经验的最低信息。 Paulius等。 [1]提出了一种构造封装功能图的方法。 Sakib等。 [2]进一步扩大了Foon物体以进行机器人烹饪。本文介绍了一个比较研究的比较研究（BFS），贪婪的广度首次搜索（GBFS）具有两个启发式功能，以及迭代的深度第一次搜索（IDF），并提供了其性能的比较。
A robot finds it really hard to learn creatively and adapt to new unseen challenges. This is mainly because of the minimal information it has access to or experience towards. Paulius et al. [1] presented a way to construct functional graphs that encapsulate. Sakib et al. [2] further expanded FOON objects for robotic cooking. This paper presents a comparative study of Breadth First Search (BFS), Greedy Breadth First search (GBFS) with two heuristic functions, and Iterative Depth First Search (IDFS) and provides a comparison of their performance.
