The UCS Algorithm - Uniform Cost Search - Pseudo-Code for the USC - IT Assignment Help

Assignment Task:

Question 1: Let's Travel! (Uniform Cost Search)

A friend of yours gave you a map of UK but encoded as a JSON file: UK_cities.json. The file encodes all the roads between major cities of the UK with their length of the road (in km). After numerous arguments, you both decided to go from London to Aberdeen. Although you would like to go there while visiting as many cities as possible, neither you nor your friend can afford the time! You are then trying to reach Aberdeen from London taking the shortest path (the total driving distance). 

a. Following the UCS algorithm, manually execute it for three iterations for this problem. As a reminder, the pseudo-code of the UCS is provided in Figure 1 which matches Figure 3.13 in the textbook.

• By iteration, we are referring to the outer "loop". So, in your trace, at least three nodes should be selected for expansion. 
• In particular, you should provide (only) the content of the following variables, with the following specific data structure: 
(i) the "frontier": a queue of "nodes" ordered by their path-cost 
(ii) the "explored": a set of "states" 

• You should represent each "node" in the frontier as a tuple of the following information: ("state", "path-cost", "best-path-to-reach-that-state"). Note: the "state" in our problem is just the name of the city you are at! The "path-cost" is just a positive real number, and the "best-path-to-reach-that-state" is a list of states starting from the initial state to that node's state. For the trace, you should provide only one value per each line. Write down only the new value each time any of the above two variables change. The order definitely matters. 
• If you encounter any tie-breaking situation in the executing, e.g. in adding the nodes to the frontier, go with the alphabetical (lexicographical) order based on the name of the city. 
• No explanation or comments are necessary. For instance, you don't even need to tell which line/part of the pseudo-code was responsible for an update. We only check whether the trace is correct (including the order of updates). 

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