In: Computer Science
For each of the following assertions, say whether it is true or false. Justify your answers.
a) Imagine the next Mars rover stops working upon arrival on Mars. From this we can deduce that Mars rover is not a rational agent. (Note that a rational agent is not necessarily perfect, it's only expected to maximize goal achievement, given the available information.)
b) Every optimal search strategy is necessarily complete.
c) Breadth-first search is optimal if the step cost is positive
a)This assertion is false.The reasons because of which the Mars rover stops working are not mentioned.Since a rational agent takes the best possible action given a particular situation it is possible that the Mars rover stopped working due to multiple reasons:
1.Preventing a possibly worse situation in which could have caused further destruction of the rover and its data.
2.Preserving the data collected by not wasting any further fuel and instead going into sleep mode
3.Preventing any possible averse situation on the Mars surface being caused by any of the Rovers actions
b)This assertion is false.Any search strategy is said to be complete if it is guaranteed to find a solution when there is one.Optimal solution means there exists a best possible solution when there are multiple possible solutions.If there is a graph with infinite paths then performing depth first search is bad as it leads to a non complete and non optimal solution.if the goal is at a known depth then only the depth first search can be performed.If there is a large branching factor then performing breadth first search will be non optimal.In these situations performing these search strategies will not be complete.
c)This assertion is false.Breadth-first search strategy involves exploring all the nodes in a particular level before exploring the nodes in the next level.Traversing a particular path between any two nodes a and b has a step cost associated with it.Thus BFS expands a node with the least path cost first.For BFS to be optimal all the step cost functions of all the paths between any two nodes must be same.The Breadth First Search is said to be complete only if the total path cost is some positive number.