Searching algorithm in AI.pptx

Searching algorithm in

1. Dr Mohammad Sabir Serching Techniques in Artificial Intelligence

2. What we will cover Ideas in searching Uninformed search Informed search

3. Search algorithms are  algorithms that help in solving search problems . A search problem consists of a search space, start state, and goal state. These algorithms are important because they help in solving AI problems and support other systems such as neural networks and production systems. Search algorithms  help the AI agents to attain the goal state through the assessment of scenarios and alternatives . The algorithms provide search solutions through a sequence of actions that transform the initial state to the goal state.

4. Important Terms Search Space: Possible conditions and solutions. Initial state : state where the searching process started. Goal state:- the ultimate aim of searching process. Searching strategy:- strategy for controlling the search. Search tree:- tree representation of search space, showing possible solution from initial state.

5. Searching for Solution Search through state space (Using searching tree) Concepts:- State;- condition in which the node corresponds. Parent node:- the superior node Path cost:- the cost, from initial to goal state. Depth:- no. of steps along the path initial.

6. Searching Strategies Uninformed Search (Blind search) Informed Search (Heuristics Search) The uninformed search does not contain any domain knowledge such as closeness the location of the goal. It uses domain knowledge , the problem information is available which can guide the search. Uninformed search applies a way in which search tree is searched without any information about the search space like initial state operates & test for goal, so it is called blind search . Informed search strategies can find a solution more efficient than uninformed. Informed search is also called as Heuristics Search. It examines such node until it achieves the goal node It can solve much complex problem which could not be solved in another way.