Reference no: EM133627556
Question: Consider the following Progression planning problem
State variables: S = {a, b, c, d}
Initial State: I = {a, b}
Goal State: G = {b, d}
Actions (format: <parameters, precondition, effect>):
• O1: < ∅, {a, b}, {¬b, c}>
• O2:<∅,{a,b},{¬a,¬b,d}> • O3: < ∅, {c}, {b, d}>
a. Show if we can reach the goal state or not.
b. What are the state(s) that will be added to the search space when state {a,b} is expanded by progression search?