Artificial Intelligence assignment

Potential-based bounded-cost search and Anytime Non-Parametric A*. Artificial Intelligence 214 1-25. Given an environment with polygonal obstacles a maximum budget C (i.e. path length) and {S G} your goal would be to find the shortest path between S and G such that the path cost is less than C using Algorithm 1 in [Stern 2014]. [50 points]You should test your program with the environment shown in Fig. 3.31 first.C should be input the program — constraint in the problem.Show the path found. If there is no such path inform the user.Next create a new environment that is drastically different from the environment in 3.31. This environment should have at least 5 polygonal obstacles in it.Test your program in this environment like the previous one.Show the output for each input C.Please list in your submission PDF which C values worked and which did not work — not specific numbers but ranges for example.You will lose points without this information.Note that your program should show the user the final path found by your algorithm for a specific input value of C in both environments.You can use your Assignment 1 code as a base for this assignment.Create the SWITCH-CASE that will switch between the environments.Create a while loop to take inputs [environment number and C value] from the user until he/she decides to stop.You will lose points without this structure.Attach screenshots of your programs outputs with various values of C (should be properly labeled).Reminder: there are two main differences between A* and this algorithm.Instead of the f-value it uses their own-defined (u-value) — can be found before the algorithm.There is a constraint added in Algo 1 that decides which nodes should not be expanded as it has a higher cost than budget C. You should test your program with the environment shown in Fig. 3.31 first. C should be input the program — constraint in the problem. Show the path found. If there is no such path inform the user. Next create a new environment that is drastically different from the environment in 3.31. This environment should have at least 5 polygonal obstacles in it.Test your program in this environment like the previous one.Show the output for each input C.Please list in your submission PDF which C values worked and which did not work — not specific numbers but ranges for example.You will lose points without this information. Test your program in this environment like the previous one. Show the output for each input C. Please list in your submission PDF which C values worked and which did not work — not specific numbers but ranges for example.You will lose points without this information. You will lose points without this information. Note that your program should show the user the final path found by your algorithm for a specific input value of C in both environments. You can use your Assignment 1 code as a base for this assignment. Create the SWITCH-CASE that will switch between the environments. Create a while loop to take inputs [environment number and C value] from the user until he/she decides to stop.You will lose points without this structure. You will lose points without this structure. Attach screenshots of your programs outputs with various values of C (should be properly labeled). Reminder: there are two main differences between A* and this algorithm.Instead of the f-value it uses their own-defined (u-value) — can be found before the algorithm.There is a constraint added in Algo 1 that decides which nodes should not be expanded as it has a higher cost than budget C. Instead of the f-value it uses their own-defined (u-value) — can be found before the algorithm. There is a constraint added in Algo 1 that decides which nodes should not be expanded as it has a higher cost than budget C. Given an environment with polygonal obstacles a maximum budget C (i.e. path length) and {S G} your goal would be to find the shortest path between S and G such that the path cost is less than C using Algorithm 1 in [Stern 2014]. [50 points]You should test your program with the environment shown in Fig. 3.31 first.C should be input the program — constraint in the problem.Show the path found. If there is no such path inform the user.Next create a new environment that is drastically different from the environment in 3.31. This environment should have at least 5 polygonal obstacles in it.Test your program in this environment like the previous one.Show the output for each input C.Please list in your submission PDF which C values worked and which did not work — not specific numbers but ranges for example.You will lose points without this information.Note that your program should show the user the final path found by your algorithm for a specific input value of C in both environments.You can use your Assignment 1 code as a base for this assignment.Create the SWITCH-CASE that will switch between the environments.Create a while loop to take inputs [environment number and C value] from the user until he/she decides to stop.You will lose points without this structure.Attach screenshots of your programs outputs with various values of C (should be properly labeled).Reminder: there are two main differences between A* and this algorithm.Instead of the f-value it uses their own-defined (u-value) — can be found before the algorithm.There is a constraint added in Algo 1 that decides which nodes should not be expanded as it has a higher cost than budget C. ‘

Order a unique copy of this paper
(550 words)

Approximate price: $22

Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

We value our customers and so we ensure that what we do is 100% original..
With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

The Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.

Read more

Free-revision policy

The Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.

Read more

Privacy policy

The Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.

Read more

Fair-cooperation guarantee

By placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.

Read more

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency

Order your paper today and save 30% with the discount code HAPPY

X
Open chat
1
You can contact our live agent via WhatsApp! Via + 1 323 412 5597

Feel free to ask questions, clarifications, or discounts available when placing an order.