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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Mobile transporter path planning


    Beteiligte:
    Baffes, Paul (Autor:in) / Wang, Lui (Autor:in)


    Erscheinungsdatum :

    01.03.1990


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Keine Angabe


    Sprache :

    Englisch




    Mobile Transporter Path Planning

    P. Baffes / L. Wang | NTIS | 1990



    Path planning in mobile robots

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN VALENTINOV et al. | Europäisches Patentamt | 2025

    Freier Zugriff

    PATH PLANNING IN MOBILE ROBOTS

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN VALENTINOV et al. | Europäisches Patentamt | 2022

    Freier Zugriff

    Path planning in mobile robots

    BLAKE ANDREW / RAMAMOORTHY SUBRAMANIAN / PENKOV SVETLIN-VALENTINOV et al. | Europäisches Patentamt | 2023

    Freier Zugriff