Exam Preparation

Search Problem

In machine learning and artificial intelligience field search problem refers to finding optimal solution between set of possible solutions,based on criteria

Search problem consist of :
-State Space: The entire set of possible states including initial and all reachable states after applying actions

-A successor function: In the context of AI it refers to function that given a current state then it generates set of possible states agent can go by applying valid action

-A start state: Starting point of research

and

goal state : The state that satisfies the condition or criteria.Reaching this state means problem solved.

Solution is a sequence of actions which transforms the initial state to goal state

Search problem is a process about finding a sequence of actions that leads from an initial state to goal state.

Execution: After search algorithm found the action it recommends can be carried out.This execution called the execution phase.

Open loop execution that refers after solution decided agent wont take any new sensory input it justs follows the algorithm sequence of actions.

The world state includes every last detail of information.

A state space graph mathematical represantation of search problem

In a state space graph each state occurs once
Arcs represent successor function, Nodes are world configurations, The goal test is set of goal nodes(maybe only one)

Search tree is tree structure visualization technique in AI,where each node represents nodes and each brand represents action leading to new state