Nearest Neighbour
Source: SLAM for Dummies
Nearest neighbour approach
- Get a new laser scan –> ( landmark extraction ) extract all visible landmarks
- Associate each extracted LM to the closest LM we have seen more than $N$ times
- Pass each pairs of association (extracted LM, LM in database) through a
validation gate
- If pair passes –> $n = n + 1$ (num. times seen)
- If pair fails –> add new LM to database, with $n := 1$