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: 2017-12-30
Authors : Sasmita Nayak; Neeraj Kumar; B. B. Choudhury;
Page : 36-44
Keywords : Travelling Salesman Problem (TSP); Genetic algorithm (GA); Robot; Static Task Scheduling; Cooperative control;
Abstract
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.
Other Latest Articles
- THE EFFECT OF POPULATION EXPANSION ON ENERGY CONSUMPTION IN CANTON OF CHINA: A SIMULATION FROM COMPUTABLE GENERAL EQUILIBRIUM APPROACH
- PERFORMANCE ESTIMATION OF VARIOUS ADDERS USED IN ARITHMETIC PROCESSORS
- STATIC ANALYSIS OF BRIDGE STRUCTURE USING FINITE ELEMENT ANALYSIS SOFTWARE
- IDENTIFICATION OF FACTORS FOR INCEPTION OF SLUMS: USING GRAVITATIONAL MODEL
- A STUDY ON THE STATUS ANALYSIS FOR ESTABLISHMENT OF INTELLIGENT ROAD MANAGEMENT SYSTEM FOR FUTURE ROAD
Last modified: 2018-01-05 22:18:48