Solving Problems with Searching Flashcards
Search-based Agent
Searches through possible plans using current state space and returns first plan that reaches goal state.
update_state(percept)
Constructs a state space representation from current percepts.
make_goal(state)
Define success using current state.
make_problem(state, goal)
Set up possible actions, construct state space, initialize book-keeping
search(problem)
Return plan/sequence of actions that take agent from start state to the/a goal state. Always defines plan as first state that passes the goal test.
Plan
List of actions needed to reach the goal.
Components of Problem
Start state, successor function,
goal test function,
step cost
Start State
Initial state where agent beginsS
Successor Function
S(state), returns set of (action, successor state) pairs
Goal Test Function
Goal(state), return true if the passed-in state is a goal
Step Cost Function
c(s1, a, s2), returns the cost of moving from ‘s1’ to ‘s2’ using action ‘a’
Components of Search-based Agent
update_state, make_goal, make_problem, search