Share Email Print

Proceedings Paper

Mobile Transporter Path Planning Using A Genetic Algorithm Approach
Author(s): Paul Baffes; Lui Wang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The use of an optimization technique known as a genetic algorithm for solving the mobile transporter path planning problem is investigated. The mobile transporter is a traveling robotic vehicle proposed for the space station which must be able to reach any point of the structure autonomously. Specific elements of the genetic algorithm are explored in both a theoretical and experimental sense. Recent developments in genetic algorithm theory are shown to be particularly effective in a path planning problem domain, though problem areas can be cited which require more research. However, trajectory planning problems are common in space systems and the genetic algorithm provides an attractive alternative to the classical techniques used to solve these problems.

Paper Details

Date Published: 27 October 1988
PDF: 9 pages
Proc. SPIE 1006, Space Station Automation IV, (27 October 1988); doi: 10.1117/12.949076
Show Author Affiliations
Paul Baffes, Johnson Space Center (United States)
Lui Wang, Johnson Space Center (United States)

Published in SPIE Proceedings Vol. 1006:
Space Station Automation IV
Wun C. Chiou Sr., Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?