Lists (2)
Sort Name ascending (A-Z)
Stars
gisbi-kim / FAST_LIO_SLAM
Forked from hku-mars/FAST_LIOLiDAR SLAM = FAST-LIO + Scan Context
Front_end : fastlio2 Back_end : lio_sam
(LMNet) Moving Object Segmentation in 3D LiDAR Data: A Learning-based Approach Exploiting Sequential Data (RAL/IROS 2021)
Postgraduate Thesis: fast_lio_sam + dynamic removal (T-GRS 2024) + multi-session mapping (ICRA 2022 Kim) + object-level update + online relocalization (ICRA 2025) + real-world application (MD-LVIO)
A computationally efficient and robust LiDAR-inertial odometry (LIO) package
XLeRobot: Practical Dual-Arm Mobile Home Robot for $660
[IROS 2024] A LiDAR-inertial odometry (LIO) package that can adjust the execution frequency beyond the sweep frequency
Slam Toolbox for lifelong mapping and localization in potentially massive maps with ROS
LiDAR Iris for Loop-Closure Detection(IROS 2020)
A ROS-based solution to clear point cloud data by removing dynamic objects for mapping.
[T-IM 2025] TRLO: An Efficient LiDAR Odometry with 3D Dynamic Object Tracking and Removal
The First Dynamic Map Removal Benchmark | Included 8 SOTA methods | Continous updating
LiDAR SLAM: BoW3D (22' RA-L) + Scan Context (18 IROS) + LeGO-LOAM (18 IROS)
The page for PaGO-LOAM: Robust Ground-Optimized LiDAR Odometry
LeGO-LOAM, LIO-SAM, LVI-SAM, FAST-LIO2, Faster-LIO, VoxelMap, R3LIVE, Point-LIO, KISS-ICP, DLO, DLIO, Ada-LIO, PV-LIO, SLAMesh, ImMesh, FAST-LIO-MULTI, M-LOAM, LOCUS, SLICT, MA-LIO, CT-ICP, GenZ-IC…
IDDM (Industrial, landscape, animate, latent diffusion), support LDM, DDPM, DDIM, PLMS, webui and distributed training. Pytorch实现扩散模型,生成模型,分布式训练
This code describe an algorithm of Path Planning using Exact Cell Decomposition method.
Two path-planning algorithms for finding paths in a known environment - RRT(Randomly Exploring Random Forest) and Vertical Cell Decomposition
a theme for Typora(a markdown editor), designed for chinese essay
Common used path planning algorithms with animations.
C++ RRT (Rapidly-exploring Random Tree) Implementation
Coverage planning in general polygons with holes.