direct_lidar_inertial_odometry
[IEEE ICRA'23] A new lightweight LiDAR-inertial odometry algorithm with a novel coarse-to-fine approach in constructing continuous-time trajectories for precise motion correction.
Use a lightweight algorithm to accurately track motion using LiDAR and IMU sensors for mapping and navigation.
Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.
Get an email alert on its next release or when it starts trending — never miss the moment.
Free · no card · unsubscribe anytime[IEEE ICRA'23] A new lightweight LiDAR-inertial odometry algorithm with a novel coarse-to-fine approach in constructing continuous-time trajectories for precise motion correction.
direct_lidar_inertial_odometry has 1k stars on GitHub. It has been forked 250 times. direct_lidar_inertial_odometry is written mainly in C++. It has been in active development since 2023. direct_lidar_inertial_odometry is available under the MIT license. Its main topics are 3d-mapping, imu, lidar, lidar-inertial-odometry.
What is direct_lidar_inertial_odometry?
[IEEE ICRA'23] A new lightweight LiDAR-inertial odometry algorithm with a novel coarse-to-fine approach in constructing continuous-time trajectories for precise motion correction.
Is direct_lidar_inertial_odometry open source?
direct_lidar_inertial_odometry is an open-source project. It is released under the MIT license.
Is direct_lidar_inertial_odometry free?
Yes. direct_lidar_inertial_odometry is free and open source — you can use, modify and self-host it.
What license does direct_lidar_inertial_odometry use?
direct_lidar_inertial_odometry is available under the MIT license.
What language is direct_lidar_inertial_odometry written in?
direct_lidar_inertial_odometry is written mainly in C++.
Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.
[](https://olud.ai/project/vectr-ucla-direct-lidar-inertial-odometry.html)
Measured from GitHub topics shared by both projects, weighted by how rare each topic is.