Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A new genetic algorithm approach to smooth path planning for mobile robots

A new genetic algorithm approach to smooth path planning for mobile robots PurposeThe purpose of this paper is to consider the smooth path planning problem for a mobile robot based on the genetic algorithm (GA) and the Bezier curve.Design/methodology/approachThe workspace of a mobile robot is described by a new grid-based representation that facilitates the operations of the adopted GA. The chromosome of the GA is composed of a sequence of binary numbered grids (i.e. control points of the Bezier curve). Ordinary genetic operators including crossover and mutation are used to search the optimum chromosome where the optimization criterion is the length of a piecewise collision-free Bezier curve path determined by the control points.FindingsThis paper has proposed a new smooth path planning for a mobile robot by resorting to the GA and the Bezier curve. A new grid-based representation of the workspace has been presented, which makes it convenient to perform operations in the GA. The GA has been used to search the optimum control points that determine the Bezier curve-based smooth path. The effectiveness of the proposed approach has been verified by a numerical experiment, and some performances of the obtained method have also been analyzed.Research limitations/implicationsThere still remain many interesting topics, for example, how to solve the specific smooth path planning problem by using the GA and how to promote the computational efficiency in the more grids case. These issues deserve further research.Originality/valueThe purpose of this paper is to improve the existing results by making the following three distinctive contributions: a rigorous mathematical formulation of the path planning optimization problem is formulated; a general grid-based representation (2n × 2n) is proposed to describe the workspace of the mobile robots to facilitate the implementation of the GA where n is chosen according to the trade-off between the accuracy and the computational burden; and the control points of the Bezier curve are directly linked to the optimization criteria so that the generated paths are guaranteed to be optimal without any need for smoothing afterwards. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Assembly Automation Emerald Publishing

A new genetic algorithm approach to smooth path planning for mobile robots

Assembly Automation , Volume 36 (2): 8 – Apr 4, 2016

Loading next page...
 
/lp/emerald-publishing/a-new-genetic-algorithm-approach-to-smooth-path-planning-for-mobile-QbcFZXbuWJ
Publisher
Emerald Publishing
Copyright
Copyright © Emerald Group Publishing Limited
ISSN
0144-5154
DOI
10.1108/AA-11-2015-094
Publisher site
See Article on Publisher Site

Abstract

PurposeThe purpose of this paper is to consider the smooth path planning problem for a mobile robot based on the genetic algorithm (GA) and the Bezier curve.Design/methodology/approachThe workspace of a mobile robot is described by a new grid-based representation that facilitates the operations of the adopted GA. The chromosome of the GA is composed of a sequence of binary numbered grids (i.e. control points of the Bezier curve). Ordinary genetic operators including crossover and mutation are used to search the optimum chromosome where the optimization criterion is the length of a piecewise collision-free Bezier curve path determined by the control points.FindingsThis paper has proposed a new smooth path planning for a mobile robot by resorting to the GA and the Bezier curve. A new grid-based representation of the workspace has been presented, which makes it convenient to perform operations in the GA. The GA has been used to search the optimum control points that determine the Bezier curve-based smooth path. The effectiveness of the proposed approach has been verified by a numerical experiment, and some performances of the obtained method have also been analyzed.Research limitations/implicationsThere still remain many interesting topics, for example, how to solve the specific smooth path planning problem by using the GA and how to promote the computational efficiency in the more grids case. These issues deserve further research.Originality/valueThe purpose of this paper is to improve the existing results by making the following three distinctive contributions: a rigorous mathematical formulation of the path planning optimization problem is formulated; a general grid-based representation (2n × 2n) is proposed to describe the workspace of the mobile robots to facilitate the implementation of the GA where n is chosen according to the trade-off between the accuracy and the computational burden; and the control points of the Bezier curve are directly linked to the optimization criteria so that the generated paths are guaranteed to be optimal without any need for smoothing afterwards.

Journal

Assembly AutomationEmerald Publishing

Published: Apr 4, 2016

References