A Comparison between Bat Algorithm andCuckoo Search for Path Planning

摘要

Here, metaheuristic search techniques are applied for robotic path planning. Robot has to move from its starting point called source point to final point called as destination point with minimum number of moves and iteration. Here both cuckoo search and bat algorithms are applied for the proposed problem and simulation results are compared. The techniques are applied for different number of population and bat algorithm provide better results as compared to cuckoo search.