1. Quiz
Th. Jan. 19

2. 1. Consider an agent whose goal is to drive between between Los Angeles and
San Francisco to deliver a package. The agent (i.e. car) is mounted with a
single camera to observe it environment. On Monday July the agent
“dies” because it is hit by an airplane that happened to crash on its roof.
a) [2pt] Is this agent necessarily behaving irrational? Explain your answer.
b) [2pt] Give four examples of actuators or sensors for this agents (car).
c) [2pt] Is the task environment for the agent discrete or continuous? (Explain).
d) [2pt] Is the task environment for this agent episodic or sequential? (Explain).
2. Consider the graph below:
a) [2pt] Draw the first 3 levels of the search tree with root node given by A.
b) [2pt] Give a order in which we visit nodes if we search the tree breadth first.
c) [2pt] Express time and space complexity for general breadth-first search in terms
of the branching factor, b, and the depth of the goal state, d.
d) [2pt] If the step-cost for a search problem is not constant, is breadth first search
an optimal search algorithm? (Explain). D B F A E C

3. a). [2pt]. Is this agent necessarily behaving irrational
a) [2pt] Is this agent necessarily behaving irrational? Explain your answer.
No, rational is optimizing the expected utility.
b) [2pt] Give four examples of actuators or sensors for this agents (car).
sensor: camera, actuators: gas, horn, steering wheel.
c) [2pt] Is the task environment for the agent discrete or continuous? (Explain).
continuous: position on the road is for instance continuous.
d) [2pt] Is the task environment for this agent episodic or sequential? (Explain).
sequential: actions influence future actions. 2.
a) [2pt] Draw the first 3 levels of the search tree with root node given by A.
Expand the neighbors iteratively. You should be drawing the same node multiple times.
b) [2pt] Give a order in which we visit nodes if we search the tree breadth first.
Scan the tree level by level where the order inside a level is arbitrary.
c) [2pt] Express time and space complexity for general breadth-first search in terms
of the branching factor, b, and the depth of the goal state, d.
O(b^(d+1)) or O(b^d) for both time and space.
d) [2pt] If the step-cost for a search problem is not constant, is breadth first search
an optimal search algorithm? (Explain).
No, because deeper solutions may have lower cost than shallower solutions in that case,
and BFS will stop when it finds a shallow solution.