An Approach to Reduce Computational Cost for Localization Problem
One of the biggest factors that contribute to the computational cost of extended Kalman filter-based SLAM is the covariance update. This is due to the multiplications of the covariance matrix with other parameters and the increment of its dimension, which is twice the number of landmarks. Therefore...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Conference or Workshop Item |
| اللغة: | English English |
| منشور في: |
2014
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://umpir.ump.edu.my/id/eprint/9786/1/An%20Approach%20to%20Reduce%20Computational%20Cost%20for%20Localization%20Problem.pdf http://umpir.ump.edu.my/id/eprint/9786/7/An%20Approach%20to%20Reduce%20Computational%20Cost%20for%20Localization%20Problem%20-%20Abstract.pdf http://umpir.ump.edu.my/id/eprint/9786/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | One of the biggest factors that contribute to the computational cost of extended Kalman filter-based SLAM is the covariance update. This is due to the multiplications of the covariance matrix with other parameters and the increment of its dimension, which is twice the number of landmarks. Therefore a study is conducted to find a possible technique to decrease the computational complexity of the covariance matrix without minimizing the accuracy of the state estimation. This paper presents a preliminary study on the matrixdiagonalization technique, which is applied to the covariance matrix in EKF-based SLAM to simplify the multiplication process. The behaviors of estimation and covariance are observed based on three case studies. |
|---|