Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Orbiter optimization algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

Martian Aerocapture Terminal Point Guidance: A Reference Path Optimization Study

An effective method of terminal point guidance is to employ influence coefficients, which are solved from a set of differential equations adjoint to the linearized perturbations of the equations of motion about a reference trajectory. Hence, to optimize this type of guidance, one must first optimize the reference trajectory that the guidance is based upon. This study concentrates on various methods to optimize a reference trajectory for a Martian aerocapture maneuver, including a parametric analysis and first order gradient method. Resulting reference trajectories were tested in separate 2000 6-DOF Monte Carlo runs, using the Atmospheric Guidance Algorithm Testbed for the Mars Surveyor Program 2001 (MSP '01) Orbiter. These results were compared to an August 1998 study using the same terminal point control guidance algorithm and simulation testbed. Satisfactory improvements over the 1998 study are amply demonstrated.

Ro, Theodore U.↗

Optimizing Orbit-Instrument Configuration for Global Precipitation Mission (GPM) Satellite Fleet

Following the scientific success of the Tropical Rainfall Measuring Mission (TRMM) spearheaded by a group of NASA and NASDA scientists, their external scientific collaborators, and additional investigators within the European Union's TRMM Research Program (EUROTRMM), there has been substantial progress towards the development of a new internationally organized, global scale, and satellite-based precipitation measuring mission. The highlights of this newly developing mission are a greatly expanded scope of measuring capability and a more diversified set of science objectives. The mission is called the Global Precipitation Mission (GPM). Notionally, GPM will be a constellation-type mission involving a fleet of nine satellites. In this fleet, one member is referred to as the "core" spacecraft flown in an approximately 70 degree inclined non-sun-synchronous orbit, somewhat similar to TRMM in that it carries both a multi-channel polarized passive microwave radiometer (PMW) and a radar system, but in this case it will be a dual frequency Ku-Ka band radar system enabling explicit measurements of microphysical DSD properties. The remainder of fleet members are eight orbit-synchronized, sun-synchronous "constellation" spacecraft each carrying some type of multi-channel PMW radiometer, enabling no worse than 3-hour diurnal sampling over the entire globe. In this configuration the "core" spacecraft serves as a high quality reference platform for training and calibrating the PMW rain retrieval algorithms used with the "constellation" radiometers. Within NASA, GPM has advanced to the pre-formulation phase which has enabled the initiation of a set of science and technology studies which will help lead to the final mission design some time in the 2003 period. This presentation first provides an overview of the notional GPM program and mission design, including its organizational and programmatic concepts, scientific agenda, expected instrument package, and basic flight architecture. Following this introduction, we focus specifically on the last topic, that being an analysis which leads to an optimal flight architecture dictated in part by science requirements but constrained by allowable orbital mechanics, instrument scan patterns, and antenna aperture properties. Because the optimal architecture involves an interplay between orbit mechanics and instrument specifications, it is important to recognize that in attempting to serve various scientific themes, the final optimal architecture will represent a compromise concerning dynamic range, spatial resolution, sampling interval, pointing, beam coincidence, and measurement uncertainty. Moreover, cost becomes a major factor in seeking the optimal architecture through the pathways of antenna and instrument scan designs, as well as propulsion requirements associated with the orbit heights of various "constellation" members. Although the results presented at the IGARSS-2001 meeting will likely not be the fully refined flight architecture specifications, they are expected to be nearly complete.

Smith, Eric A.↗

Numerical orbit integration efficiency of the Delaunay-Similar elements

Orbit equations with a set of conservative and a set of nonconservative perturbing potentials were considered. Scheifele's DS formulation of these equations has dependent variables similar to Delaunay's orbital elements with the true anomaly as the independent variable. Efficiency curves of computing cost v.s. accuracy were constructed for Adams integrators of order of 2 through 15 with several correcting algorithms and for a Runga-Kutta integrator. Considering stability regions, choices were made for the optimally efficient integration modes for the DS elements. Integrating in these modes reduces computing costs for a specified accuracy.

Pierce, S.↗

Registration of interferometric SAR images

Interferometric synthetic aperture radar (INSAR) is a new way of performing topography mapping. Among the factors critical to mapping accuracy is the registration of the complex SAR images from repeated orbits. A new algorithm for registering interferometric SAR images is presented. A new figure of merit, the average fluctuation function of the phase difference image, is proposed to evaluate the fringe pattern quality. The process of adjusting the registration parameters according to the fringe pattern quality is optimized through a downhill simplex minimization algorithm. The results of applying the proposed algorithm to register two pairs of Seasat SAR images with a short baseline (75 m) and a long baseline (500 m) are shown. It is found that the average fluctuation function is a very stable measure of fringe pattern quality allowing very accurate registration.

Lin, Qian↗

Semi-analytic preliminary design of low-thrust missions

Using generalized logarithmic spirals to approximate low-thrust trajectories, a new strategy for the design of low-thrust gravity-assist transfers has been developed. Each transfer leg is defined by a semi-analytic model, and its solution is equivalent to a hybrid Lambert’s problem. The method is suitable for approximating both flyby and rendezvous transfer legs. A branch and prune algorithm is used to generate a collection of initial guesses for further optimization. The analytic nature of the low-thrust model simplifies the pruning step, since dynamical and operational constraints (like maximum thrust or total v) can be imposed easily. The solutions obtained with the global search algorithm can be post-processed, filtered, and ranked according to various criteria. This is where the versatility of the method resides, because changing the selection criteria does not require a new search. Selected candidates are then optimized further, in order to generate actual low-thrust orbits. Two mission design examples are presented: an asteroid deflection mission using a kinetic impactor, and a rendezvous mission to Jupiter. These examples are used to analyze the convergence of the optimization stage, in particular how far from the optimal solution the initial guesses are.

Park, Ryan S.↗

The dynamics and control of large flexible space structures, 3. Part A: Shape and orientation control of a platform in orbit using point actuators

The dynamics, attitude, and shape control of a large thin flexible square platform in orbit are studied. Attitude and shape control are assumed to result from actuators placed perpendicular to the main surface and one edge and their effect on the rigid body and elastic modes is modelled to first order. The equations of motion are linearized about three different nominal orientations: (1) the platform following the local vertical with its major surface perpendicular to the orbital plane; (2) the platform following the local horizontal with its major surface normal to the local vertical; and (3) the platform following the local vertical with its major surface perpendicular to the orbit normal. The stability of the uncontrolled system is investigated analytically. Once controllability is established for a set of actuator locations, control law development is based on decoupling, pole placement, and linear optimal control theory. Frequencies and elastic modal shape functions are obtained using a finite element computer algorithm, two different approximate analytical methods, and the results of the three methods compared.

Bainum, P. M.↗

Advanced design for orbital debris removal in support of solar system exploration

The development of an Autonomous Space Processor for Orbital Debris (ASPOD) is the ultimate goal. The craft will process, in situ, orbital debris using resources available in low Earth orbit (LEO). The serious problem of orbital debris is briefly described and the nature of the large debris population is outlined. This year, focus was on development of a versatile robotic manipulator to augment an existing robotic arm; incorporation of remote operation of robotic arms; and formulation of optimal (time and energy) trajectory planning algorithms for coordinating robotic arms. The mechanical design of the new arm is described in detail. The versatile work envelope is explained showing the flexibility of the new design. Several telemetry communication systems are described which will enable the remote operation of the robotic arms. The trajectory planning algorithms are fully developed for both the time-optimal and energy-optimal problem. The optimal problem is solved using phase plane techniques while the energy optimal problem is solved using dynamics programming.

Source record↗

Low-Thrust Control of a Lunar Mapping Orbit

A method is presented for generating and maintaining a lunar mapping orbit using continuous low-thrust hardware. Optimal control theory is used to maintain a lunar orbit that is low-altitude, near-polar, and Sun-synchronous; three typical requirements for a successful lunar mapping mission. The analysis of the optimal control problem leads to the commonly seen two-point boundary value problem, which is solved using a simple indirect shooting algorithm. Simulations are presented for a 50-day mapping duration, in which it is shown that a very tight control is achieved with thrust levels below 1 N for a 1000 kg spacecraft. A straightforward approach for using the method presented to compute missions of any duration is also discussed.

Harl, Nathan↗

GOES-17 Advanced Baseline Imager Performance Recovery Summary

The 17th Geostationary Operational Environmental Satellite (GOES-17) was launched on 1 March 2018. The Advanced Baseline Imager (ABI) is the primary instrument on the GOES-R series for weather and environmental monitoring. The GOES-17 ABI (flight model 2) experienced a degradation in its thermal system that limits ABI's ability to shed solar heat load. This limitation resulted in significant reduction in performance after initial turn on with only 3 of 16 spectral channels expected to be available for much of the year. A combined government/vendor team was tasked with optimizing the operation of ABI to recapture as much performance as possible. By modifying the operational configuration and sensor parameters, the team was able to regain over 97% imaging capability.This was accomplished by taking advantage of the considerably flexible nature of ABI's design to adapt its configuration to the new reality and improve capabilities for many of ABI's subsystems. The significant differences in operational configuration, sensor parameter optimization, and algorithm optimization will be discussed as well as their impact on performance and data availability.

Advanced Baseline Imager↗

Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours),periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models(and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra’s algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.

Robert Short↗

Langley Automated Sensor Inter-calibration System (LASICS): Open Access Tools for Satellite Imager Inter- Calibration

Satellite imager calibration teams are tasked with maintaining stable measurement records to facilitate reliable monitoring of geophysical parameters and ensure dependable input for forecast models. Satellite imagers are neither uniformly calibrated nor radiometrically scaled to a common reference standard. Consistent inter-calibration between various earth-orbiting satellite imager pairs is a critical step in the creation of seamless earth-scene reflectance data records over time for input to higher level algorithms that retrieve earth system climate-sensitive properties. Each imager inherently by virtue of its optics (and associated properties like spectral response etc.) and orbit will have a unique measurement of the same earth-scene reflected signal. A key part of this is the computationally efficient and optimal identification and prediction of science opportunities where the imager pairs from the irrespective earth-orbits near-simultaneously view the same stable terrestrial targets with nearly identical viewing and solar geometry.

Arun Gopalan↗

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

While the Ice Giants are a top priority for flagship missions in the NASA’s near-term future, current technologies limit the scientific payload and mission timeline for future Uranian and Neptunian missions due to the need for fuel for orbit insertion maneuvers. Thus, to maximize the scientific potential of future missions, atmospheric aerocapture has been heavily researched. While atmospheric aerocapture simulations have proven enabling for capturing around Neptune, its deep atmospheric pass requires an aeroshell with robust thermal protection systems (TPS). Magnetohydrodynamically-controlled aerocapture serves as a potential solution to the limitations of both fully propulsive orbit insertion and aerodynamically controlled aerocapture. Through NASA Langley’s high-fidelity flight dynamics simulation, the Program to Optimize Simulated Trajectories II, both the aerodynamic-only and magnetohydrodynamic aerocapture methods were simulated and compared for identical missions to Neptune. After applying an optimized numerical predictor-corrector guidance algorithm for both methods, the results showed that magnetohydrodynamics has not only the control authority to successfully capture around Neptune, but also the unique advantage of a shallower atmospheric pass, decreasing the maximum heat load and the required TPS mass.

Danny N. Nguyen↗

Comment on 'Time-optimal orbit transfer trajectory for solar sail spacecraft'

An analytic proof is presented to show that the orbital transfer times of an earth-to-Mars solar-sail propelled spacecraft trajectory as calculated by Jayaraman (1980) are incorrect. In particular, different boundary conditions are defined, which indicate that a minimization of the Hamiltonian, which Jayaraman used, can yield the wrong stationary solution. Transfer times are calculated using a neighboring extremal algorithm based on numerical differentiation in conjunction with Krogh's variable order, variable step size integrator, resulting in a transfer time of 322 days at 2 mm/sec-sq, with endpoint restraints satisfied to within 1/1 billion. Finally, it is concluded that minimization of flight time is secondary in importance to maximization of delivered payload and minimization of overall mission cost and risk.

Wood, L. J.↗

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The dynamics and control of large flexible space structures - 13

The optimal control of three-dimensional large angle maneuvers and vibrations of a Shuttle-mast-reflector system is considered. The nonlinear equations of motion are formulated by using Lagrange's formula, with the mast modeled as a continuous beam subject to three-dimensional deformations. Pontryagin's Maximum Principle is applied to the slewing problem, to derive the necessary conditions for the optimal controls, which are bounded by given saturation levels. The resulting two point boundary value problem is then solved by using the quasilinearization algorithm and the method of particular solutions. The study of the large angle maneuvering of the Shuttle-beam-reflector spacecraft in the plane of a circular earth orbit is extended to consider the effects of the structural offset connection, the axial shortening, and the gravitational torque on the slewing motion. Finally the effect of additional design parameters (such as related to additional payload requirement) on the linear quadratic regulator based design of an orbiting control/structural system is examined.

Bainum, Peter M.↗

Autonomous space processor for orbital debris

The development of an Autonomous Space Processor for Orbital Debris (ASPOD) was the goal. The nature of this craft, which will process, in situ, orbital debris using resources available in low Earth orbit (LEO) is explained. The serious problem of orbital debris is briefly described and the nature of the large debris population is outlined. The focus was on the development of a versatile robotic manipulator to augment an existing robotic arm, the incorporation of remote operation of the robotic arms, and the formulation of optimal (time and energy) trajectory planning algorithms for coordinated robotic arms. The mechanical design of the new arm is described in detail. The work envelope is explained showing the flexibility of the new design. Several telemetry communication systems are described which will enable the remote operation of the robotic arms. The trajectory planning algorithms are fully developed for both the time optimal and energy optimal problems. The time optimal problem is solved using phase plane techniques while the energy optimal problem is solved using dynamic programming.

Ramohalli, Kumar↗

A Rapid Target-Search Technique for KBO Exploration Trajectories

A rapid, grid-based, target-search algorithm is presented to find candidate se-quences of small-body encounters for mission design. The algorithm is especially relevant for cases with large combinatorial spaces. In this paper, the al-gorithm is used to identify candidate flyby sequences of multiple Kuiper-Belt Ob-jects (KBOs). Before reaching the first KBO in the sequence, the trajectories in this paper first use gravity assists at one or more of the giant planets to pump-uptheir orbital energy—reducing launch C3. The target-search algorithm consists offour sequential steps: (1) parameter definition, (2) fine-tuned Lambert-based gridsearch of ballistic trajectories visiting one KBO, (3) rapid, ∆V-based proximitysearch for additional KBOs using the state transition matrices (STMs), and (4) tra-jectory optimization of the most promising KBO sequences using the EvolutionaryMission Trajectory Generator (EMTG). The paper also defines an empirical-basedprocess to characterize the maximum step size for the target arrival dates in theLambert grid search. Lastly, a candidate mission to two KBOs is presented. Theresults indicate that the ∆V computed from the STM propagations is not repre-sentative of the final ∆V computed in EMTG; however, it does serve as a useful‘reachability’ metric to identify nearby KBOs.

Miguel Benayas Penas↗