Abstract
To solve optimization problems in path planning, many methods have been proposed. One of these methods is to mimic ant's behavior in path finding, formally named as Ant Colony Optimization (ACO) algorithm. Since first proposed in the nineties of the last century, this algorithm has attracted a lot of attention of researchers and scientists. Many modified versions of the algorithm have been investigated to accelerate the decision process for the determination of the optimal solution. This paper presents a refined ACO algorithm, which is an integration in principle of several approaches of ACO algorithm, with Multiple Ant Colonies Algorithm plays the main role. Some simulations are performed to show its overwhelming performance in solving path finding problem.
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.
