229 / 2017-01-14 16:36:27

Task Scheduling of Automobile Robots using travelling Salesman Problem with Genetic algorithm search technique

Travelling Salesman Problem (TSP),Genetic algorithm (GA),2452,Task scheduling,Cooperative control

Static task scheduling is one of the core steps to effectively exploit the capability of cooperative control for getting shortest path with minimize the completion time. In this paper, we present a new task scheduling algorithm that is based on Travelling Salesman Problem (TSP) with Genetic Algorithm (GA) search technique for robots. TSP finds an optimal solution to search for the shortest route for completing the required tasks by setting up GA. We discuss the adaption and implementation of the GA search strategy to the task scheduling problem in the cooperative control of multiple resources for getting shortest path with minimize the completion time. Simulation results indicate that the GA strategy is a feasible approach for the task scheduling problem.