Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Given below are the shared and distributed servers placed at various locations in your city. Now imagine it to be in a crisis and you

Given below are the shared and distributed servers placed at various locations in your city. Now imagine it to be in a crisis and you have been asked to compromise some communication lines and keep a minimum number of connections to keep the network up and going. You are required to find the sub set of connections for your work to go un-interrupted. Use the following algorithms to find the minimum network connections possible and help the network agent. a. Breadth First Search and b. Recursive Best First Search

Note 1: The edge costs depicted below is an approximation towards the transmission cost between any pair of nodes. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The average of the total transmission cost across all these paths is the heuristic value h(n).

image text in transcribedEvaluations will be based on the following. 1. Explain the PEAS (Performance measure, Environment, Actuator, Sensor.) for your agent. (20% marks) 2. Use Breadth First Search and Recursive Best First Search and implement the algorithms in PYTHON. The program should be able to take-in start and goal nodes dynamically from the user at run time. Compare to interpret the results in terms of the algorithm working, performance & shortest path if obtained relevant to the given problem. (20% + 20% = 40% marks) 3. Print the minimum connections that keeps the whole network up and running. For each incremental depth limit, corresponding node generating sequence should be legibly printed in the result. (20% marks) 4. Include code in your implementation to calculate the space complexity and time complexity and print the same. (20% marks)

a. Breadth First Search and b. Recursive Best First Search Note 1: The edge costs depicted below is an approximation towards the transmission cost between any pair of nodes. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The average of the total transmission cost across all these paths is the heuristic value h(n)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Beginning ASP.NET 4.5 Databases

Authors: Sandeep Chanda, Damien Foggon

3rd Edition

1430243805, 978-1430243809

More Books

Students also viewed these Databases questions