摘要
将模拟退火算法用于多目标跟踪中的数据关联分析,得到全局最优解。通过最近邻选择策略缩小模拟退火迭代过程中产生的解空间,提高算法效率。给出了改进之后的基于最近邻选择策略的模拟退火关联算法全过程并证明了该算法必包含最优解。对比仿真实验表明了改进后的算法在运算速度和关联性能上的优越性。
Simulated annealing algorithm used in the data association analyzing of multi-target tracking can get the best solution. Nea- rest neighbor tactic was used to reduce the solution space generated by iterations of simulated annealing process, which improved the efficien- cy of the algorithm. An improved simulated annealing algorithm based on nearest neighbor tactic was proposed. The whole process of the al- gorithm was given and it was proved that the algorithm contains optimal solution. The simulation results revealed the superiority of the im- proved algorithm in the operation speed and associated performance.
出处
《计算机与数字工程》
2013年第11期1741-1743,共3页
Computer & Digital Engineering
基金
南通市应用研究计划项目(编号:BK2012035)
南通大学自然科学基金项目(编号:12Z036)资助
关键词
多目标跟踪
模拟退火
数据关联
multi-target tracking, simulated annealing, data association
