摘要
分析多目标碰撞产生的原因,介绍现有多目标防碰撞算法及相应的改进算法,提出了一种快速的二进制搜索算法,通过对碰撞位进行分组的方式减少查询次数,更好地解决多目标识别产生碰撞的问题。仿真结果表明,此算法的性能较其他二进制树防碰撞算法有比较明显的提高。
This article analyzed the causes of multi-objective collision, introduced the existing multiobjective collision prevention algorithm and the corresponding improvement algorithm, and put forward a kind of fast binary search algorithm, by reducing the number of inquires, which better solved the problem of target recognition collision. Simulation results showed that this algorithm is better than other binary tree collision prevention algorithm in terms of effects.
出处
《重庆理工大学学报(自然科学)》
CAS
2012年第9期65-68,126,共5页
Journal of Chongqing University of Technology:Natural Science