A Complete Consistent Plan Given that the initial state holds at time 0, a plan is a solution iff Complete The preconditions of every operator at time 1, is satisfied by a proposition at time i The goal propositions all hold in the final state · Consistent: The operators at any time i can be executed in any order, without one of these operators undoing the .preconditions of another operator at time i .effects of another operator at time 1. Example of a Complete Consistent Plan Initial Conditions:(and(clean Hands)(quiet)) (and(no Garbage)(dinner)(present) noGarb clean carry clean ok (noop dinner nner →( dinner (noop present) at 1 Action at 1 2 Action at 2 Prop at 3A Complete Consistent Plan Given that the initial state holds at time 0, a plan is a solution iff: is satisfied by a proposition at time i. without one of these operators undoing the: •preconditions of another operator at time i. •effects of another operator at time i. dinner present cook wrap carry cleanH quiet noGarb cleanH dinner present Prop at 1 Action at 1 Prop at 2 Action at 2 Prop at 3 Example of a Complete Consistent Plan Initial Conditions: (and (cleanHands) (quiet)) Goal: • Complete: • The preconditions of every operator at time i, • The goal propositions all hold in the final state. • Consistent: • The operators at any time i can be executed in any order, (noop dinner) (noop present) (and (noGarbage) (dinner) (present))