Abstract
A variation of Ant Colony System (ACS) is represented in this paper and applied for the Robot Path Planning (RPP) purpose. The algorithm shows a new way to find the shortest path from source to destination in offline mode with the application of in-build path map by following the Robot Path Algorithm (RPA), introduced in this paper. Robot always follow the path map provided to it to find the shortest path as well as it can achieve the knowledge that in which direction, i.e. from one node to the next node, it will have to move. The movement of the robots is based on the movent technique of the ants in the ant colony. Among all the algorithms for finding the shortest path, the proposed Shortest Path Algorithm (SPA), based on Kruskal algorithm, is much more effective and accurate for the RPP problem and will take less computational time and hence increase the efficiency of the work process of the robot system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Hybrid Information Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
