Nearest Neighbour

Search IconIcon to open search

Source: SLAM for Dummies

Nearest neighbour approach

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