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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Mobile transporter path planning using a genetic algorithm approach


    Contributors:
    Baffes, Paul (author) / Wang, Lui (author)

    Conference:

    Space Station Automation IV ; 1988 ; Cambridge, MA, United States


    Publication date :

    1988-01-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English




    Path planning of mobile robot via genetic simulated annealing approach

    Zhuo, M. / Sun, S. / Peng, Y. | British Library Online Contents | 1998


    Path Planning for a Mobile Robot using Genetic Algorithm and Artificial Bee Colony

    Carballo, Emori Alain Servulo / Morales, Lluvia / Trujillo-Romero, Felipe | IEEE | 2017


    Optimal path planning for UAVs using Genetic Algorithm

    Sonmez, Abdurrahim / Kocyigit, Emre / Kugu, Emin | IEEE | 2015


    Mobile Path Planning: A Hierarchical Approach

    Johnson, C. M. / Gray, J. O. / IFAC | British Library Conference Proceedings | 1993


    UAV Path Planning Based on Improved Genetic Algorithm

    Chen, Baihe / Lai, Songlin / Chen, Chengbin et al. | IEEE | 2021