• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 2
  • Tagged with
  • 5
  • 5
  • 5
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Creation and Application of Routines for Determining Physical Properties of Asteroids and Exoplanets from Low Signal-To-Noise Data Sets

Lust, Nathaniel 01 January 2014 (has links)
Astronomy is a data heavy field driven by observations of remote sources reflecting or emitting light. These signals are transient in nature, which makes it very important to fully utilize every observation. This however is often difficult due to the faintness of these observations, often are only slightly above the level of observational noise. We present new or adapted methodologies for dealing with these low signal-to-noise scenarios, along with practical examples including determining exoplanet physical properties, periodicities in asteroids, and the rotational and orbital properties of the multiple asteroid system 2577 Litva.
2

LINK ANALYSIS FOR THE NEAR EARTH ASTEROID PROSPECTOR

Barton, Randal L. 10 1900 (has links)
International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / The Near Earth Asteroid Prospector (NEAP) has a scheduled launch date between mid- 1999 and mid-2000, and will encounter a yet to be determined near Earth asteroid (1.1 - 2.2 AU distance from Earth) some ten months later [2]. The purpose of this mission is not only to collect valuable scientific and geological data, but to also determine the value of the asteroid’s materials for possible mining and exploitation [2], [3]. The purpose of this paper is to detail frequency allocation issues and to determine possible return (space to Earth) data rates associated with deep space communications with the NEAP spacecraft.
3

Inexpensive Rate-1/6 Convolutional Decoder for Integration and Test Purposes

Mengel, Edwin E., Simpson, Mark E. 10 1900 (has links)
International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California / The Near Earth Asteroid Rendezvous (NEAR) satellite will travel to the asteroid 433 Eros, arriving there early in 1999, and orbit the asteroid for 1 year taking measurements that will map the surface features and determine its elemental composition. NEAR is the first satellite to use the rate-1/6 convolutional encoding on its telemetry downlink. Due to the scarcity and complexity of full decoders, APL designed and built a less capable but inexpensive version of the decoder for use in the integration, test, and prelaunch checkout of the rate-1/6 encoder. This paper describes the rationale for the design, how it works, and the features that are included.
4

Initial guess and optimization strategies for multi-body space trajectories with application to free return trajectories to near-Earth asteroids

Bradley, Nicholas Ethan 23 October 2014 (has links)
This concept of calculating, optimizing, and utilizing a trajectory known as a ``Free Return Trajectory" to facilitate spacecraft rendezvous with Near-Earth Asteroids is presented in this dissertation. A Free Return Trajectory may be defined as a trajectory that begins and ends near the same point, relative to some central body, without performing any deterministic velocity maneuvers (i.e., no maneuvers are planned in a theoretical sense for the nominal mission to proceed). Free Return Trajectories have been utilized previously for other purposes in astrodynamics, but they have not been previously applied to the problem of Near-Earth Asteroid rendezvous. Presented here is a series of descriptions, algorithms, and results related to trajectory initial guess calculation and optimal trajectory convergence. First, Earth-centered Free Return Trajectories are described in a general manner, and these trajectories are classified into several families based on common characteristics. Next, these trajectories are used to automatically generate initial conditions in the three-body problem for the purpose of Near-Earth Asteroid rendezvous. For several bodies of interest, example initial conditions are automatically generated, and are subsequently converged, resulting in feasible, locally-optimal, round-trip trajectories to Near-Earth Asteroids utilizing Free Return Trajectories. Subsequently, a study is performed on using an unpowered flyby of the Moon to lower the overall DV cost for a nominal round-trip voyage to a Near-Earth Asteroid. Using the Moon is shown to appreciably decrease the overall mission cost. In creating the formulation and algorithms for the Lunar flyby problem, an initial guess routine for generic planetary and lunar flyby tours was developed. This continuation algorithm is presented next, and details a novel process by which ballistic trajectories in a simplistic two-body force model may be iteratively converged in progressively more realistic dynamical models until a final converged ballistic trajectory is found in a full-ephemeris, full-dynamics model. This procedure is useful for constructing interplanetary transfers and moon tours in a realistic dynamical framework; an interplanetary and an inter-moon example are both shown. To summarize, the material in this dissertation consists of: novel algorithms to compute Free Return Trajectories, and application of the concept to Near-Earth Asteroid rendezvous; demonstration of cost-savings by using a Lunar flyby; and a novel routine to transfer trajectories from a simplistic model to a more realistic dynamical representation. / text
5

Multiple Asteroid Retrieval Mission

Gargioni, Gustavo 11 May 2020 (has links)
In this thesis, the possibility of enabling space-mining for the upcoming decade is explored. Making use of recently-proven reusable rockets, we envision a fleet of spacecraft capable of reaching Near-Earth asteroids. To analyze this idea, the goal of this problem is to maximize the asteroid mass retrieved within a spacecraft max life span. Explicitly, the maximum lifetime of the spacecraft fleet is set at 30 years. A fuel supply-chain is proposed and designed so that each spacecraft is refueled before departing for each asteroid. To maximize access to the number of asteroids and retrievable mass for each mission, we propose launching each mission from an orbit with low escape velocity. The L2-Halo orbit at the libration point in the Earth-Moon system was selected due to its easy access from Low-Earth Orbit and for a cislunar synergy with NASA Gateway. Using data from NASA SmallBody and CNEOS databases, we investigated NEAs in the period between 2030 and 2060 could be captured in the ecliptic plane and returned to L2-Halo with two approaches, MARM-1 and MARM-2. Together, these databases provide all information for every asteroid's close approach known today. Returning the asteroid as a whole is explored in the MARM-1 method, while MARM-2 evaluates the possibility of reaching larger asteroids and returning a fragment of their masses, such that it optimizes the available cargo weight per time of flight of each mission. The following results are compared with previous work from the community. The results show a 96% reduction in the cost per kg, with an enormous increase in retrieved mass. With these results, this thesis shows that not solely energy or dynamic optimization will be responsible for proving space mining feasibility, but rather a combination of those and business best practices. Proving feasibility for space mining is a complex and immense problem. Although this thesis opens new possibilities for future work on the field and sparkes the interest of private endeavors, the final solution for this problem still requires additional exploration. / M.S. / In this thesis, the possibility of enabling space-mining for the upcoming decade is explored. Making use of recently-proven reusable rockets, we envision a fleet of spacecraft capable of reaching Near-Earth asteroids, NEAs. To analyze this idea, the goal of this problem is to maximize the asteroid mass retrieved within a spacecraft max life span. Explicitly, the maximum lifetime of the spacecraft fleet is set at 30 years. A fuel supply-chain is proposed and designed so that each spacecraft is refueled before departing for each asteroid. To maximize access to the number of asteroids and retrievable mass for each mission, we propose launching each mission from an orbit with low escape velocity. A location after the Moon, at the L2-Halo orbit, was selected due to its easy access from Low-Earth Orbit and for a synergy with the proposed new space station at the Moon orbit. Using data from NASA databases, we investigated the asteroids in the period between 2030 and 2060 that could be captured and returned with two approaches, MARM-1 and MARM-2. Together, these databases provide all information for every asteroid's close approach known today. Returning the asteroid as a whole is explored in the MARM-1 method, while MARM-2 evaluates the possibility of reaching larger asteroids and returning a fragment of their masses, such that it optimizes the available cargo weight per time of flight of each mission. The following results are compared with previous work from the community. The results show a 96% reduction in the cost per kg, with an enormous increase in retrieved mass. With these results, this thesis shows that not solely energy or dynamic optimization will be responsible for proving space mining feasibility, but rather a combination of those and business best practices. Proving feasibility for space mining is a complex and immense problem. Although this thesis opens new possibilities for future work on the field and sparkes the interest of private endeavors, the final solution for this problem still requires additional exploration.

Page generated in 0.3694 seconds