We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
作者您好,感谢您的开源工作,这里有一个疑惑,想要向您请教:
根据fast_lio2的论文,更新的方程如下: 在这个项目中,代码中求解方程如下: solution = K * meas_vec + vec - K * Hsub * vec.block<6, 1>(0, 0); 相比fast_lio2没有Jk预测方程的雅可比矩阵,请问这里是有什么不一样吗,为什么这里没有Jk。
solution = K * meas_vec + vec - K * Hsub * vec.block<6, 1>(0, 0);
谢谢!
The text was updated successfully, but these errors were encountered:
作者您好,感谢您的开源工作,这里有一个疑惑,想要向您请教: 根据fast_lio2的论文,更新的方程如下: 在这个项目中,代码中求解方程如下: solution = K * meas_vec + vec - K * Hsub * vec.block<6, 1>(0, 0); 相比fast_lio2没有Jk预测方程的雅可比矩阵,请问这里是有什么不一样吗,为什么这里没有Jk。 谢谢!
论文中有写,第一次是I,后面迭代更新就好了.
Sorry, something went wrong.
No branches or pull requests
作者您好,感谢您的开源工作,这里有一个疑惑,想要向您请教:
根据fast_lio2的论文,更新的方程如下:
在这个项目中,代码中求解方程如下:
solution = K * meas_vec + vec - K * Hsub * vec.block<6, 1>(0, 0);
相比fast_lio2没有Jk预测方程的雅可比矩阵,请问这里是有什么不一样吗,为什么这里没有Jk。
谢谢!
The text was updated successfully, but these errors were encountered: