Mission operations scheduling: complexity and resolution methods
Visualitza/Obre
06245594.pdf (1,239Mb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/19260
Tipus de documentText en actes de congrés
Data publicació2012
Condicions d'accésAccés restringit per política de l'editorial
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency) and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we survey some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present some computational results for the case of the multi-ground stations scheduling obtained with Genetic Algorithms using the STK simulation toolkit.
CitacióXhafa, F. [et al.]. Mission operations scheduling: complexity and resolution methods. A: International Conference on Complex, Intelligent and Software Intensive Systems. "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS 2012, 4-6 July 2012, Palermo, Italy: proceedings". Palerm: 2012, p. 92-99.
ISBN978-076954687-2
Versió de l'editorhttps://ieeexplore.ieee.org/document/6245594/
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
06245594.pdf | 1,239Mb | Accés restringit |