Show simple item record

dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.authorSun, Junzi
dc.contributor.authorBarolli, Admir
dc.contributor.authorTakizawa, Makoto
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2013-05-15T15:05:24Z
dc.date.created2012
dc.date.issued2012
dc.identifier.citationXhafa, 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.isbn978-076954687-2
dc.identifier.urihttp://hdl.handle.net/2117/19260
dc.description.abstractRecently 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.extent8 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.lcshConstraint programming (Computer science)
dc.subject.lcshComputer algorithms
dc.subject.lcshArtificial satellites
dc.subject.otherConstraint programming
dc.subject.otherGenetic Algorithms
dc.subject.otherGround station scheduling
dc.subject.otherSatellite scheduling
dc.subject.otherSimulation
dc.titleMission operations scheduling: complexity and resolution methods
dc.typeConference report
dc.subject.lemacProgramació per restriccions (Informàtica)
dc.subject.lemacAlgorismes genètics
dc.subject.lemacSatèl·lits artificials
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1109/CISIS.2012.23
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/6245594/
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac11012657
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorXhafa, F.; Sun, J.; Barolli, A.; Takizawa, M.
local.citation.contributorInternational Conference on Complex, Intelligent and Software Intensive Systems
local.citation.pubplacePalerm
local.citation.publicationName2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS 2012, 4-6 July 2012, Palermo, Italy: proceedings
local.citation.startingPage92
local.citation.endingPage99


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder