Abstract
A* algorithm is a simple, scalable, and high reliable algorithm in the path planning algorithm. For the problem that service robots have high real-time characteristic and have short calculating time for algorithm, the A* algorithm is applied to the local path planning of service robots. To further improve the response speed of the algorithm, A* algorithm is improved by adjusting selection mechanism of the open update node choice and introducing the weight of Heuristics. The simulation and experimental results show that this new method has good planning performance. Adopting this new method can significantly reduce the searching time of algorithm and meet the high real-time need of service robots.
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 callMore From: IOP Conference Series: Earth and Environmental Science
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.
