Performance Analysis of BFS and DFS Algorithms for Food Serving Robot in an Eatery

EasyChair Preprint 5638

Abstract

Technological advancements in the industry4.0 has huge out-turn in the automation of food industry to an incredible extent. Consequently, the serving robot in an eatery has all the aspects of critical importance in terms of fast and safe food delivery to the customers. Highlighting on that note, this paper has the comparative study on the performance of two major algorithms namely BFS and DFS and they are implemented on a 10x10 virtualized grid floor plan of an eatery which are simulated in MATLAB. The comparison is done on the performance attributes like optimality, completeness, time complexity and space complexity in which both Breadth First Search (BFS) and Depth First Search (DFS) are equally optimal and complete to find a path for serving robot. It is observed that the average time consumption and average space consumption is lesser in the BFS algorithm. The time complexity and space complexity being the key attributes had a significant variation in the statistical results and concluded BFS as the better algorithm for the application of serving robot in an eatery.

Keyphrases: BFS, DFS, Serving robot, food automation, graph-based planning, space complexity, time complexity

@booklet{EasyChair:5638,
  author    = {P Navya and R Ranjith},
  title     = {Performance Analysis of BFS and DFS Algorithms for Food Serving Robot in an Eatery},
  howpublished = {EasyChair Preprint 5638},
  year      = {EasyChair, 2021}}