Abstract

Optimal path planning for mobile robots plays an important role in the field of robotics. At present, there are many advanced algorithms used to solve this optimal problem. However, for those algorithms, it is very difficult to solve some path planning problems containing certain constraint conditions due to the complex background environment. Based on the intensified ant colony optimization algorithm, the path planning optimization is carried out with numerical analysis and computations. The simulation results are satisfactory. In this paper, for the first time, intensified ant colony optimization algorithm is used to solve path planning for mobile robots which is a continuous function optimization problem containing constraint conditions. It also provides a new solving approach to the similar problems.

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 call

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.