Abstract
Traditional ant colony algorithm is applied to mobile robot path planning, existing to slowly solve, slowly convergence speed, easy to fall into local optimal .A kind of double ant colony optimization based on combined optimization is proposed. Forward ant searched path be combined with backward ant searched path when two groups of ants in current generation completed a path search. Then the new paths were sorted, selecting the better path for global pheromone updating, combining the thought of MAX-MIN ant colony algorithm. Simulation experiment shows the improved ant colony algorithm can well solve the problems of the traditional ant colony.
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.
