Path Planning of a Multi Dimensional Robot in Static Environment Using Meta Heuristic Techniques

This paper focuses on finding the shortest and correct path for the robots without any collision with the objects in its environment. Generally global (static) and local environments are used for path planning of mobile robots. In this work, static environment is considered and an optimized path is evaluated for efficient robot movement from the start position to the end position. Different classical and evolutionary based path search algorithms are used so as to find the optimized path, with reduced computation time and path length of the mobile robot. The results reveal that evolutionary-based algorithms provide a more effective solution to the problem under consideration.