Priyanka Goel, Devendra Singh
Abstract: This paper presents an improved algorithm for path planning using Artificial Bee Colony Algorithm. This algorithm is used to find collision free shortest path from the start position to destination. The environment considered here is a two dimensional space consisting of both static and dynamic obstacles. The ABC algorithm used is inspired by the collective behavior of bees to find better food sources around the hive.The path generated by the original algorithm may be shorter but may not be optimized. So, the final path is optimized using triangle inequality method.
Keywords: path planning, obstacles, collision, Artificial Bee Colony Algorithm, shortest paths