AN EXPERIMENTAL STUDY ON ROBOT WORKING IN REAL WORLD

Abstract

The robot requires reaching the target destination with minimum time and at the same time, the distance should be minimal. Path planning problems include find out a feasible path from the starting point to the final point. Normally, there are several feasible paths for a robot to reach the destination from the start position, but in circumstance, the best feasible path is chosen based on some guideline such as shortest distance, smoothness of the path, minimum energy consumption, etc. or the most adopted criteria is the shortest distance with the minimal possible time. Recently, in robotics, path planning is one of the most researched subjects.  Another criterion are robot should take less computational complexity and less power consumption, that can be possible only when it will move in the shortest path from starting configuration to a target configuration.