natsaravanan/19ai405expno10

ExpNo:10 Implementation of Classical Planning Algorithm

Algorithm or Steps Involved:

1. Define the initial state
2. Define the goal state
3. Define the actions
4. Find a plan to reach the goal state
5. Print the plan

Example - 1

initial_state = {'A': 'Table', 'B': 'Table'}
goal_state = {'A': 'B', 'B': 'Table'}

actions = {
    'move_A_to_B': {'precondition': {'A': 'Table', 'B': 'Table'}, 'effect': {'A': 'B'}},
    'move_B_to_Table': {'precondition': {'A': 'Table', 'B': 'B'}, 'effect': {'B': 'Table'}}
}

plan = find_plan(initial_state, goal_state, actions)
print(plan)

Output:

['move_A_to_B']

Example - 2

initial_state = {'A': 'Table', 'B': 'Table', 'C': 'Table'}
goal_state = {'A': 'B', 'B': 'C', 'C': 'Table'}

actions = {
    'move_A_to_B': {'precondition': {'A': 'Table', 'B': 'Table'}, 'effect': {'A': 'B'}},
    'move_B_to_C': {'precondition': {'A': 'B', 'B': 'Table', 'C': 'Table'}, 'effect': {'B': 'C'}},
    'move_C_to_Table': {'precondition': {'A': 'B', 'B': 'C', 'C': 'C'}, 'effect': {'C': 'Table'}}
}

plan = find_plan(initial_state, goal_state, actions)
print(plan)

Output:

['move_A_to_B', 'move_B_to_C']

Please Prepare Solution or Definition For the method find_plan(initial_state, goal_state, actions)

You Can use any of the searching Strategies for planning and executing a sequence of actions.
You can also look in to the Code given in the Repository.