FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2321344199> ?p ?o ?g. }

• W2321344199 abstract "NASA’s new direction for human spaceflight reaffirms that Mars is the ultimate goal of human exploration of the inner solar system. In response to this background, we can expect to see an increasing number of robotic explorations of Mars over the next several decades, followed by human missions. In a period of transition to a new era of space exploration, the question is what the next space logistics paradigm should be. Adding to the technical challenges, logistical concerns should be considered far in advance. A well-planned logistics strategy is essential to balance risks, ensure robustness, and achieve maximum exploration capability. Space logistics is an emerging topic in recent years as we start to see space exploration not as a set of isolated missions but as an intricately-linked exploration campaign. A vast body of research exists for terrestrial transportation networks and supply chain logistics in business and military applications. However, space exploration introduces several fundamental differences such as infrequent launch windows, long transport durations, and minimal cargo capacity. The past studies on space logistics have been mainly focused on a “vehicle” perspective such as propulsive feasibility, cargo capacity constraints, manifesting strategies, and demand satisfaction, assuming a pre-defined logistics network. However, there is more than one way to define a logistics network (transfer points) between origin and destination such as ISRU on the surface nodes and resource depots in orbital nodes or Lagrangian nodes. Therefore, this paper proposes a graph-theoretic modeling approach to analyze spaceflight campaign logistics seeking for “resource-economy” from a “network” perspective. We define resource-economy in the context of space exploration, identify the building blocks of logistics network (nodes, arcs, and costs), and present a quick example to show the potential benefits of ISRU and resource depots. Once the generic framework has been modeled and implemented, it will be able to be used a proof of concept, providing a useful index of resource-economy to quantitatively compare different concepts of exploration. Moreover, this framework will not only evaluate and compare specific scenarios but also find the key drivers of resource-economy in space logistics." @default.
• W2321344199 created "2016-06-24" @default.
• W2321344199 creator A5025898649 @default.
• W2321344199 creator A5027288153 @default.
• W2321344199 creator A5058201001 @default.
• W2321344199 creator A5076233533 @default.
• W2321344199 date "2011-06-14" @default.
• W2321344199 modified "2023-09-27" @default.
• W2321344199 title "A Proposal for Graph-Theoretic Modeling Approach to Resource-Economy in Spaceflight Campaign Logistics" @default.
• W2321344199 cites W2016203300 @default.
• W2321344199 cites W2041589757 @default.
• W2321344199 cites W2048201038 @default.
• W2321344199 cites W2067328946 @default.
• W2321344199 cites W2068280523 @default.
• W2321344199 cites W2101215876 @default.
• W2321344199 cites W2133865406 @default.
• W2321344199 cites W2148052920 @default.
• W2321344199 cites W2269954974 @default.
• W2321344199 cites W2325510452 @default.
• W2321344199 cites W2334906734 @default.
• W2321344199 doi "https://doi.org/10.2514/6.2011-7347" @default.
• W2321344199 hasPublicationYear "2011" @default.
• W2321344199 type Work @default.
• W2321344199 sameAs 2321344199 @default.
• W2321344199 citedByCount "3" @default.
• W2321344199 countsByYear W23213441992012 @default.
• W2321344199 countsByYear W23213441992013 @default.
• W2321344199 crossrefType "proceedings-article" @default.
• W2321344199 hasAuthorship W2321344199A5025898649 @default.
• W2321344199 hasAuthorship W2321344199A5027288153 @default.
• W2321344199 hasAuthorship W2321344199A5058201001 @default.
• W2321344199 hasAuthorship W2321344199A5076233533 @default.
• W2321344199 hasConcept C103888896 @default.
• W2321344199 hasConcept C114614502 @default.
• W2321344199 hasConcept C127413603 @default.
• W2321344199 hasConcept C132525143 @default.
• W2321344199 hasConcept C146978453 @default.
• W2321344199 hasConcept C206345919 @default.
• W2321344199 hasConcept C31258907 @default.
• W2321344199 hasConcept C33923547 @default.
• W2321344199 hasConcept C41008148 @default.
• W2321344199 hasConcept C42475967 @default.
• W2321344199 hasConcept C80444323 @default.
• W2321344199 hasConcept C88230418 @default.
• W2321344199 hasConceptScore W2321344199C103888896 @default.
• W2321344199 hasConceptScore W2321344199C114614502 @default.
• W2321344199 hasConceptScore W2321344199C127413603 @default.
• W2321344199 hasConceptScore W2321344199C132525143 @default.
• W2321344199 hasConceptScore W2321344199C146978453 @default.
• W2321344199 hasConceptScore W2321344199C206345919 @default.
• W2321344199 hasConceptScore W2321344199C31258907 @default.
• W2321344199 hasConceptScore W2321344199C33923547 @default.
• W2321344199 hasConceptScore W2321344199C41008148 @default.
• W2321344199 hasConceptScore W2321344199C42475967 @default.
• W2321344199 hasConceptScore W2321344199C80444323 @default.
• W2321344199 hasConceptScore W2321344199C88230418 @default.
• W2321344199 hasLocation W23213441991 @default.
• W2321344199 hasOpenAccess W2321344199 @default.
• W2321344199 hasPrimaryLocation W23213441991 @default.
• W2321344199 hasRelatedWork W1524858705 @default.
• W2321344199 hasRelatedWork W2107367999 @default.
• W2321344199 hasRelatedWork W2333750674 @default.
• W2321344199 hasRelatedWork W2391817034 @default.
• W2321344199 hasRelatedWork W2801014462 @default.
• W2321344199 hasRelatedWork W2806254788 @default.
• W2321344199 hasRelatedWork W2900673039 @default.
• W2321344199 hasRelatedWork W2997903470 @default.
• W2321344199 hasRelatedWork W3095522972 @default.
• W2321344199 hasRelatedWork W4317655900 @default.
• W2321344199 isParatext "false" @default.
• W2321344199 isRetracted "false" @default.
• W2321344199 magId "2321344199" @default.
• W2321344199 workType "article" @default.