Abstract
An improved dynamic window method is designed as a local path planning method. Aiming at the problem of unreasonable path selection in traditional dynamic window approach when it is close to the target point and dense obstacles, an improved dynamic window approach is proposed. A new objective function is introduced in the algorithm to improve the speed selection when the robot approaches the target point. The number of obstacles is introduced into the velocity evaluation function to improve the problem that dynamic window approach is easy to bypass dense obstacles. Simulation experiments in different environments show the effectiveness of the improved algorithm.
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.
