Abstract
Global optimal path planning is always an important issue in mobile robot navigation. To avoid the limitation of local optimum and accelerate the convergence of the algorithm, a new robot global optimal path planning method is proposed in the paper. It adopts a new transition probability function which combines with the angle factor function and visibility function, and at the same time, sets penalty function by a new pheromone updating model to improve the accuracy of the route searching. The results of computer emulating experiments prove that the method presented is correct and effective, and it is better than the genetic algorithm and traditional ant colony algorithm for global path planning 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.
