pangxiansen123

2D_Lidar_Slam

2D激光SLAM学习代码(深蓝激光slam大作业)

study_shenlan

the annotation of shenlan

agv_local_planner

A Novel Online Time-Optimal Kinodynamic Motion Planning for ROS local planner plugin Using NURBS

amcl_noted

amcl代码注释

amcl_pose_updater

This is modified version of amcl ros package. We added amcl pose updater that updates amcl_pose and the particle states when known-pose flag is detected.

arips_local_planner

ROS local planner navigation plugin using potential fields

automatic_parking

Automatic docking based on LiDAR and self-designed dock.

cartographer_detailed_comments_ws

cartographer work space with detailed comments

cmake-cookbook

CMake Cookbook recipes.

costmap_depth_camera

This is a costmap plugin for costmap_2d pkg. This plugin supports multiple depth cameras and run in real time.

Creating-2D-laser-slam-from-scratch

从零开始创建二维激光SLAM

DBSCAN

DBSCAN: faster evaluation using nanoflann's kdtree

fetch_open_auto_dock

An open-source version of the Fetch charge docking system.

laser-docking

Autonomous docking based on landmark detection using 2D laser scanner

Loop-Closure-Detection-with-DBoW2

Loop closure detection with DBoW2 using mez's monocular VO.

my_move_base

nanoflann

nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees

note_of_ubuntu

关于ubuntu的一些使用说明

Patch-NetVLAD

Code for the CVPR2021 paper "Patch-NetVLAD: Multi-Scale Fusion of Locally-Global Descriptors for Place Recognition"

path_planner

Hybrid A* Path Planner for the KTH Research Concept Vehicle

PathPlanning

Common used path planning algorithms with animations.

plan-paper

路径规划的相关论文

rf2o_laser_odometry

Estimation of 2D odometry based on planar laser scans. Useful for mobile robots with innacurate base odometry. For full description of the algorithm, please refer to: Planar Odometry from a Radial Laser Scanner. A Range Flow-based Approach. ICRA 2016 Available at: http://mapir.isa.uma.es/mapirwebsite/index.php/mapir-downloads/papers/217

space_filling_forest_star

Space-Filling Forest* for milti-goal path planning

tangent_planner

ROS base local planner plugin which uses the tangent bug algorithm

teb_note

Travelling-Salesman-Problem-Solve-with-Genetic-Algorithm-with-ROS-ANd-c-LANGUAGE

In the traveling salesman problem, it aims to find the shortest route or the least costly tour that passes through each of the cities with known distances only once. Although it is easy to define the traveling salesman problem, it is very difficult to obtain the optimal solution and it is among the NP-difficult (Non polynomial-hard) problems in the literature. This makes it impossible, so different methods have been proposed that can solve the problem in a short time. One of these methods is genetic algorithms.

travelling_salesman_paper

旅行商论文

turtlebot3

ROS packages for Turtlebot3

Visual_Odometry-LoopDetection

visual odometry loop detection using DBoW2