Mostra el registre d'ítem simple
Mission operations scheduling: complexity and resolution methods
dc.contributor.author | Xhafa Xhafa, Fatos |
dc.contributor.author | Sun, Junzi |
dc.contributor.author | Barolli, Admir |
dc.contributor.author | Takizawa, Makoto |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2013-05-15T15:05:24Z |
dc.date.created | 2012 |
dc.date.issued | 2012 |
dc.identifier.citation | 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. |
dc.identifier.isbn | 978-076954687-2 |
dc.identifier.uri | http://hdl.handle.net/2117/19260 |
dc.description.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. |
dc.format.extent | 8 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
dc.subject.lcsh | Constraint programming (Computer science) |
dc.subject.lcsh | Computer algorithms |
dc.subject.lcsh | Artificial satellites |
dc.subject.other | Constraint programming |
dc.subject.other | Genetic Algorithms |
dc.subject.other | Ground station scheduling |
dc.subject.other | Satellite scheduling |
dc.subject.other | Simulation |
dc.title | Mission operations scheduling: complexity and resolution methods |
dc.type | Conference report |
dc.subject.lemac | Programació per restriccions (Informàtica) |
dc.subject.lemac | Algorismes genètics |
dc.subject.lemac | Satèl·lits artificials |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1109/CISIS.2012.23 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/6245594/ |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 11012657 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Xhafa, F.; Sun, J.; Barolli, A.; Takizawa, M. |
local.citation.contributor | International Conference on Complex, Intelligent and Software Intensive Systems |
local.citation.pubplace | Palerm |
local.citation.publicationName | 2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS 2012, 4-6 July 2012, Palermo, Italy: proceedings |
local.citation.startingPage | 92 |
local.citation.endingPage | 99 |