Implementation of Tree-Based Search Algorithms - Robot Navigation Problem - Computer Science Assessment Answer

Computer Science Assessment Answer

TASK: You need to implement tree-based search algorithms in software (from scratch) to search for solutions to the Robot Navigation problem. Both informed and uninformed methods will be required. You will also need to do some self-learning to learn several search methods. The Robot Navigation Problem In the lectures you have seen the Robot Navigation problem: The environment is an NxM grid (where N > 1 and M > 1) with a number of walls occupying some cells (marked as grey cells). The robot is initially located in one of the empty cells (marked as a red cell) and required to find a path to visit one of the designated cells of the grid (marked as green cells). For instance, the following is one possible environment: Assume that the cells of the grid are located by their coordinates with the leftmost top cell being considered to be at the coordinate (0, 0). A wall is a rectangle whose leftmost top corner occupies a cell (x,y) and whose width (w) and height (h) capture its size. For instance, the above environment can be expressed by the following specification: Search Algorithms The following describe a number of tree based search algorithms. Note: When all else is equal, nodes should be expanded according to the following order: the agent should try to move UP before attempting LEFT, before attempting DOWN, before attempting RIGHT, in that order. DFS, BFS, GBFS and AS have been covered in the lectures and the tutorials. Command Line Operation Your program needs to operate from a DOS command-line interface to support batch testing. A DOS command-line interface can be brought up in Windows 7/8/10 by typing cmd into the search box at the Start button. However, please ensure that your program works on Windows 7 because we will be testing your program on Windows 7. This can be accomplished with a simple DOS .bat (batch) file if needed. Below are the three different arguments formats you need to support. Note the unique argument count for each.

This Computer Science Assignment has been solved by our Computer Science experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.