基于K-means算法的堆叠砝码检定顺序调度规划方法

Verification Sequence Scheduling Planning Method for Stacked Weight Based on K-means Algorithm

基于K-means算法提出了用于砝码无人化检定的检定顺序调度规划方案。通过K-means算法、曼哈顿距离模型等技术,实现堆叠砝码提手检定顺序调度规划,形成专用的堆叠砝码检定顺序调度方法。实验模拟搭建不同状态3×3×2堆叠砝码验证调度算法效果,结果表明:基于K-means算法的堆叠砝码检定顺序调度规划方法可有效提高砝码检定效率,算法计算时间小于50 ms,平均单个砝码检定时间减少2.7 s。

Based on K-means algorithm,a verification sequence scheduling planning scheme for unmanned verification of weights is proposed.Through K-means algorithm,Manhattan distance model and other technologies,verification sequence scheduling planning for the stacked weight handle is realized,and a special verification sequence scheduling method for stacked weight is formed.The experiment simulates the construction of 3×3×2 stacked weights in different states to verify the effect of the scheduling algorithm.The results show that verification sequence scheduling planning method for stacked weight based on the K-means algorithm can effectively improve the weight verification efficiency,and the calculation time of the algorithm is less than 50 ms,and the average verification time of a single weight is reduced by 2.7 s.