Abstract

A novel method for the real-time global optimal path planning of mobile robots is proposed based on the modified ant system (AS) algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the Dijkstra algorithm to find a sub-optimal collision-free path, and the third step is adopting the modified AS algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path. The results of simulation experiments confirm that the proposed method is effective and has better performance in convergence speed, solution variation, dynamic convergence behavior, and computation efficiency as compared with the path planning method based on the real-coded genetic algorithm.KeywordsMobile RobotPath PlanningGrid GraphRobot PathDijkstra AlgorithmThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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.