Abstract
Abstract: An accurate robot localization, particularly in indoor environments, represents a challenging aspect in mobile robotics due to lack of computational power of commonly used embedded platforms. To reduce the required computational demands it is necessary to apply an efficient algorithm capable of parallelization. This contribution elaborates on implementation of Iterative Closest Point (ICP) laser scan matching algorithm. A computer program developed and optimized in C# language is compared to a mathematical model designed in MATLAB. The characteristics of both approaches are assessed based on computational demands (e.g. time) and nearest neighbor determination.
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.
