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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Mobile transporter path planning


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


    Publication date :

    1990-03-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English




    Mobile Transporter Path Planning

    P. Baffes / L. Wang | NTIS | 1990



    Path planning in mobile robots

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN VALENTINOV et al. | European Patent Office | 2025

    Free access

    PATH PLANNING IN MOBILE ROBOTS

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN VALENTINOV et al. | European Patent Office | 2022

    Free access

    Path planning in mobile robots

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN-VALENTINOV et al. | European Patent Office | 2023

    Free access