Applications Hill Climbing Algorithm

Applications Hill Climbing Algorithm

Dr. Suneel Pappala, Associate Professor, Computer Science & Engineering,

Lords Institute of Engineering & Technology, Osmania University

Abstract:

Hill climbing is mathematical optimization techniques that belong to the local search family. It is an iterative algorithm that starts with an arbitrary solution to a problem and then attempts to find a better solution by making an incremental change to the solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found. The hill-climbing algorithm is a local search algorithm that moves continuously upward (increasing) until the best solution is attained. This algorithm comes to an end when the peak is reached. The state space diagram provides a graphical representation of states and the optimization function. If the objective function is the y-axis, we aim to establish the local maximum and global maximum. Hill climbing is useful in the effective operation of robotics. It enhances the coordination of different systems and components in robots.

Keywords: Hill climbing, Local Maximum, Global Maximum, Ridges.