Professional Documents
Culture Documents
P.T.O
Q(3) Consider the following search space:
Suppose we want to use the A* algorithm on the graph to find the shortest path
from node S to node G. Each node is labeled by a capital letter and the value of a
heuristic function. Each edge is labeled by the cost to traverse that edge.
- For nodes on the same level assume alphabetical order in blind search.
- Show the order of the states visited (include the repeated) by:
a. The Breadth First algorithm.
c. The A* algorithm.
Q(4) Develop a PEAS description of the task environment Autonomous Mars robot
Best Wishes
Areeg Abdalla