Artificial intelligence

Assignment 3

Submitted To:

Sir Qaiser
Abbas
Submitted By:

Madiha Anjum
Roll no:

BITF12EO31
BsIT(7th)SS

Exercise Questions
3.2 Your goal is to navigate a robot out of a maze. The robot starts in the center of the
maze facing north. You can turn the robot to face north, east, south, or west. You can
direct the robot to move forward a certain distance, although it will stop before hitting a
wall.
a. Formulate this problem. How large is the state space?
To formulate the problem we should start off by setting up a coordinate system with x and y vertices, so
start at center of a maze and set it as (0,0). The entire maze can be a square of (-1,1) to (1,1).
The way to test this will be as long as the x and y are greater than 1 to the current location. Successor
function can be moving forward any amount of distance and the cost function can be the total distance
moved.
The state space can be infinite due to robot position as infinite.
b. In navigating a maze, the only place we need to turn is at the intersection of two or
more corridors. Reformulate this problem using this observation. How large is the state
space now?
If the navigation is going to change to only needing turn at intersection of two or more corridors, we need
to have an exit node at the end of each corridor. The initial state will now be facing north in the center of
the maze as before. The test will be to get to an exit node. The successor function is to move past the
intersection if there is one in front of us, and the cost function is just the total distance moved as before.
The state space will have changed due to the number if intersections and that can be 4, therefore the
state space is now 4N with N being the number of intersections.
c. From each point in the maze, we can move in any of the four directions until we reach a
turning point, and this is the only action we need to do. Reformulate the problem using
these actions. Do we need to keep track of the robots orientation now?
Changing the navigation to only being able to move in any four directions till we reach the wall is what this
is asking for. To do this, the initial state will be at the center of the maze (direction wont matter due to the
fact that were just looking to reach a wall). The test will be to an exit node once again, and the successor
function will be to move to the next intersection (lets say you originally got to the north wall, now we need
to go to either the east,west, or south wall). The total cost function is the total distance moved as before.
d. In our initial description of the problem we already abstracted from the real world,
restricting actions and removing details. List three such simplifications we made.
Three simplifications that we could have made for this are the following:

1) We assumed that the robot can only face 4 directions, what if it could move in other ways?
2) We ignored the other variables about the world including the temperature, wind that may move the
robot and change orientation, and other natural causes.
3) We also ignored possibility of other robots in the same area or other items in the way of the robot
moving in its space.

3.3 Suppose two friends live in different cities on a map, such as the Romania map
shown in Figure 3.2. On every turn, we can simultaneously move each friend to a
neighboring city on the map. The amount of time needed to move from city i to neighbor j
is equal to the road distance d(i, j) between the cities, but on each turn the friend that
arrives first must wait until the other one arrives (and calls the first on his/her cell phone)
before the next turn can begin. We want the two friends to meet as quickly as possible.

a. Write a detailed formulation for this search problem. (You will find it helpful to define
some formal notation here.
We can start the search problem by defining the state space. States are all city pairs (i,j). The successor
function would be the successors of (I,j) lets call them, (x,y), and adjacent pairs (x,i), (y,j). The goal will be
to be at some (i,i) such that both people are in the exact same location together. The cost function in this
will be to going from (i,j) to (x,y).
b. Let D(i, j) be the straight-line distance between cities i and j. Which of the following
heuristic functions are admissible? (i) D(i, j); (ii) 2 D(i, j); (iii) D(i, j)/2.
The function thats admissible would be function (iii). This is because this way it is evenly spread out
between each friend.
c. Are there completely connected maps for which no solution exists?
Yes it is possible to have connected maps for which no solution exists. This is due to a possibility such as
if the two friends start at an odd number of steps apart, they will never be together in the same spot.
d. Are there maps in which all solutions require one friend to visit the same city twice?
This is not a possibility due to you finding a path in which the two friends meet together. It is not possible
to have them double back and go to the same city twice if you are trying to find the most efficient way in
which two people can meet

3.4 Show that the 8-puzzle states are divided into two disjoint sets, such that any state is
reachable from any other state in the same set, while no state is reachable from any state

in the other set. Devise a procedure to decide which set a given state is in, and explain
why this is useful for generating random states.
Definition: The goal state has the numbers in a certain order, which we will measure as Starting at the
upper left corner, then proceeding left to right, and when we reach the end of a row, going down to the left
most square in the row below. For any other configuration besides the goal, whenever a tile with a greater
number on it precedes a tile with a smaller number, the two tiles are said to be inverted. Proposition: For a
given puzzle configuration, let P denote the sum of the total number Of inversions and the row number of
the empty square. Then (N mod 2) is invariant under any Legal move. In other words, after a legal move
an odd P remains odd where as an even P Remains even. Therefore the goal state in Figure3.4, with no
inversions and empty square in the first row, has N=1 , and can only be reached from starting states with
odd P, not from starting states with even P. Proof: First of all, sliding a tile horizontally changes either the
total number of inversions nor the row number of the empty square. Therefore let us consider sliding a tile
vertically. Lets assume, for example, that the tile A is located directly over the empty square. Sliding it
down changes the parity of the row number of the empty square. Now consider the total number of
inversions. The move only affects relative positions of tiles A.B.C and D If none of the B,C,D caused an
inversion relative to A(i.e., all three are larger than A)then After sliding one gets three (an odd number) of
additional inversions. If one of the three is Smaller than A, then before the move B, C, and D contributed a
single inversion (relative to A) whereas after the move theyll be contributing two inversions -a change of
1,also an odd number. Two additional cases obviously lead to the same result. Thus the change in the
sum P is always even. This is precisely what we have set out to show. So before we solve a puzzle, we
should compute the P value of the start and goal state And make sure they have the same parity,
otherwise no solution is possible.

3.7 Consider the problem of finding the shortest path between two points on a plane that
has convex polygonal obstacles as shown in Figure 3.31. This is an idealization of the
problem that a robot has to solve to navigate in a crowded environment.

a. Suppose the state space consists of all positions (x, y) in the plane. How many states
are there? How many paths are there to the goal?
There will be infinite number of states and paths when the state space is (x,y).
b. Explain briefly why the shortest path from one polygon vertex to any other in the scene must
consist of straight-line segments joining some of the vertices of the polygons.Define a good state
space now. How large is this state space?
We start this off by knowing that the shortest path from one polygon vertex to any other is a straight line. If
it is not possible to make a straight line due to things in the way, then we need to make a few lines that
are as straight as possible. Make the line go straight till the obstacle, then deviate past the obstacle then
make another straight line. The obstacle is polygonal so the lines must go from start to tangent point and
the tangent points will be vertices of the obstacle. The state space will be the 35 set of vertices