人工智能代写 | Intro to Artificial Intelligence Assignment 1: Search algorithms

本次美国代写主要为AI人工智能相关的assignment

General Instructions

Teams: Assignment should be completed by teams of two students. No additional credit for
working individually. Use this form https://forms.gle/nFWwmcncohXTVbDE7 to inform the TAs
you either a) have a team (only one member of the team) b) looking for a team or c) working
alone (discourage).

Submission: Submit a PDF file to Sakai. For the programming questions, submit your code
in a compressed file. DO NOT submit documents in Word, raw text, images, etc. One submission
per team is enough. Be sure to submit before the deadline (see Sakai). You have unlimited
submission, partial submissions are encourage! Code submitted must run on ilab machines in
order the be graded.

Program Demonstrations: Each team will have 10 minutes to demonstrate the implementa-
tion to one TA as well as answer questions on a date scheduled after the deadline. Be sure to
prepare ahead to show the program running.

L ATEX: Extra credit (10%) for submitting answers using L AT EX. If you choose to do this, submit
all files (*.tex) as a separate compressed file.

Description

Consider a grid world like the one shown in Fig. 1, where an agent can move freely in the non-
blocked cells. The objective of this assignment is to implement and compare search algorithms
that will allow the agent to move from a given initial state to given goal state without colliding.
Properties of the agent:
• Is deterministic
• Moving left or right has a cost of 1
• Moving up or down has a cost of 2
• Cannot move diagonally

Your program must:
• Read the problem.txt file
• Read the specified grid world
• Solve the problem using the specified algorithm
• Show the resulting path and its cost

The problem.txt file
By lines (see example on Sakai):
0. Size of the maze N – integer
1. Start state xy – two integers: 0  x, y < N
2. Goal state xy – two integers: 0  x, y < N
3. Algorithm – integer from 0 to 4
4. Maze – integer representing the maze to use

Algorithms:
0. Select one of: Breadth-first search or Uniform-cost search
1. Select one of: Depth-limited, Iterative deepening depth-first search or bidirectional search
2. A* using one of h0, h1 or h2
3. A* using one of h3, h4 or h5
4. A* using your own heuristic


程序代写代做C/C++/JAVA/安卓/PYTHON/留学生/PHP/APP开发/MATLAB


本网站支持淘宝 支付宝 微信支付  paypal等等交易。如果不放心可以用淘宝交易!

E-mail: itcsdx@outlook.com  微信:itcsdx


如果您使用手机请先保存二维码,微信识别。如果用电脑,直接掏出手机果断扫描。

blank

发表评论