amcl.md

amcl

kdtree

• https://blog.csdn.net/richard9006/article/details/90058465
• https://blog.csdn.net/u012423865/article/details/77488920

Bresenham's line algorithm

• https://www.geeksforgeeks.org/bresenhams-line-generation-algorithm/

Particle Filters

• http://www.irisa.fr/aspi/legland/ref/arulampalam02a.pdf

global planner

dijkstra

Greedy Best-First-Search

• Greedy Best-First-Search is “greedy” and tries to move towards the goal even if it’s not the right path. Since it only considers the cost to get to the goal and ignores the cost of the path so far, it keeps going even if the path it’s on has become really long.

astar

• http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html