A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1016/j.cor.2022.105945 http://hdl.handle.net/11449/240544 |
Resumo: | Satellite scheduling concerns an operations research problem that aims at planning the execution of a given set of tasks, either in real-time onboard the spacecraft or offline in the ground station. In particular, the task scheduling problem for nanosatellites has been the focus of recent research, given the unique set of constraints and applications, and considering their limited power resources. This paper applies the continuous-time methodology to deliver a novel scheduling formulation for the nanosatellite scheduling problem with increased flexibility and versatility to the decision-maker. Here, we adopt the concept of priority slots and follow the Multi-Operation Sequencing with Synchronized Start Times (MOS-SST) representation to yield a Mixed-Integer Linear Programming (MILP) formulation that considers constraints on time synchronization, mission quality-of-service, and management of shared resources. By comparing our continuous-time strategy with existing discrete-time alternatives, we showed that the proposed method can solve representative problem instances in a considerably shorter time, while being able to deal with real-valued constraint functions. |
id |
UNSP_87f0af62fc0e74e58906830cf981ff2d |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/240544 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellitesContinuous timeEnergy managementNanosatelliteOptimizationSatellite schedulingSatellite scheduling concerns an operations research problem that aims at planning the execution of a given set of tasks, either in real-time onboard the spacecraft or offline in the ground station. In particular, the task scheduling problem for nanosatellites has been the focus of recent research, given the unique set of constraints and applications, and considering their limited power resources. This paper applies the continuous-time methodology to deliver a novel scheduling formulation for the nanosatellite scheduling problem with increased flexibility and versatility to the decision-maker. Here, we adopt the concept of priority slots and follow the Multi-Operation Sequencing with Synchronized Start Times (MOS-SST) representation to yield a Mixed-Integer Linear Programming (MILP) formulation that considers constraints on time synchronization, mission quality-of-service, and management of shared resources. By comparing our continuous-time strategy with existing discrete-time alternatives, we showed that the proposed method can solve representative problem instances in a considerably shorter time, while being able to deal with real-valued constraint functions.Fundação de Amparo à Pesquisa e Inovação do Estado de Santa CatarinaDepartment of Automation and Systems Engineering Federal University of Santa Catarina (UFSC)Graduate Program in Applied Computer Science University of Vale do Itajaí (UNIVALI)Department of Electrical Engineering Federal University of Santa Catarina (UFSC)State University of São Paulo (UNESP)State University of São Paulo (UNESP)Fundação de Amparo à Pesquisa e Inovação do Estado de Santa Catarina: 2021TR001851Universidade Federal de Santa Catarina (UFSC)University of Vale do Itajaí (UNIVALI)Universidade Estadual Paulista (UNESP)Camponogara, EduardoSeman, Laio OrielRigo, Cezar AntônioMorsch Filho, Edemar [UNESP]Ribeiro, Brenda FernandesBezerra, Eduardo Augusto2023-03-01T20:21:57Z2023-03-01T20:21:57Z2022-11-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1016/j.cor.2022.105945Computers and Operations Research, v. 147.0305-0548http://hdl.handle.net/11449/24054410.1016/j.cor.2022.1059452-s2.0-85134892613Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengComputers and Operations Researchinfo:eu-repo/semantics/openAccess2023-03-01T20:21:57Zoai:repositorio.unesp.br:11449/240544Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462023-03-01T20:21:57Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
title |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
spellingShingle |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites Camponogara, Eduardo Continuous time Energy management Nanosatellite Optimization Satellite scheduling |
title_short |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
title_full |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
title_fullStr |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
title_full_unstemmed |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
title_sort |
A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites |
author |
Camponogara, Eduardo |
author_facet |
Camponogara, Eduardo Seman, Laio Oriel Rigo, Cezar Antônio Morsch Filho, Edemar [UNESP] Ribeiro, Brenda Fernandes Bezerra, Eduardo Augusto |
author_role |
author |
author2 |
Seman, Laio Oriel Rigo, Cezar Antônio Morsch Filho, Edemar [UNESP] Ribeiro, Brenda Fernandes Bezerra, Eduardo Augusto |
author2_role |
author author author author author |
dc.contributor.none.fl_str_mv |
Universidade Federal de Santa Catarina (UFSC) University of Vale do Itajaí (UNIVALI) Universidade Estadual Paulista (UNESP) |
dc.contributor.author.fl_str_mv |
Camponogara, Eduardo Seman, Laio Oriel Rigo, Cezar Antônio Morsch Filho, Edemar [UNESP] Ribeiro, Brenda Fernandes Bezerra, Eduardo Augusto |
dc.subject.por.fl_str_mv |
Continuous time Energy management Nanosatellite Optimization Satellite scheduling |
topic |
Continuous time Energy management Nanosatellite Optimization Satellite scheduling |
description |
Satellite scheduling concerns an operations research problem that aims at planning the execution of a given set of tasks, either in real-time onboard the spacecraft or offline in the ground station. In particular, the task scheduling problem for nanosatellites has been the focus of recent research, given the unique set of constraints and applications, and considering their limited power resources. This paper applies the continuous-time methodology to deliver a novel scheduling formulation for the nanosatellite scheduling problem with increased flexibility and versatility to the decision-maker. Here, we adopt the concept of priority slots and follow the Multi-Operation Sequencing with Synchronized Start Times (MOS-SST) representation to yield a Mixed-Integer Linear Programming (MILP) formulation that considers constraints on time synchronization, mission quality-of-service, and management of shared resources. By comparing our continuous-time strategy with existing discrete-time alternatives, we showed that the proposed method can solve representative problem instances in a considerably shorter time, while being able to deal with real-valued constraint functions. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-11-01 2023-03-01T20:21:57Z 2023-03-01T20:21:57Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1016/j.cor.2022.105945 Computers and Operations Research, v. 147. 0305-0548 http://hdl.handle.net/11449/240544 10.1016/j.cor.2022.105945 2-s2.0-85134892613 |
url |
http://dx.doi.org/10.1016/j.cor.2022.105945 http://hdl.handle.net/11449/240544 |
identifier_str_mv |
Computers and Operations Research, v. 147. 0305-0548 10.1016/j.cor.2022.105945 2-s2.0-85134892613 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Computers and Operations Research |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1803046664191082496 |