Mobile Transporter Path Planning Using A Genetic Algorithm Approach

Paul Baffes; Lui Wang

doi:10.1117/12.949076

27 October 1988 Mobile Transporter Path Planning Using A Genetic Algorithm Approach

Paul Baffes, Lui Wang

Proceedings Volume 1006, Space Station Automation IV; (1988) https://doi.org/10.1117/12.949076
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States

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.

Citation Download Citation

Paul Baffes and Lui Wang "Mobile Transporter Path Planning Using A Genetic Algorithm Approach", Proc. SPIE 1006, Space Station Automation IV, (27 October 1988); https://doi.org/10.1117/12.949076

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available