Mobile Robot Scheduling Based on Improved Harmony Search Algorithm
In order to enhance the speed and accuracy of cluster scheduling for mobile robots in the medication management system,a cluster scheduling model was established using mobile robots as carriers.The scheduling coding adopted a discrete-continuous dual-mapping encoding method.In order to enhance the computational performance of the scheduling algorithm,an improved harmony search(IHS)algo-rithm was proposed,which integrated the optimal estimation optimization method.The algorithm combined optimal iteration and directed search for optimal scheduling search,thereby improving the computational speed and accuracy of the algorithm.Adaptive bandwidth adjust-ment and global random crossover mutation were performed based on the global optimum and harmony,expanding the algorithm's search range and sample diversity,thereby enhancing the algorithm's ability to search and compute the global optimal solution.Furthermore,the improved algorithm was validated on continuous intervals using standard test functions,yielding favorable results.Through comparative experiments,the results show that under identical test conditions,the proposed improved algorithm exhibits superior capability in searching for optimal so-lutions compared to the control algorithm,resulting in varying degrees of improvement in the accuracy of scheduling results.It is evident that the IHS algorithm effectively optimizes the performance of the automatic medication system scheduling system.
medical management systemmobile robotcluster schedulingharmony search(HS)algorithm
万方数据
维普
