Home /Research /Water Cycle Algorithm for Robot Path Planning
SWARM

Water Cycle Algorithm for Robot Path Planning

Eva Tuba, Edin Dolićanin, Milan Tuba

Year
2018
Citations
8

Abstract

Path planning problem is one of the fundamental problems in robotics. It refers to finding the optimal path between the start and target positions, where optimality depends on various factors and it needs to be defined considering all relevant demands. Path planning can be described as a hard optimization problem. In this paper, we used swarm intelligence water cycle algorithm for finding the shortest collision free path in two dimensional environments. The proposed method was tested and compared to other state-of-the-art method from literature. Considering the simulation results, our proposed approach represents a robust method that was able to find better paths.

Keywords

Motion planningPath (computing)Shortest path problemAny-angle path planningComputer scienceMathematical optimizationRobotAlgorithmFast pathSwarm intelligence

Related papers

Browse all SWARM papers