Problem of Finding the Shortest Path - Crowded Environment - Engineering Assignment Help

Assignment Task :

Ques 01-3.7 Consider the problem of finding the shortest path between two points on a plane that has convex polygonal obstacles as shown in  . This is an idealization of the problem that a robot has to solve to navigate in a crowded environment. 
a) Suppose the state space consists of all positions (x,y) in the plane. How many states are there? How many paths are there to the goal?

b) Explain briefly why the shortest path from one polygon vertex to any other in the scene must consist of straight-line segments joining some of the vertices of the
polygons. Define a good state space now. How large is this state space?

c) Define the necessary functions to implement the search problem, including an ACTIONS function that takes a vertex as input and returns a set of vectors, each of
which maps the current vertex to one of the vertices that can be reached in a straight line.

d) Theoretically, apply any one of the algorithms from chapter 03(uninformed searches) to the above problem. 

This Engineering Assignment has been solved by our Engineering 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.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.