An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit

In this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized multi-impulse transfer. Taking advantage of an analytical form of multi-impulse...

Descripción completa

Detalles Bibliográficos
Autores: Shirazi, A., Ceberio, J., Lozano, J.A.
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2019
País:España
Institución:Basque Center for Applied Mathematics (BCAM)
Repositorio:BIRD. BCAM's Institutional Repository Data
OAI Identifier:oai:bird.bcamath.org:20.500.11824/1012
Acceso en línea:http://hdl.handle.net/20.500.11824/1012
Access Level:acceso abierto
Palabra clave:Aerospace Engineering
Spacecraft
Optimization
Evolutionary Algorithm
Space Rendezvous
Lambert Problem
id ES_76c3cd208b4aa6be55152e5394213c99
oai_identifier_str oai:bird.bcamath.org:20.500.11824/1012
network_acronym_str ES
network_name_str España
repository_id_str
spelling An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limitShirazi, A.Ceberio, J.Lozano, J.A.Aerospace EngineeringSpacecraftOptimizationEvolutionary AlgorithmSpace RendezvousLambert ProblemIn this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized multi-impulse transfer. Taking advantage of an analytical form of multi-impulse transfer, a feasible solution that satisfies the impulse limit is calculated. Next, the obtained feasible solution is utilized as a seed for generating individuals for a hybrid self-adaptive evolutionary algorithm to minimize the total time, without violating the impulse limit while keeping the overall fuel mass the same as or less than the one associated with the analytical solution. The algorithm eliminates similar individuals and regenerates them based on a combination of Gaussian and uniform distribution of solutions from the fuel-optimal region during the optimization process. Other enhancements are also applied to the algorithm to make it auto-tuned and robust to the initial and final orbits as well as the impulse limit. Several types of the proposed algorithm are tested considering varieties of rendezvous missions. Results reveal that the approach can successfully reduce the overall transfer time in the multi-impulse transfers while minimizing the fuel mass without violating the impulse limit. Furthermore, the proposed algorithm has superior performance over standard evolutionary algorithms in terms of convergence and optimality.TIN2016-78365R201920192019info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttp://hdl.handle.net/20.500.11824/1012reponame:BIRD. BCAM's Institutional Repository Datainstname:Basque Center for Applied Mathematics (BCAM)Ingléshttps://www.sciencedirect.com/science/article/abs/pii/S127096381931586Xinfo:eu-repo/grantAgreement/MINECO//SEV-2017-0718info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/TIN2017-82626-Rinfo:eu-repo/grantAgreement/Gobierno Vasco/BERC/BERC.2018-2021info:eu-repo/grantAgreement/Gobierno Vasco/ELKARTEK/Reconocimiento-NoComercial-CompartirIgual 3.0 Españahttp://creativecommons.org/licenses/by-nc-sa/3.0/es/info:eu-repo/semantics/openAccessoai:bird.bcamath.org:20.500.11824/10122026-06-19T12:47:47Z
dc.title.none.fl_str_mv An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
title An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
spellingShingle An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
Shirazi, A.
Aerospace Engineering
Spacecraft
Optimization
Evolutionary Algorithm
Space Rendezvous
Lambert Problem
title_short An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
title_full An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
title_fullStr An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
title_full_unstemmed An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
title_sort An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
dc.creator.none.fl_str_mv Shirazi, A.
Ceberio, J.
Lozano, J.A.
author Shirazi, A.
author_facet Shirazi, A.
Ceberio, J.
Lozano, J.A.
author_role author
author2 Ceberio, J.
Lozano, J.A.
author2_role author
author
dc.subject.none.fl_str_mv Aerospace Engineering
Spacecraft
Optimization
Evolutionary Algorithm
Space Rendezvous
Lambert Problem
topic Aerospace Engineering
Spacecraft
Optimization
Evolutionary Algorithm
Space Rendezvous
Lambert Problem
description In this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized multi-impulse transfer. Taking advantage of an analytical form of multi-impulse transfer, a feasible solution that satisfies the impulse limit is calculated. Next, the obtained feasible solution is utilized as a seed for generating individuals for a hybrid self-adaptive evolutionary algorithm to minimize the total time, without violating the impulse limit while keeping the overall fuel mass the same as or less than the one associated with the analytical solution. The algorithm eliminates similar individuals and regenerates them based on a combination of Gaussian and uniform distribution of solutions from the fuel-optimal region during the optimization process. Other enhancements are also applied to the algorithm to make it auto-tuned and robust to the initial and final orbits as well as the impulse limit. Several types of the proposed algorithm are tested considering varieties of rendezvous missions. Results reveal that the approach can successfully reduce the overall transfer time in the multi-impulse transfers while minimizing the fuel mass without violating the impulse limit. Furthermore, the proposed algorithm has superior performance over standard evolutionary algorithms in terms of convergence and optimality.
publishDate 2019
dc.date.none.fl_str_mv 2019
2019
2019
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.11824/1012
url http://hdl.handle.net/20.500.11824/1012
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv https://www.sciencedirect.com/science/article/abs/pii/S127096381931586X
info:eu-repo/grantAgreement/MINECO//SEV-2017-0718
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/TIN2017-82626-R
info:eu-repo/grantAgreement/Gobierno Vasco/BERC/BERC.2018-2021
info:eu-repo/grantAgreement/Gobierno Vasco/ELKARTEK/
dc.rights.none.fl_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:BIRD. BCAM's Institutional Repository Data
instname:Basque Center for Applied Mathematics (BCAM)
instname_str Basque Center for Applied Mathematics (BCAM)
reponame_str BIRD. BCAM's Institutional Repository Data
collection BIRD. BCAM's Institutional Repository Data
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411074066874368
score 15.300724

Similares en LA Referencia