Publication Date:
2013-08-31
Description:
The use of a genetic algorithm (GA) 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. Elements of the genetic algorithm are explored in both a theoretical and experimental sense. Specifically, double crossover, greedy crossover, and tournament selection techniques are examined. Additionally, the use of local optimization techniques working in concert with the GA are also explored. 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.
Keywords:
COMPUTER PROGRAMMING AND SOFTWARE
Type:
Third Annual Workshop on Space Operations Automation and Robotics (SOAR 1989); p 51-59
Format:
application/pdf
