Showing Revision 1 created 11/28/2012 by Amara Bot.

1. Title:
   08-12 Finding A Successful Plan Question
2. Description:

   Unit 8 12 Finding a Successful Plan Question

3. 0 0:00 - 0:03
   Let's say we performed that search.
4. 3000 0:03 - 0:06
   We had a big search tree, and then we threw out
5. 6000 0:06 - 0:09
   all the branches except one, and this branch of the search tree
6. 9000 0:09 - 0:13
   does itself have branches, but this branch of the search tree
7. 13000 0:13 - 0:17
   through the belief state represents a single plan,
8. 17000 0:17 - 0:19
   not multiple possible plans.
9. 19000 0:19 - 0:22
   Now, what I want to know is, for this single plan,
10. 22000 0:22 - 0:24
    what can we guarantee about it?
11. 24000 0:24 - 0:29
    So, say we wanted to know is this plan guaranteed to find the goal
12. 29000 0:29 - 0:32
    in an unbounded number of steps?
13. 32000 0:32 - 0:35
    And what do we need to guarantee that?
14. 35000 0:35 - 0:38
    So, it's an unbounded solution.
15. 38000 0:38 - 0:43
    Do we need to guarantee that
16. 43000 0:43 - 0:47
    some leaf node is a goal?
17. 47000 0:47 - 0:49
    So, for example, here's a plan to go through,
18. 49000 0:49 - 0:53
    and at the bottom, there's a leaf node.
19. 53000 0:53 - 0:57
    Now, if this were in problem solving,
20. 57000 0:57 - 1:01
    then remember, it would be a sequence of steps
21. 61000 1:01 - 1:04
    with no branches in it, and we know it's a solution
22. 64000 1:04 - 1:07
    if the one leaf node is a goal.
23. 67000 1:07 - 1:10
    But for these with branches, do we need to guarantee
24. 70000 1:10 - 1:13
    that some leaf is a goal,
25. 73000 1:13 - 1:17
    or do we need to guarantee
26. 77000 1:17 - 1:22
    that every leaf is a goal,
27. 82000 1:22 - 1:27
    or is there no possible guarantee
28. 87000 1:27 - 1:31
    that will mean that for sure we've got a solution,
29. 91000 1:31 - 1:33
    although the solution may be of unbounded length?
30. 93000 1:33 - 1:36
    Then I also want you to answer
31. 96000 1:36 - 1:38
    what does it take to guarantee
32. 98000 1:38 - 1:41
    that we have a bounded solution?
33. 101000 1:41 - 1:45
    That is, a solution that is guaranteed to reach the goal
34. 105000 1:45 - 1:49
    in a bounded, finite number of steps.
35. 109000 1:49 - 1:53
    Do we need to have a plan that has
36. 113000 1:53 - 1:57
    no branches in it, like this branch?
37. 117000 1:57 - 2:02
    Or a plan that has no loops in it,
38. 122000 2:02 - 2:05
    like this loop that goes back to a previous state?
39. 125000 2:05 -
    Or is there no guarantee that we have a bounded solution?