Abstract
The classical ant colony algorithm has the disadvantages of initial search blindness, slow convergence speed and easy to fall into local optimum when applied to mobile robot path planning. This paper presents an improved ant colony algorithm in order to solve these disadvantages. First, the algorithm use A* search algorithm for initial search to generate uneven initial pheromone distribution to solve the initial search blindness problem. At the same time, the algorithm also limits the pheromone concentration to avoid local optimum. Then, the algorithm optimizes the transfer probability and adopts the pheromone update rule of "incentive and suppression strategy" to accelerate the convergence speed. Finally, the algorithm builds an adaptive model of pheromone coefficient to make the pheromone coefficient adjustment self-adaptive to avoid falling into a local minimum. The results proved that the proposed algorithm is practical and effective.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.