Abstract
In recent years, when the path planning based on ant colony algorithm is used to find the optimal path under multiple constraints, it is easy to fall into the local optimal solution and lead to slow convergence. Under the constraints of path length, number of effective scenic spots, path smoothness and path obstacle distance, this paper constructs a fitness function model to evaluate the quality of roaming path. A hybrid algorithm of bacterial foraging optimization and ant colony optimization (BFO-ACO) is proposed by using the taboo table optimization strategy to solve the deadlock problem in the traditional ant colony algorithm, which improves the path diversity in the early stage of the algorithm. The replication and dispersion mechanism of bacterial foraging algorithm is introduced to improve the convergence speed as well as jump out of the local optimum. Experimental results show that the BFO-ACO algorithm obtains a higher-quality roaming path with the fewer iterations under multi-constrained environments, which provides the foundation for designing roaming path.
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 callMore From: Journal of Shenzhen University Science and Engineering
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.
