智能车SLAM中一种快速联合数据关联算法

    Fast Joint Data Association Algorithm for SLAM of Intelligent Vehicle

    • 摘要: 数据关联是智能车同时定位与建图(simultaneous localization and mapping,SLAM)中的一个难点问题.为了快速准确获得数据关联结果,结合连续兼容最近邻(sequential compatibility nearest neighbor,SCNN)算法简单易实现和联合兼容分支定界(joint compatibility brarch and bound,JCBB)算法最优理念强的优点,提出了一种快速联合数据关联(fast joint data association,FJDA)算法.该算法首先在局部地图中采用SCNN数据关联算法处理所有的观测-特征对,得到关联结果;其次判断关联结果的准确性,若关联出错,则采用具有噪声的基于密度的聚类方法(density-based spatial clustering of applications with noise,DBSCAN)对当前时刻的观测量进行分组,然后在每一小组中采用JCBB算法进行数据关联,最终将每一小组的关联解融合得到最终的关联结果.通过仿真实验对提出的算法、SCNN算法以及JCBB算法的性能进行了比较,结果表明提出的关联算法实时性强,准确度高.

       

      Abstract: Data association is a difficult problem for simultaneous localization and mapping (SLAM) of intelligent vehicle. In order to obtain data association results quickly and accurately, a new fast joint data association (FJDA) algorithm was proposed in this paper. The advantages of the sequential compatibility nearest neighbor (SCNN) algorithm, which is easy to implement, and the concept of optimality of joint compatibility branch and bound (JCBB) algorithm were combined. Firstly, SCNN algorithm was used to process all measurement-feature pairs in the local map and the association results were obtained. Secondly, the accuracy of the association result was judged. If the association failed, DBSCAN algorithm was applied to divide the current measurement into several groups, and then JCBB algorithm was performed in each group. Eventually, the associated solution of each group was fused to get the final association results. The performance of the proposed algorithm, SCNN algorithm and JCBB algorithm were compared through simulation experiments. The simulation results show that the proposed algorithm has high real-time ability and high accuracy.

       

    /

    返回文章
    返回