人工智能案例分析

e the A* search algorithm, and the “Manhattan Distance” heuristic.

The number in the UP-RIGHT stands for the order of search

According to the picture, we can get the formula: F = G + H;

The “F” in the up-left stands for the minimum step form the start to the end when passing by the right cube;

The “G” in the down-left stands for the total step that have moved;

The “H” in the down-right stands for the estimation steps that will move to the end.

There are different ways to get the end but the way will go north first and then east and then south and then the west.

an advantage of each algorithm. Which algorithm would you use to solve this problem? Briefly explain why

When the complexity is appropriate:

The BFS can find the shortest way

The DFS can save the memory

The A* is a kind of heuristic algorithm, which means it is more efficiency, because the method will evaluate the cheapest cost.

I prefer to chose the A* method mainly because when the complexity is appropriate, this method can get a better way than the DFS and can find way more quickly and memory saving than the BFS.

Which means, maybe some times it is not the best, but it always is the better.

5.tic-tac-toe

Bonus Question 1 Email: chuanheliu@ username: CXL517

6. Emotion model

a.

it is because there are 5 variables: Happy, Wait, Task, Execute, Ignore.

So 2^5 = 32 parameters are required to describe the Full Joint Probability Distribution b.

c.

= 2Task + 2 X 2Wait + 2 X 2 Happy + 2 X 4 Execute + 2 X 2

=2+4+4+8+4 =22

d.

NO, because there are no relations between happy and wait;

e.

Yes, because only when the robot is happy can it ignore the task.

Bonus Question 2

Email: chuanheliu@

username: CXL517