The path planning algorithms search for the collision-free path between the start and end points while satisfying the evaluation metrics 1. These algorithms are classified as the classical approaches, ...

To address the shortcomings of the gravitational search algorithm, such as its tendency to fall into local optima, slow convergence, and low solution accuracy, this paper proposes a gravitational ...

A search problem refers to the task of finding a solution within some space of possible options, and that space could be made up of discrete steps or continuously varying values. For example, solving ...