Abstract
Objectives: To propose an algorithm for global optimized path planning for mobile robots on static and observable environments, based on image skeleton technique and using some other image processing algorithms. Methods/Analysis: The proposed geometric scheme is supported on the skeletonization of image of free space into a navigation environment, as a strategy to limit the number of possible paths from a starting to end points for a mobile robot. This approach, considerably simplifies the selection of appropriate paths, allows defining lines (edges) that can be utilized by graphs for the specification of paths. Several simulation and real test were done to prove the efficiency of the algorithm. For the real test, a prototype differential platform was build using a LEGO Mindstorms NXT robotics kit. Findings: The strategy demonstrated excellent performance and robustness over about 50 simulations and experimental tests, finding always a feasible and short path., but taking in average 6.4 seconds to find the solution. Novelty/Improvements: The proposed algorithm showed to work better than other tested algorithms like Voronoi and Bug, especially when the navigation environment is a maze.
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.
