Optimization of Time of Mobile Robot using Genetics Algorithm in Exploration of Area

Abstract

Purpose: Sensor based mobile robot coverage path planning is exigent for robotics management. In general, time is mostly increased with increase a distance traveled by robot. Proposed algorithm we will find the optimal path of robot by which robot will have to travel least distance with the least number of turn during traverse. During the exploration of area if the number of turn taken by robot will be decrease than exploration time will be decrease. Combine effect of minimizing distance and number of turn lead to minimize area exploration time.

Design/ Methodology/ Approach: In the proposed method the entire area is graduated into tiny circles with radius same as the radius of the sensing range of the robot. Various prioritization patterns (PP) are deployed to determine the movement of the robot.

Findings: In this work, a new algorithm using GA is designed which reduces the power consumption in the robot, by the reduction in the turns required in the path.