Jethro's Braindump

Map Matching

Map matching compiles small numbers of consecutive scans into local maps mlocal. Maps are then compared to the global map m, such that the more similar m and mlocal, the larger p(mlocal|xt,m). Cells in the local map are transformed to the coordinates of the global map, and the map correlation function is computed.

Map matching is easy to compute, but does not yield smooth probabilities in the pose parameter xt. One solution is to convolve the map with a Gaussian smoothness kernel before running map matching.

Map matching considers the free-space in the scoring of 2 maps, compared to the Likelihood Field Model which uses only the end-points.

Issues

  1. No plausible physical explanation
  2. Result of map matching may incorporate areas beyond actual measurement range.

Links to this note