undefined

Question 9 (3.5 points) Match the search term (search strategy or modification of a search strategy) to its definition. You will use each term once. Modification to a basic search strategy that discards all but one path to an intermediate node when multiple paths have been found. Modification to a basic search strategy in which nodes on the frontier are recomputed instead of being stored in order to save space at the expense of computational time Search strategy which always selects the node on the frontier that has the lowest heuristic estimate of the distance to the goal node from the frontier node 1 A search 2. Best first search A search strategy that searches concurrently forward from the start node and backward from the goal node. 3. Bidirectional search 4. Branch and bound search A search strategy that breaks up a problem into subproblems by identifying an intermediate node (or a set of intermediate nodes) through which a path must pass. 5. Island-driven search 6. iterative deepening 7. Multiple path pruning Search strategy that combines lowest cost-first search and best first search to always explore the node on the frontier that has the lowest estimated total cost to the goal node (the sum of the cost of the path to get to that frontier node plus the estimate of the cost from that node to the goal node). A strategy that first finds some path to a goal node with some cost c then whenever it exceeds costc when searching for other paths, it discards that path. Question 9 (3.5 points) Match the search term (search strategy or modification of a search strategy) to its definition. You will use each term once. Modification to a basic search strategy that discards all but one path to an intermediate node when multiple paths have been found. Modification to a basic search strategy in which nodes on the frontier are recomputed instead of being stored in order to save space at the expense of computational time Search strategy which always selects the node on the frontier that has the lowest heuristic estimate of the distance to the goal node from the frontier node 1 A search 2. Best first search A search strategy that searches concurrently forward from the start node and backward from the goal node. 3. Bidirectional search 4. Branch and bound search A search strategy that breaks up a problem into subproblems by identifying an intermediate node (or a set of intermediate nodes) through which a path must pass. 5. Island-driven search 6. iterative deepening 7. Multiple path pruning Search strategy that combines lowest cost-first search and best first search to always explore the node on the frontier that has the lowest estimated total cost to the goal node (the sum of the cost of the path to get to that frontier node plus the estimate of the cost from that node to the goal node). A strategy that first finds some path to a goal node with some cost c then whenever it exceeds costc when searching for other paths, it discards that path