1. Show how mean-ends analysis could be used to solve a problem of getting one place to another. Assume that the available operators are like walk, drive, take the bus, take a cab, and fly?
Algorithm: The means ends analysis (Current state, goal state)
Step # 1: compare the current state with that of goal state and if there are differences between them then return,
Else,
Step # 2: select the important difference and try to reduce it by doing the following until a success or failure is being found:
(i) Select an un-tired operator O that is applicable to the current difference, if there are no operators then signal is failure
(ii) And select an operator O that is applicable to the current difference, if there is no operator O to the current state. Compute and/or generate two of the descriptions. O-START state, a state in which O’s preconditions are satisfied and O-RESULT that results when O is applied to O-START state.
(iii) If (FIRST- ONE <- Means-ends analysis (current, O- the start) and (the Last <- One Means – ends – analysis (O – the Result and, Goal state) are successful, then the return success by concatenating the First -One and the Last -One state.
Drive
|
Walk
|
Fly
| |
Cab
|
Yes
|
Yes
| |
Bus
|
Yes
| ||
Get cab empty
|
Yes
|
Yes
| |
Get bus empty
|
Yes
|
Yes
| |
Putting object
|
Yes
|
Yes
|
Using these prediction we can choose easy way to solve the Problem.
0 comments:
Post a Comment