Abstract
Aiming at the problem that the traditional ant colony algorithm (ACO) has poor solution quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly, the genetic operator fused with the traditional ACO is proposed, and the genetic operation is used to expand the search space of the solution. Secondly, the fitness function is introduced in the traditional ACO and the safety distance is added. The pros and cons of the comprehensive evaluation algorithm planning path. Then, by introducing the optimization operator, the redundant nodes are eliminated and the smoothness is improved. Finally, the path planning simulation experiment is carried out in the grid map. The results show that the proposed algorithm can find a shorter and smoother in the dynamic environment 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 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.
