Scribd
Upload
49 views

Problem Reduction: - A Problem Can Be Divided Into A Set of Sub Problems, Where Each Sub

The document discusses problem reduction and representing solutions using AND-OR graphs. It provides an example AND-OR graph with nodes labeled A through H. The graph shows how a problem can be decomposed into subproblems represented by AND nodes, and solutions represented by OR nodes. It explains that the most promising nodes to expand are those with the lowest estimated remaining cost f' to reach the goal, even if they are not on the direct shortest path.

Uploaded by

sanjusunish
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
49 views

Problem Reduction: - A Problem Can Be Divided Into A Set of Sub Problems, Where Each Sub

The document discusses problem reduction and representing solutions using AND-OR graphs. It provides an example AND-OR graph with nodes labeled A through H. The graph shows how a problem can be decomposed into subproblems represented by AND nodes, and solutions represented by OR nodes. It explains that the most promising nodes to expand are those with the lowest estimated remaining cost f' to reach the goal, even if they are not on the direct shortest path.

Uploaded by

sanjusunish
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

PROBLEM REDUCTION

A problem can be divided into a set of sub problems, where each sub problem can be solved separately and a combination of these will be a solution. AND-OR graph is used for representing the solution.

The decomposition of the problem or problem reduction generates AND arcs.


One AND arc may point to any number of successor nodes.

A simple AND - OR graph

FIGURE : AND - OR graph

In figure (a) the top node A has been expanded producing two area one leading to B and leading to C-D . The numbers at each node represent the value of f ' at that node (cost of getting to the goal state from current state). For simplicity, it is assumed that every operation(i.e. applying a rule) has unit cost, i.e., each are with single successor will have a cost of 1 and each of its components. With the available information till now , it appears that C is the most promising node to expand since its f ' = 3 , the lowest value but going through B would be better since to use C we must also use D and the cost would be 9(3+4+1+1). Through B it would be 6(5+1).

In figure B the node G appears to be the most promising node, with the least f ' value. But G is not on the current best path, since to use G we must use G-H with a cost of 9 and again this use the arcsI-J (with a cost of 27). The path from A through B, E-F is better with a total cost of (17+1=18).

Algorithm:Problem reduction
1. Initialize the graph to the starting node 2. Loop until the starting node is labeled SOLVED or until its cost goes above FUTILITY: a) Traverse the graph starting at the initial node and following the current best path, and accumulate the set of nodes that are on the path and have not yet been expanded. b) Pick one of these unexpanded nodes and expand it. Add its successors to the graph and computer f ' (cost of the remaining distance) for each of them.if fof any of node is 0,mark the node as SOLVED. c) Change the f ' estimate of the newly expanded node to reflect the new information produced by its successors. Propagate this change backward through the graph. Decide which of the current best path.

You might also like