Abstract
In this paper, we propose a novel hierarchical path planning algorithm for mobile robots based on A* and reinforcement learning (RL) with the structure of two layers. In the first layer, we adopt the A* search algorithm to plan a geometric path and select several points as sub-target points for the planning of the next stage. In the second layer, a local path planning algorithm based on an approximate RL method called Least Square Policy Iteration (LSPI) is used to find a kinematically feasible path with these sub-targets. After learning, the local path planner in the second layer has good generalization performance. The path obtained by the proposed algorithm is smooth and safe for executing. Simulations have been carried out and the results demonstrate the validity of the proposed scheme.
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.
