A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions
Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospecto...
Ausführliche Beschreibung
Autor*in: |
Cataldi, Giuseppe [verfasserIn] Marcuccio, Salvo [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2020 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Aerotecnica missili & spazio - [Cham] : Springer International Publishing, 2001, 99(2020), 4 vom: 12. Nov., Seite 287-295 |
---|---|
Übergeordnetes Werk: |
volume:99 ; year:2020 ; number:4 ; day:12 ; month:11 ; pages:287-295 |
Links: |
---|
DOI / URN: |
10.1007/s42496-020-00067-x |
---|
Katalog-ID: |
SPR042275466 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | SPR042275466 | ||
003 | DE-627 | ||
005 | 20220112044207.0 | ||
007 | cr uuu---uuuuu | ||
008 | 201205s2020 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s42496-020-00067-x |2 doi | |
035 | |a (DE-627)SPR042275466 | ||
035 | |a (DE-599)SPRs42496-020-00067-x-e | ||
035 | |a (SPR)s42496-020-00067-x-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |q ASE |
082 | 0 | 4 | |a 620 |q ASE |
100 | 1 | |a Cataldi, Giuseppe |e verfasserin |4 aut | |
245 | 1 | 2 | |a A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
264 | 1 | |c 2020 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. | ||
650 | 4 | |a Asteroid mining |7 (dpeaa)DE-He213 | |
650 | 4 | |a Asteroid prospector |7 (dpeaa)DE-He213 | |
650 | 4 | |a Asteroid flyby |7 (dpeaa)DE-He213 | |
700 | 1 | |a Marcuccio, Salvo |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Aerotecnica missili & spazio |d [Cham] : Springer International Publishing, 2001 |g 99(2020), 4 vom: 12. Nov., Seite 287-295 |w (DE-627)1047764040 |w (DE-600)2960384-5 |x 2524-6968 |7 nnns |
773 | 1 | 8 | |g volume:99 |g year:2020 |g number:4 |g day:12 |g month:11 |g pages:287-295 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s42496-020-00067-x |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_SPRINGER | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_138 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_152 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_171 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_250 | ||
912 | |a GBV_ILN_281 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_636 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2031 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2037 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2039 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2093 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2107 | ||
912 | |a GBV_ILN_2108 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2144 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2188 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2446 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2472 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_2548 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4046 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4246 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4328 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4336 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 99 |j 2020 |e 4 |b 12 |c 11 |h 287-295 |
author_variant |
g c gc s m sm |
---|---|
matchkey_str |
article:25246968:2020----::2taetrdsgagrtmomlilatr |
hierarchy_sort_str |
2020 |
publishDate |
2020 |
allfields |
10.1007/s42496-020-00067-x doi (DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e DE-627 ger DE-627 rakwb eng 620 ASE 620 ASE Cataldi, Giuseppe verfasserin aut A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 Marcuccio, Salvo verfasserin aut Enthalten in Aerotecnica missili & spazio [Cham] : Springer International Publishing, 2001 99(2020), 4 vom: 12. Nov., Seite 287-295 (DE-627)1047764040 (DE-600)2960384-5 2524-6968 nnns volume:99 year:2020 number:4 day:12 month:11 pages:287-295 https://dx.doi.org/10.1007/s42496-020-00067-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 99 2020 4 12 11 287-295 |
spelling |
10.1007/s42496-020-00067-x doi (DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e DE-627 ger DE-627 rakwb eng 620 ASE 620 ASE Cataldi, Giuseppe verfasserin aut A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 Marcuccio, Salvo verfasserin aut Enthalten in Aerotecnica missili & spazio [Cham] : Springer International Publishing, 2001 99(2020), 4 vom: 12. Nov., Seite 287-295 (DE-627)1047764040 (DE-600)2960384-5 2524-6968 nnns volume:99 year:2020 number:4 day:12 month:11 pages:287-295 https://dx.doi.org/10.1007/s42496-020-00067-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 99 2020 4 12 11 287-295 |
allfields_unstemmed |
10.1007/s42496-020-00067-x doi (DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e DE-627 ger DE-627 rakwb eng 620 ASE 620 ASE Cataldi, Giuseppe verfasserin aut A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 Marcuccio, Salvo verfasserin aut Enthalten in Aerotecnica missili & spazio [Cham] : Springer International Publishing, 2001 99(2020), 4 vom: 12. Nov., Seite 287-295 (DE-627)1047764040 (DE-600)2960384-5 2524-6968 nnns volume:99 year:2020 number:4 day:12 month:11 pages:287-295 https://dx.doi.org/10.1007/s42496-020-00067-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 99 2020 4 12 11 287-295 |
allfieldsGer |
10.1007/s42496-020-00067-x doi (DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e DE-627 ger DE-627 rakwb eng 620 ASE 620 ASE Cataldi, Giuseppe verfasserin aut A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 Marcuccio, Salvo verfasserin aut Enthalten in Aerotecnica missili & spazio [Cham] : Springer International Publishing, 2001 99(2020), 4 vom: 12. Nov., Seite 287-295 (DE-627)1047764040 (DE-600)2960384-5 2524-6968 nnns volume:99 year:2020 number:4 day:12 month:11 pages:287-295 https://dx.doi.org/10.1007/s42496-020-00067-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 99 2020 4 12 11 287-295 |
allfieldsSound |
10.1007/s42496-020-00067-x doi (DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e DE-627 ger DE-627 rakwb eng 620 ASE 620 ASE Cataldi, Giuseppe verfasserin aut A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 Marcuccio, Salvo verfasserin aut Enthalten in Aerotecnica missili & spazio [Cham] : Springer International Publishing, 2001 99(2020), 4 vom: 12. Nov., Seite 287-295 (DE-627)1047764040 (DE-600)2960384-5 2524-6968 nnns volume:99 year:2020 number:4 day:12 month:11 pages:287-295 https://dx.doi.org/10.1007/s42496-020-00067-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 99 2020 4 12 11 287-295 |
language |
English |
source |
Enthalten in Aerotecnica missili & spazio 99(2020), 4 vom: 12. Nov., Seite 287-295 volume:99 year:2020 number:4 day:12 month:11 pages:287-295 |
sourceStr |
Enthalten in Aerotecnica missili & spazio 99(2020), 4 vom: 12. Nov., Seite 287-295 volume:99 year:2020 number:4 day:12 month:11 pages:287-295 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Asteroid mining Asteroid prospector Asteroid flyby |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
Aerotecnica missili & spazio |
authorswithroles_txt_mv |
Cataldi, Giuseppe @@aut@@ Marcuccio, Salvo @@aut@@ |
publishDateDaySort_date |
2020-11-12T00:00:00Z |
hierarchy_top_id |
1047764040 |
dewey-sort |
3620 |
id |
SPR042275466 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR042275466</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220112044207.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201205s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s42496-020-00067-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR042275466</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRs42496-020-00067-x-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s42496-020-00067-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cataldi, Giuseppe</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid mining</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid prospector</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid flyby</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marcuccio, Salvo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Aerotecnica missili & spazio</subfield><subfield code="d">[Cham] : Springer International Publishing, 2001</subfield><subfield code="g">99(2020), 4 vom: 12. Nov., Seite 287-295</subfield><subfield code="w">(DE-627)1047764040</subfield><subfield code="w">(DE-600)2960384-5</subfield><subfield code="x">2524-6968</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:99</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:4</subfield><subfield code="g">day:12</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:287-295</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s42496-020-00067-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">99</subfield><subfield code="j">2020</subfield><subfield code="e">4</subfield><subfield code="b">12</subfield><subfield code="c">11</subfield><subfield code="h">287-295</subfield></datafield></record></collection>
|
author |
Cataldi, Giuseppe |
spellingShingle |
Cataldi, Giuseppe ddc 620 misc Asteroid mining misc Asteroid prospector misc Asteroid flyby A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
authorStr |
Cataldi, Giuseppe |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)1047764040 |
format |
electronic Article |
dewey-ones |
620 - Engineering & allied operations |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
2524-6968 |
topic_title |
620 ASE A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions Asteroid mining (dpeaa)DE-He213 Asteroid prospector (dpeaa)DE-He213 Asteroid flyby (dpeaa)DE-He213 |
topic |
ddc 620 misc Asteroid mining misc Asteroid prospector misc Asteroid flyby |
topic_unstemmed |
ddc 620 misc Asteroid mining misc Asteroid prospector misc Asteroid flyby |
topic_browse |
ddc 620 misc Asteroid mining misc Asteroid prospector misc Asteroid flyby |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Aerotecnica missili & spazio |
hierarchy_parent_id |
1047764040 |
dewey-tens |
620 - Engineering |
hierarchy_top_title |
Aerotecnica missili & spazio |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)1047764040 (DE-600)2960384-5 |
title |
A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
ctrlnum |
(DE-627)SPR042275466 (DE-599)SPRs42496-020-00067-x-e (SPR)s42496-020-00067-x-e |
title_full |
A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
author_sort |
Cataldi, Giuseppe |
journal |
Aerotecnica missili & spazio |
journalStr |
Aerotecnica missili & spazio |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology |
recordtype |
marc |
publishDateSort |
2020 |
contenttype_str_mv |
txt |
container_start_page |
287 |
author_browse |
Cataldi, Giuseppe Marcuccio, Salvo |
container_volume |
99 |
class |
620 ASE |
format_se |
Elektronische Aufsätze |
author-letter |
Cataldi, Giuseppe |
doi_str_mv |
10.1007/s42496-020-00067-x |
dewey-full |
620 |
author2-role |
verfasserin |
title_sort |
2-d trajectory design algorithm for multiple asteroid flyby missions |
title_auth |
A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
abstract |
Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. |
abstractGer |
Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. |
abstract_unstemmed |
Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
container_issue |
4 |
title_short |
A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions |
url |
https://dx.doi.org/10.1007/s42496-020-00067-x |
remote_bool |
true |
author2 |
Marcuccio, Salvo |
author2Str |
Marcuccio, Salvo |
ppnlink |
1047764040 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s42496-020-00067-x |
up_date |
2024-07-04T01:30:13.412Z |
_version_ |
1803610083469295616 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR042275466</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220112044207.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201205s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s42496-020-00067-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR042275466</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRs42496-020-00067-x-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s42496-020-00067-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cataldi, Giuseppe</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A 2-D Trajectory Design Algorithm for Multiple Asteroid Flyby Missions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Asteroid mining is one of the most promising private space ventures of the near future. Near-Earth Asteroids (NEAs), i.e. those with perihelion at less than 1.3 AU from the Sun, are among the best candidates for such venture. In preparation of mining expeditions, it is likely that prospector missions will be carried out well in advance so to assess the accessibility, potential for revenues and possible critical issues of target asteroids. This work is concerned with the problem of the feasibility of a single spacecraft prospector mission capable of visiting as many NEAs as possible in one shot, focusing on Apollo-class asteroids only. The search of possible trajectories is done assuming a chemically propelled spacecraft with realistic specific impulse and propellant mass ratio, so to allow for a credible mission design with a reasonable, cost-effective total duration. In order to restrict the number of possible trajectories, only those that lie in the plane of the ecliptic are examined; such trajectories can be reached from the Earth without expensive plane change maneuvers. The search for a maximum number of encounters is thus restricted to those occurring where the asteroid orbit crosses the ecliptic. A deterministic building blocks approach is adopted, dividing the optimization problem in two parts: a local optimization for possible target determination; and a global optimization for the choice of the overall trajectory. It is found that the combined approach leads to the identification of viable trajectories, able to perform a number of encounters that depends on the launch epoch; as an example, in one test case two different sets of 21 NEA’s each were identified that could be reached with a single launch, with a slightly different propellant expenditure. It is concluded that the method is well suited to perform feasibility studies of NEA missions with good accuracy and moderate computational cost.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid mining</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid prospector</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Asteroid flyby</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marcuccio, Salvo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Aerotecnica missili & spazio</subfield><subfield code="d">[Cham] : Springer International Publishing, 2001</subfield><subfield code="g">99(2020), 4 vom: 12. Nov., Seite 287-295</subfield><subfield code="w">(DE-627)1047764040</subfield><subfield code="w">(DE-600)2960384-5</subfield><subfield code="x">2524-6968</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:99</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:4</subfield><subfield code="g">day:12</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:287-295</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s42496-020-00067-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">99</subfield><subfield code="j">2020</subfield><subfield code="e">4</subfield><subfield code="b">12</subfield><subfield code="c">11</subfield><subfield code="h">287-295</subfield></datafield></record></collection>
|
score |
7.401573 |