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.
Mobile transporter path planning using a genetic algorithm approach
Space Station Automation IV ; 1988 ; Cambridge, MA, United States
1988-01-01
Conference paper
No indication
English
Path planning of mobile robot via genetic simulated annealing approach
British Library Online Contents | 1998
|Optimal path planning for UAVs using Genetic Algorithm
IEEE | 2015
|Mobile Path Planning: A Hierarchical Approach
British Library Conference Proceedings | 1993
|UAV Path Planning Based on Improved Genetic Algorithm
IEEE | 2021
|