We present the first optimal algorithms for swath segment scheduling for orbiting spacecraft. We present a comparison between an integer program formulation and a branch and bound formulation that makes use of a flow network transformation, each capable of solving instances of these problems optimally. We also compare our techniques with the current state of the practice: the Aster scheduling algorithm. No technique strictly dominates all others, and we characterize their respective advantages and disadvantages. Note that this problem is NP-complete. The primary goal of our work is to solve the largest swath problems possible, both quickly, and where feasible, optimally.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving swath problems optimally


    Beteiligte:
    Knight, R. (Autor:in)


    Erscheinungsdatum :

    01.01.2006


    Format / Umfang :

    964910 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Optimally Solving Nadir Observation Scheduling Problems

    Knight, R. / Smith, B. / European Space Agency | British Library Conference Proceedings | 2005


    Optimally solving nadir observation scheduling programs

    Knight, Russell / Smith, Ben | NTRS | 2005


    Swath ships

    Gore,J.L. / US Navy Engng.Experiment Station,Annapolis,US | Kraftfahrwesen | 1985



    Modular SWATH vessel

    NEIL TINMOUTH / JOHN KECSMAR | Europäisches Patentamt | 2024

    Freier Zugriff