Abstract
When an AGV (Automated Guided Vehicle) performs navigation tasks, it needs to run the path planning algorithm to obtain an optimal path in a current environment. In this paper, Dijkstra algorithm and A*algorithm with different heuristic functions are applied to static environment modeling with various types of obstacles. To solve the problem that there are many redundant points and inflection points in the search process of the A*algorithm, an improved A*algorithm with Manhattan distance as a heuristic function is selected as the path planning algorithm. In addition, a calculation method of optimizing a past cost function is proposed, and the weight of heuristic function is optimized simultaneously. Simulation results show that the improved algorithm has a higher efficiency and less path inflection points than the traditional A*algorithm has.
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.
