Efficient ABC Algorithm for Dynamic Path Planning

The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path from a specified start position to the target position. Moreover, the path should be optimal in some context such as distance, time or processing. This paper presents an efficient algorithm which is a variation of artificial bee colony algorithm. The environment modelled is in the form of grid consisting of obstacles. The algorithm works on two problems- the first problem is to find collision free path in the presence of static obstacles and the second problem is to determine shortest collision free path in the presence of dynamic obstacles.