Exercises 1. Explain the difference between uninformed and informed search algorithms. 2. Explain what A* search is, including the advantages and disadvantages with respect to its theoretical properties. 3. Describe an admissible heuristic function and state two examples of heuristic functions you can establish for an 8-puzzle problem? 4. Suppose we wish to design a control algorithm for a robot arm. The control algorithm for a robot arm must determine which blocks are stacked on other blocks and which blocks have clear tops so that they can be moved. There are three slots on which blocks can be moved for example, given the initial state as shown in Figure 3 the robot has to re-arrange the blocks into the goal state shown in Figure 3. The legal moves are: 1. A block can only be moved if it does not have another block on top of it. 2. Only one block can be placed directly on top of another, although stacks of multiple blocks are allowed. i. ii. iii. A C Describe the initial state and the goal state for the blocks problem. Describe the successor functions Show how the robot will solve the problem indicating the changes in states from the initial state to the goal state. D Initial state Figure 3: The blocks problem B i. ii. B C D 5. Suppose we wish to design a control algorithm for a robot arm. A tabletop has three linear slots where blocks can be placed. Three blocks are given as illustrated in figure 4. The control algorithm has to enable the robot arm to stack, unstack, and otherwise move the A blocks on the table. In Figure 4 there are three blocks on the tabletop, numbered 1, 2, 3, two blocks on the first slot and a block on the third slot and the second slot is vacant. The control algorithm for a robot arm must determine which blocks; are stacked on other blocks and which blocks have clear tops so that they can be moved. The legal moves are: Goal state 2 1. A block cannot be moved if there is another block on top of it. 2. Blocks can be placed on one of the three slots provided or stacked on other blocks STUDENT GUIDE, 2023 EDITION COMPILED BY DR. B.MOYO 3. Blocks on the same level must be in ascending order. 4. Blocks on the same stack must be in ascending order. 5. No duplicate states are permitted. 9 Given that Figure 4 is the initial state describe the initial state. (For simplicity only one face is drawn instead of a cube. Therefore, the blocks appear like squares. Given that Figure 4 is the initial state, formulate the successor functions and generate the state space of all possible moves. (For simplicity only one face is drawn instead of a cube. Therefore, the blocks appear like squares. 3 15/