single-rb.php

JRM Vol.11 No.2 pp. 153-164
doi: 10.20965/jrm.1999.p0153
(1999)

Paper:

Evolutionary Collision Free Optimal Trajectory Planning for Mobile Robots

M.M.A. Hashem*, Keigo Watanabe** and Kiyotaka Izumi***

*Faculty of Engineering Systems and Technology, Graduate School of Science and Engineering

**Department of Advanced Systems Control Engineering, Graduate School of Science and Engineering

***Department of Mechanical Engineering, Faculty of Science and Engineering, Saga University 1-Honjomachi, Saga 840-8502, Japan

Received:
October 14, 1998
Accepted:
March 8, 1999
Published:
April 20, 1999
Keywords:
optimal obstacle avoidance, path planning, evolutionary algorithms, constrainted optimization, time-optimal control, intelligent robotic systems
Abstract
We present an evolutionary trajectory planning method for mobile robots following a novel evolution strategy (NES) algorithm. The 2-D trajectory planning problem of a mobile robot among polygonal obstacles is formulated as a constrained time-optimum control problem considering motion. Unlike traditional evolutionary representation, special representation of individuals and crossover are used for the evolutionary search. Swapping crossover, insertion, and deletion mutations are used as background operators for maximum evolutionary algorithm flexibility. Polygonal obstacles in the world coordinate frame are modeled as circles from visibility and sensor modeling concepts. An appropriate cost (fitness) function is constructed as the only link between the evolutionary algorithm and environment. Our proposed evolution is effective for collision-free optimum trajectory planning in robot simulation within a heavily constrained (obstacle) environment.
Cite this article as:
M. Hashem, K. Watanabe, and K. Izumi, “Evolutionary Collision Free Optimal Trajectory Planning for Mobile Robots,” J. Robot. Mechatron., Vol.11 No.2, pp. 153-164, 1999.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Dec. 02, 2024