Question: Artificial and Computational Intelligence Q6. Problem Statement Let us consider one traveling app like MakeMy trip. There are source and destination cities where the agent

Artificial and Computational Intelligence Q6. Problem Statement Let us consider one traveling app like MakeMy trip. There are source and destination cities where the agent has to decide on which path he needs to travel. The following graph will give the cities with their time and fare. Here Start node is A and the Goal node is G. Note that the edge value from A to B "500/3hr" represents 500 is maximum fare and 3hr is the maximum time taken to reach A to B or vice-versa. Find the path which takes the least time to reach the destination. 500/hr 1250/3 850/3 1.5hr D 1500/2hr G 600/Shr 700/26 2500/3hr E 15h Note: 1. Explain the environment of the agent [20% weightage] Find the path and cost with respect to time or fare based on the given question [60% weightage] 3 Use appropriate data structures and implement a search algorithm to find the path that the agent can visit all the cities in the graph. [20% weightage] 4. The input has to be taken from the user. User need to choose the algorithm from following algo Uninformed search.Jnformed Search, Local search Artificial and Computational Intelligence Q6. Problem Statement Let us consider one traveling app like MakeMy trip. There are source and destination cities where the agent has to decide on which path he needs to travel. The following graph will give the cities with their time and fare. Here Start node is A and the Goal node is G. Note that the edge value from A to B "500/3hr" represents 500 is maximum fare and 3hr is the maximum time taken to reach A to B or vice-versa. Find the path which takes the least time to reach the destination. 500/hr 1250/3 850/3 1.5hr D 1500/2hr G 600/Shr 700/26 2500/3hr E 15h Note: 1. Explain the environment of the agent [20% weightage] Find the path and cost with respect to time or fare based on the given question [60% weightage] 3 Use appropriate data structures and implement a search algorithm to find the path that the agent can visit all the cities in the graph. [20% weightage] 4. The input has to be taken from the user. User need to choose the algorithm from following algo Uninformed search.Jnformed Search, Local search
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
