Author: Anonymous

Consider the game search tree with true utilities indicated at each leaf:

Which of the following (select all that apply) vertices will be visited by A* search using the Euclidean distance (L2 norm) heuristic before the goal is reached?

 A linear transformation applied to a multidimensional Gaussian distribution always results in a Gaussian distribution.

What is the optimal value function for a one-step horizon for s32?

For question 6-13: Consider planning via search on the following grid, where the agent can move from one cell to its eight immediate neighbors (up, down, left, right, and four diagonals) as long as the source and destination cells are unoccupied. The cost of up/down/left/right is 1 unit, and the cost of a diagonal move is sqrt(2). Occupied cells are filled. S = start, G = goal V1,2,3,4 are some labeled vertices (they do not bear any particular significance, just used for the questions that follow.)

Following the previous question, the robot makes an observation s=s2. What would be the values of the Belief? (Please round to the nearest hundredth)  p(xt=x1|st=s2) = [beliefx1] p(xt=x2|st=s2) = [beliefx2] p(xt=x3|st=s2) = [beliefx3] p(xt=x4|st=s2) = [beliefx4]

A* algorithm, with an admissible heuristic and non-negative weights:

How was Columbus received upon returning to Spain after his first voyage to the Americas?

For question 1-5: Consider the following planning domain and problem in PDDL Domain: (define (domain domain-d)  (:requirements :strips)  (:predicates    (prop1 ?x)    (prop2 ?x)    (prop3 ?x1 ?x2)  )  (:action act1      :parameters (?x1 ?x2)      :precondition (and         (prop1 ?x1)        (not (prop2 ?x2))        (prop3 ?x1 ?x2)      )      :effect (and          (not (prop1 ?x1))          (prop2 ?x2)      )  )  (:action act2      :parameters (?x1 ?x2)      :precondition (and         (prop2 ?x1)        (not (prop1 ?x2))        (prop3 ?x1 ?x2)      )      :effect (and          (not (prop2 ?x1))          (prop1 ?x2)      )  )) Problem: (define (problem problem-d)  (:domain domain-d)  (:objects x1 x2 x3 x4 x5)  (:init    (prop1 x1)    (prop3 x1 x2)    (prop3 x2 x3)    (prop3 x3 x4)    (prop3 x4 x5)  )  (:goal (prop1 x5)))  

Among the labeled vertices, which one will be explored first by A* using the Manhattan distance (L1 norm) heuristic?