Task allocation of searching in multi-robot system using improved bundled auction
Jiang Lai-ha · Journal of Qiqihar University · 2014
In order to solve the problem of multi-robot in the search process of multi task allocation and multi-robot utilization, this paper presents a K-means clustering with instant auction algorithm based bundle auction.Firstly by using K-means clustering algorithm to solve the problem of multi tasks in multi robot binding,then using bundled auction mechanism allocates the clusters to the corresponding robots. According to the completion of the tasks in each cluster,the corresponding robot judge whether to make instant auction. Simulation results proves that this method of the multi-robot in the search process save resource and the robots use equilibrium.