1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems
This paper presents matrix-based methods for determining optimal cargo manifests for space exploration. An exploration system is defined as a sequence of in-space and on-surface transports between multiple nodes coupled with demands for resources. The goal is to maximize value and robustness of expl...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.2699 http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.663.2699 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.663.2699 2023-05-15T18:22:58+02:00 1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems Paul T. Grogan Afreen Siddiqi Olivier L. De Weck The Pennsylvania State University CiteSeerX Archives application/pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.2699 http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.2699 http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf ci = cargo capacity of text ftciteseerx 2016-01-08T16:58:30Z This paper presents matrix-based methods for determining optimal cargo manifests for space exploration. An exploration system is defined as a sequence of in-space and on-surface transports between multiple nodes coupled with demands for resources. The goal is to maximize value and robustness of exploration while satisfying logistical demands and physical constraints at all times. To reduce problem complexity, demands are abstracted to a single class of resources and one metric (e.g. mass or volume) governs capacity limits. Matrices represent cargo carried by transports, cargo used to satisfy demands, and cargo transferred to other transports. A system of equations enforces flow conservation, demand satisfaction, and capacity constraints. Exploration system feasibility is evaluated by determining if a solution exists to a linear program or network flow problem. Manifests are optimized subject to an objective function using linear or non-linear programming techniques. In addition to modeling the manifesting problem, a few metrics such as the transport criticality index are formulated to enable analysis and interpretation. The proposed matrix manifest modeling methods are demonstrated with a notional lunar exploration system comprised of 32 transports including 8 cargo and 9 crewed landings at an outpost at the Lunar South Pole and several surface excursions to Malapert Crater and Schrodinger Basin. It is found that carry-along and pre-positioning logistics strategies yield different manifesting solutions in which transport criticality varies. For the lunar scenario, transport criticality is larger for a pre-positioning strategy (mean value of 3.02) as compared to an alternative carry-along case (mean-value of 1.99). Text South pole Unknown South Pole |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
topic |
ci = cargo capacity of |
spellingShingle |
ci = cargo capacity of Paul T. Grogan Afreen Siddiqi Olivier L. De Weck 1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
topic_facet |
ci = cargo capacity of |
description |
This paper presents matrix-based methods for determining optimal cargo manifests for space exploration. An exploration system is defined as a sequence of in-space and on-surface transports between multiple nodes coupled with demands for resources. The goal is to maximize value and robustness of exploration while satisfying logistical demands and physical constraints at all times. To reduce problem complexity, demands are abstracted to a single class of resources and one metric (e.g. mass or volume) governs capacity limits. Matrices represent cargo carried by transports, cargo used to satisfy demands, and cargo transferred to other transports. A system of equations enforces flow conservation, demand satisfaction, and capacity constraints. Exploration system feasibility is evaluated by determining if a solution exists to a linear program or network flow problem. Manifests are optimized subject to an objective function using linear or non-linear programming techniques. In addition to modeling the manifesting problem, a few metrics such as the transport criticality index are formulated to enable analysis and interpretation. The proposed matrix manifest modeling methods are demonstrated with a notional lunar exploration system comprised of 32 transports including 8 cargo and 9 crewed landings at an outpost at the Lunar South Pole and several surface excursions to Malapert Crater and Schrodinger Basin. It is found that carry-along and pre-positioning logistics strategies yield different manifesting solutions in which transport criticality varies. For the lunar scenario, transport criticality is larger for a pre-positioning strategy (mean value of 3.02) as compared to an alternative carry-along case (mean-value of 1.99). |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
Paul T. Grogan Afreen Siddiqi Olivier L. De Weck |
author_facet |
Paul T. Grogan Afreen Siddiqi Olivier L. De Weck |
author_sort |
Paul T. Grogan |
title |
1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
title_short |
1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
title_full |
1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
title_fullStr |
1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
title_full_unstemmed |
1 Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems |
title_sort |
1 matrix methods for optimal manifesting of multi-node space exploration systems |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.2699 http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf |
geographic |
South Pole |
geographic_facet |
South Pole |
genre |
South pole |
genre_facet |
South pole |
op_source |
http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.2699 http://strategic.mit.edu/docs/2_38_JSR_MatrixManifesting_final.pdf |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766202385083924480 |