Question: Prove the following assertions about planning graphs: a. A literal that does not appear in the final level of the graph cannot he achieved. b.
Prove the following assertions about planning graphs:
a. A literal that does not appear in the final level of the graph cannot he achieved.
b. The level cost of a literal in a serial graph is no greater than the actual cost of an optimal plan for achieving it.
Step by Step Solution
3.34 Rating (157 Votes )
There are 3 Steps involved in it
a Literals are persistent so if it does not appear in the final level ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
21-C-S-A-I (166).docx
120 KBs Word File
