Answered step by step
Verified Expert Solution
Link Copied!
Question
1 Approved Answer

Artificial Intelligence: Let us consider one traveling app. There are source and destination cities where the agent has to decide on which path he needs

image text in transcribedArtificial Intelligence: Let us consider one traveling app. 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.

Please follow the below template that stipulates the structure of code and documentation.

#Problem solving using______ Search Algorithm (uninformed/ informed/ local)

#Define the agent environment in the following block

#PEAS environment, Initial data structures to define the graph and variable declarations

#Coding begins here

#Implementation of ______ Search Algorithm (Students are supposed to find the best algorithm according to the Problem!!)

#Calling main function

#The agent should provide the following output

#The path taken by agent

#Call the Function that prints the path taken by the agent

#The cost of the path taken

#Call the Function that prints the cost of the path

Artificial and Computational Intelligence 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. 3hr B 500/3hr 1250/3hr 5hr A 850/3hr 590/1.5hro 1.5hr 1500/2hr 650/2hr 1000/4hr G Ohr 700/2hr 600/3hr 2500/3hr 5hr 1.5hr Note: 1. Explain the environment of the agent 2. Find the path and cost with respect to time or fare based on the given question 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. 4. The input has to be taken from the user. Artificial and Computational Intelligence 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. 3hr B 500/3hr 1250/3hr 5hr A 850/3hr 590/1.5hro 1.5hr 1500/2hr 650/2hr 1000/4hr G Ohr 700/2hr 600/3hr 2500/3hr 5hr 1.5hr Note: 1. Explain the environment of the agent 2. Find the path and cost with respect to time or fare based on the given question 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. 4. The input has to be taken from the user

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_2

Step: 3

blur-text-image_3

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

Database Machine Performance Modeling Methodologies And Evaluation Strategies Lncs 257

Authors: Francesca Cesarini ,Silvio Salza

1st Edition

3540179429, 978-3540179429

More Books

Students explore these related Databases questions