Multi-robot task allocation and scheduling based on fish swarm algorithm

The problem of multi robot task allocation and scheduling is to assign more relative tasks to less relative robots and to scheme task processing sequence so as to minimize the processing time of these tasks. The key of this problem is to allocate proper quantity of tasks for each robot and schedule the optimal task sequence for each robot. In order to minimize the processing time for robots, an optimized multiple robots task allocation and scheduling approach based on fish swarm algorithm is proposed. In this approach, the optimized task sequence is first schemed using fish swarm algorithm on the assumption that all the tasks are processed by one robot. Then, according to the number of the robots, the task sequence has been randomly divided into several task segments that will be assigned to robots. At last, the task numbers of each task segments are averaged according to the time each robot used, therefore proper quantity of tasks is allocated to each robot and the optimized task allocation scheme is got. To validate the effectiveness of the proposed approach, experiments and simulation have been made. The results show that the proposed approach can scheme optimized multi robots task allocation and scheduling scheme.

[1]  Vijay Kumar,et al.  Dynamic role assignment for cooperative robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[2]  Lynne E. Parker,et al.  ALLIANCE: an architecture for fault tolerant multirobot cooperation , 1998, IEEE Trans. Robotics Autom..

[3]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[4]  Gaurav S. Sukhatme,et al.  Multi-robot task-allocation through vacancy chains , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[5]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[6]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  Maja J. Mataric,et al.  Broadcast of Local Elibility for Multi-Target Observation , 2000, DARS.

[8]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[9]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[10]  Norman M. Sadeh,et al.  Focused simulated annealing search: An application to job shop scheduling , 1996, Ann. Oper. Res..

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..