Paper
11 November 1996 Robot trajectory planning using a genetic algorithm
Daniel J. Pack, Gregory J. Toussaint, Randy L. Haupt
Author Affiliations +
Abstract
In this paper, we studied the trajectory generation problem for a two-degrees-of-freedom robot in a workspace with obstacles. To generate the robot's trajectories, we developed a genetic algorithm to search for valid solutions in the configuration space. Our results present a novel perspective on the problem not seen in the conventional robot trajectory planners. The genetic algorithm approach is beneficial because it may be extended to plan trajectories for robots with more degrees of freedom. The evolutionary search process may allow the user to solve the trajectory problem in an n-dimensional space where the 'curse of dimensionality' inevitably stalls conventional methods. We demonstrate the algorithm with some examples and discuss the possible extension to higher order problems.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniel J. Pack, Gregory J. Toussaint, and Randy L. Haupt "Robot trajectory planning using a genetic algorithm", Proc. SPIE 2824, Adaptive Computing: Mathematical and Physical Methods for Complex Environments, (11 November 1996); https://doi.org/10.1117/12.258129
Lens.org Logo
CITATIONS
Cited by 11 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Space robots

Kinematics

Binary data

Algorithm development

MATLAB

Optimization (mathematics)

RELATED CONTENT


Back to Top