Abstract
To overcome some shortcoming existed in the conventional ant colony algorithms, e.g. slow converging and trend for falling into local convergences, a novel method for robot path planning is introduced based on cellular ant colony. Firstly, two ant colonies were set to run with different strategies. Secondly, the existing ant colony paths were evolved by following the cellular rules, so that the ants could jump from the current region into the region with a solution. Experiment results showed that the proposed algorithm proved to be stable, and that the global optimal path was found in a short time in a number of iterations.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
