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

Song, Baoye; Wang, Zidong; Sheng, Li
Assembly Automation , Volume 36 (2): 8 – Apr 4, 2016
Download PDF
8 pages

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 Automation – Emerald Publishing

Published: Apr 4, 2016

References

  • Smooth global and local path planning for mobile robot using particle swarm optimization, radial basis functions, splines and Bezier curves
  • Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots
  • Receding horizon filtering for a class of discrete time-varying nonlinear systems with multiple missing measurements
  • Finite-horizon H∞ control for discrete time-varying systems with randomly occurring nonlinearities and fading measurements
  • Event-triggered consensus control for discrete-time stochastic multi-agent systems: the input-to-state stability in probability
  • H∞ state estimation with fading measurements, randomly varying nonlinearities and probabilistic distributed delays
  • Event-triggered distributed H∞ state estimation with packet dropouts through sensor networks
  • Envelope-constrained H∞ filtering with fading measurements and randomly occurring nonlinearities: the finite horizon case
  • Finite-horizon estimation of randomly occurring faults for a class of nonlinear time-varying systems
  • Finite-horizon reliable control with randomly occurring uncertainties and nonlinearities subject to output quantization
  • Collision-free curvature-bounded smooth path planning using composite Bezier curve based on Voronoi diagram
  • A variance-constrained approach to recursive state estimation for time-varying complex networks with missing measurements
  • A knowledge based genetic algorithm for path planning of a mobile robot
  • The compliance of robotic hands – from functionality to mechanism
  • A Bezier curve based path planning in a multi-agent robot soccer system without violating the acceleration limits
  • Robust H∞ filtering for discrete nonlinear delayed stochastic systems with missing measurements and randomly occurring nonlinearities
  • Optimal guaranteed cost control of a class of hybrid systems with mode-dependent mixed time delays
  • Reliable H∞ state estimation for 2-D discrete systems with infinite distributed delays and incomplete observations
  • Path planning in an environment with static and dynamic obstacles using genetic algorithm: a simplified search space approach
  • Genetic algorithms for autonomous robot navigation
  • Efficient and safe path planning for a mobile robot using genetic algorithm
  • Feasible RRT-based path planning using seventh order Bezier curves
  • Path planning for autonomous UAV via vibrational genetic algorithm
  • A review on indoor human aware autonomous mobile robot navigation through a dynamic environment
  • Ambient intelligence for optimal manufacturing and energy efficiency
  • Generation of Bezier curve-based flyable trajectories for multi-UAV systems with parallel genetic algorithm
  • Stabilization for sampled-data systems under noisy sampling interval
  • Optimal cooperative collision avoidance between multiple robots based on Bernstein-Beizier curves
  • A comparison study on path smoothing algorithms for laser robot navigated mobile robot path planning in intelligent space
  • Parallel elite genetic algorithm and its application to global path planning for autonomous robot navigation
  • Dynamic path planning of mobile robots with improved genetic algorithm
  • Mobile robot path planning in dynamic environments
  • Path planning algorithm for mobile robot obstacle avoidance adopting Bezier curve based on genetic algorithm
  • Step-spreading map knowledge based multi-objective genetic algorithm for robot-path planning
  • Bezier curve based smooth path planning for mobile robot
  • Observer-based H∞ control of networked systems with stochastic communication protocol: the finite-horizon case