Abstract
In this paper, we propose a system to cope with the problem of autonomous mobile robot navigation. It is able to perform path planning and localize the robot in the real world environment. The path planning is first carried out using the known map, and the laser range scanner is then used to localize the robot based on the ICP registration technique. During the robot motion, the potential field is taken into account for obstacle avoidance. For the path planning, the visibility graph is established based on the current position of the robot. The Dijkstra algorithm is then used to find the shortest path to the goal position. Experimental results for both the simulation and real world environment are presented.
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.
