Research on Optimization of Intelligent Assignment of Crane Task Priority

摘要：

　　The collision problem that occurs during the scheduling process of the crane is generally solved by prioritizing In order to intelligently solve the problem of task prioritization in the process of crane scheduling,the task prioritization model is established by using support vector machine(SVM).Aiming at the difficulty of parameter setting in the process of SVM,a dynamic cuckoo search(DCS)algorithm is proposed.The algorithm optimizes the parameter setting of SVM.In order to solve the shortcomings of the cuckoo algorithm,the step size and discovery probability of the standard cuckoo algorithm are improved as the dynamic adaptive step size and dynamic discovery probability.The test function verifies that it has the advantages of fast convergence speed and strong local optimal ability.Finally,the DCS-SVM is used to establish the prioritization model.After experimental verification,the method is proved to be effective,and it can accurately and intelligently solve the priority division problem of the crane scheduling task.

关键词： Priority SVM Cuckoo search algorithm Dynamic adaptation

作者: Hexu Sun Pengcheng Wang Zhaoming Lei

作者单位: Hebei University of Technology,Tianjin 300130,China

会议类型: 国际会议

会议名称: 2019中国智能自动化大会(CIA,2019)

会议地点: 江苏镇江

会议语种:英文

页码: 456-464

在线出版日期: 2019-09-20（万方平台首次上网日期，不代表论文的发表时间）