arXiv Open Access 2022

A comparative study of the performance of different search algorithms on FOON graphs

Kumar Shashwat

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.RO

Penulis (1)

Kumar Shashwat

Format Sitasi

APA MLA BibTeX

Shashwat, K. (2022). A comparative study of the performance of different search algorithms on FOON graphs. https://arxiv.org/abs/2210.07428

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓