Monday, 12 September 2016

Hill - Climbing Algorithm in Artificial Intelligence

Hill - Climbing Algorithm :- It is also known as discrete optimization algorithm.It is a iterative algorithm and part of heuristic search category.

Algorithm :- 
  • Step 1 :- Put the initial node on the list BEGIN
  • Step 2 :- If  (BEGIN is EMPTY) or (BEGIN is GOAL) terminate search
  • Step 3 :- Remove the first node from BEGIN call this node as A
  • Step 4 :-If (A = GOAL) terminate the search process
  • Step 5 :-Else if node has a successor, generate all of them.Find how far they are from the goal node sort them by the remaining distance from the goal node and add them to the beginning of BEGIN
  • Step 6 :-GOTO  Step 2
Hill climbing technique is used in some activities in day to day life.

Examples :- 
  • While listening, playing flute on transistor so that the volume controls are adjusted in a way make the music melodious. 
  • While tuning carborator of scooter the accelerator will be raised to its maximum and carborator is used so that the engine keeps on running for a long period of time.
  •  An electronic expert while making the transistor for the first time tune the radio set and mid afternoon when signal is weak.
Problems Faced(Caused) in Hill Climbing Search :-
  1. Local Maximum
  2. Platern
  3. Ridge
  • Local Maximum :- A state thet is better than all it neighbours but not so bond compare with to states that far away.
  • Platera :- It is a large area of search state in which neighbours have the same values.
  • Ridge :- It is described as a long and narrow streach of evaluated ground or a narrow elivation aa based running along or a closed surface. According to oxford english dictionary ridge means - It is a area in the path which must be travels very carefully because movement in any direction might maintain one at the same level or resultant fast descant.
How to avoid these problems in Hill Climbing search :- 
  • For Local Maximum :- Backtracking helps in undoing what has been done so far and permits to try a totally different path to attain the global peak.
  • For platern :- A big jump is the solution to the escape from the platern. It is recommended because all neighbouring points have the same values.
  • For Ridge :- To overcome the problem of ridge we are trying different paths at the same time. 

  

No comments:

Post a Comment