Abstract
An adaptive extended Kalman filter (AEKF) algorithm is proposed to resolve the problem of the error accumulation in the process of mobile robot localization. We take the Taylor series of sampling time in AEKF and use the Sage-Husa time-varying noise estimator to estimate observation noise in real time. Meanwhile, the convergence and the complexity of operation of AEKF are analyzed and the experiments show that AEKF has a good comprehensive performance in terms of speed and precision. Finally, two kinds of robot localization algorithm are analyzed and the error is compared with the experiment, that shows AEKF has a better performance.
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.
