Key points are not available for this paper at this time.
In this paper, we address the problem of robust data association for simultaneous vehicle localization and map building. We show that the classical gated nearest neighbor approach, which considers each matching between sensor observations and features independently, ignores the fact that measurement prediction errors are correlated. This leads to easily accepting incorrect matchings when clutter or vehicle errors increase. We propose a new measurement of the joint compatibility of a set of pairings that successfully rejects spurious matchings. We show experimentally that this restrictive criterion can be used to efficiently search for the best solution to data association. Unlike the nearest neighbor, this method provides a robust solution in complex situations, such as cluttered environments or when revisiting previously mapped regions.
Building similarity graph...
Analyzing shared references across papers
Loading...
José Neira
Universidad de Zaragoza
Juan D. Tardós
Oklahoma State University
IEEE Transactions on Robotics and Automation
Universidad de Zaragoza
Building similarity graph...
Analyzing shared references across papers
Loading...
Neira et al. (Mon,) studied this question.
synapsesocial.com/papers/6a0c78dc93c2b42b5c886ce6 — DOI: https://doi.org/10.1109/70.976019