A Face-off - Classical and Heuristic-based Path Planning Approaches
Vishal Chand, Avinesh Prasad, Kaylash Chaudhary, Bibhya Sharma, Samlesh Chand
Abstract
Robot path planning is a computational problem to find a valid sequence of configurations to move a robot from an initial to a final destination. Several classical and heuristic-based methods exist that can be used to solve the problem. This paper compares the performance of a classical method based on potential field, Lyapunov-based Control Scheme, with those of the standard and stepping ahead Firefly Algorithms. The performance comparison is based on the optimal path distance and time. The results show that the stepping ahead Firefly algorithm finds a shorter path in lesser duration when compared with the Lyapunov-based method. The LbCS also inherently faces the local minima problem when the start, target, and obstacle's center coordinates are collinear. This problem is solved using the firefly algorithm where the diversification of the fireflies helps escape local minima.