Determining optimum maneuvering strategies for multiple satellite inspection is a difficult combinatorial optimization problem that is related to the classical traveling salesman problem (TSP). The classical TSP and its variants cannot be solved to optimality in polynomial time due to the vastness of the solution space. Global search techniques that use a stochastic engine to explore diverse regions of the solution space (such as genetic algorithms or simulated annealing) have been employed with great success against such problems. This paper presents a technique for solving this problem using a hybrid genetic algorithm, and provides results of algorithm performance against a representative multi-satellite inspection problem. Preliminary test runs of the algorithm show excellent performance against 30-satellite problems.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Minimum energy maneuvering strategies for multiple satellite inspection missions


    Contributors:
    Jackson, B. (author)

    Published in:

    Publication date :

    2005


    Size :

    8 Seiten, 14 Quellen



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Minimum Energy Maneuvering Strategies for Multiple Satellite Inspection Missions

    Jackson, B. / IEEE | British Library Conference Proceedings | 2005


    ENERGY EFFICIENT SATELLITE MANEUVERING

    LUI TIMOTHY S / LEE KANGSIK | European Patent Office | 2020

    Free access

    Energy efficient satellite maneuvering

    LUI TIMOTHY S / LEE KANGSIK | European Patent Office | 2019

    Free access

    Energy efficient satellite maneuvering

    LUI TIMOTHY S / LEE KANGSIK | European Patent Office | 2021

    Free access

    ENERGY EFFICIENT SATELLITE MANEUVERING

    LUI TIMOTHY S / LEE KANGSIK | European Patent Office | 2019

    Free access