Abstract
Mobile robot could navigate in unknown environment autonomously with the help of Simultaneous Localization and Mapping (SLAM). Recently, SLAM based on information matrix enjoys much popularity since it is naturally sparse. However, the computational burden related to information matrix balloons with respect to the increase of the mapped landmarks. In this paper, by considering the features of information matrix, we present a novel method which wipes off nearly half of the elements in information matrix. The errors that come from sparsification decrease apparently by loop-closure. Furthermore, the relationship between sparsification and SLAM accuracy is analyzed theoretically. A large scale simulation and experiment conducted on a real robot suggest that the technique is effective for a robot's SLAM in real-world applications.
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.
