Abstract
In algorithms of obstacle avoidance for autonomous mobile robot, APF algorithm is simple, real-time and smooth, but has some limitations for solving problems. For example, the local minimum point may trap mobile robots before reaching its goal. Even though many improved APF algorithms have been put forward, few articles describe the process in detail to show how these algorithms are applied. Considering above factors, this paper focuses on embodiment of abstract improved theory for APF algorithm by showing some changes with formulas and parameters. The whole work has been done in simulation environment. According to the results this paper draws a conclusion.
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.
