Dynamic Path Planning Algorithm for a Mobile Robot Based on Visible Space and an Improved Genetic Algorithm. (18th May 2016)

• Record Type: Journal Article
• Authors: Zhang, Xiaolei; Zhao, Yan; Deng, Nianmao; Guo, Kai
• Is Part Of: International journal of advanced robotic systems. Volume 13:Number 3(2016)
• Publication Date: 2016-05-18
• Subjects: Visible Space -- Genetic Algorithm -- Matrix Encoding -- Mutation -- Chromosome Modification -- Path Planning; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.5772/63484
• Languages: English
• ISSNs: 1729-8806

Abstract

In this study, a series of new concepts and improved genetic operators of a genetic algorithm (GA) was proposed and applied to solve mobile robot (MR) path planning problems in dynamic environments. The proposed method has two superiorities: fast convergence towards the global optimum and the feasibility of all solutions in the population. Path planning aims to provide an optimal path from a starting location to a target location, preventing collision or so-called obstacle avoidance. Although GAs have been widely used in optimization problems and can obtain good results, conventional GAs have some weaknesses in an obstacle environment, such as infeasible paths. The main ideas in this paper are visible space, matrix coding and new mutation operators. In order to demonstrate the superiority of this method, three different obstacle environments have been used and an experiment is conducted. This algorithm is effective in both static and dynamic environments.