ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Self-Determining Automobile Robot Movement Using Travelling Salesman Problem with Genetic Algorithm Search Technique

Journal: International Journal of Computer Science and Mobile Applications IJCSMA (Vol.5, No. 12)

Publication Date:

Authors : ; ; ;

Page : 36-44

Keywords : Travelling Salesman Problem (TSP); Genetic algorithm (GA); Robot; Static Task Scheduling; Cooperative control;

Source : Downloadexternal Find it from : Google Scholarexternal


Static task scheduling technique is one of the core functions to efficiently utilize the capacity of cooperative control for getting shortest path which can minimize the completion time. A new methodology that is supported on Travelling Salesman Problem (TSP) with Genetic Algorithm (GA) search technique for robots has been proposed. TSP locates an optimum solution for the shortest route to complete the required tasks by configuring GA. We debate the adaption and realisation of the GA search tactics to the task scheduling problem in the cooperative control of multiple resources for getting shortest path with minimize the completion time has been discussed. Simulation results portray that the GA strategy is a practicable methodology for arranging the task scheduling solution.

Last modified: 2018-01-05 22:18:48