Show simple item record

dc.contributor.authorShirazi, A. 
dc.contributor.authorCeberio, J.
dc.contributor.authorLozano, J.A. 
dc.date.accessioned2019-09-24T15:30:53Z
dc.date.available2019-09-24T15:30:53Z
dc.date.issued2019-07-01
dc.identifier.urihttp://hdl.handle.net/20.500.11824/1015
dc.description.abstractIn this paper, a direct approach is presented to tackle the multi-impulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers for the rendezvous problem. A number of different evolutionary algorithms are taken into consideration. It is shown that the proposed approach can lead to the optimal multi-impulse transfer maneuver that has the minimum amount of fuel similar to the traditional two-impulse transfer without violating the impulse limitation. Results also indicate that the approach is efficient even when the number of stages increases due to lower impulse limitations.en_US
dc.formatapplication/pdfen_US
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.subjectAerospace Engineeringen_US
dc.subjectSpacecraften_US
dc.subjectOptimizationen_US
dc.subjectEvolutionary Algorithmen_US
dc.subjectLambert Problemen_US
dc.subjectSpace Rendezvousen_US
dc.titleOptimal multi-impulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithmsen_US
dc.typeinfo:eu-repo/semantics/conferenceObjecten_US
dc.relation.projectIDES/1PE/SEV-2017-0718en_US
dc.relation.projectIDES/1PE/TIN2017-82626-Ren_US
dc.relation.projectIDEUS/BERC/BERC.2018-2021en_US
dc.relation.projectIDEUS/ELKARTEKen_US
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.title8th European Conference for Aeronautics and Space Sciencesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España