AISpace2 Main Tools News Downloads Prototype Tools Customizable Applets Practice Exercises Help About AIspace

Describe the variable elimination steps for finding an optimal policy for a single-stage decision network. Prune all the nodes that are not ancestors of the utility node. Sum out all the chance nodes. There will be a single factor F remaining that represents the expected utility for each combination of decision variables. If v is the maximum value in F, return the assignment d that gives that maximum value v.

Main Tools: Graph Searching | Consistency for CSP | SLS for CSP | Deduction | Belief and Decision Networks | Decision Trees | Neural Networks | STRIPS to CSP