SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS2018

Geostationary Lightning Mapper On-Orbit Sources of False Events

The first Geostationary Lightning Mapper (GLM) was launched aboard the GOES-R Spacecraft (now GOES-East) on November 19, 2016 and is now fully operational. GLM uses a high-speed camera and onboard video processing to detect the optical emission of lightning for the full disk observed from the geostationary orbit. During the Post Launch Test period the instrument and ground processing algorithms (GPAs) were tuned to optimize the tradeoff between detection efficiency and false event rate. False events, those not due to lightning, arise from a variety of sources. A primary function of the GPAs is to remove false events prior to assembling events into groups and flashes for use by weather forecasters and scientists. Effective discrimination of false events depends on understanding the phenomenology of the various sources of false events.

GOES-R↗

NASA NTRS2018

Solar Sail Transfers from Invariant Objects to L5 Periodic Orbits

The rising interest in a mission to the Sun-Earth L5 point for heliophysics or Trojan asteroid search and the development of solar sails has opened the question of using solar radiation pressure for such a mission. Different solar sail trajectories to the Sun-Earth L5 point are constructed. Different invariant objects in the neighbourhood of Earth are considered for departure: equilibrium points, families of periodic orbits and their associated invariant manifold. Using a multi-objective genetic algorithm, differential correction and the optimal control solver PSOPT the transfers are obtained. The approach followed results in fast solar sail transfers which can be used for the preliminary design of a mission to the Sun-Earth L5 point.

Fernandez, Alvaro↗

DOE OSTI2024

Accurate and efficient open-source implementation of domain-based local pair natural orbital (DLPNO) coupled-cluster theory using a t1-transformed Hamiltonian

We present an efficient, open-source formulation for coupled-cluster theory through perturbative triples with domain-based local pair natural orbitals [DLPNO-CCSD(T)]. Similar to the implementation of the DLPNO-CCSD(T) method found in the ORCA package, the most expensive integral generation and contraction steps associated with the CCSD(T) method are linear-scaling. In this work, we show that the t1-transformed Hamiltonian allows for a less complex algorithm when evaluating the local CCSD(T) energy without compromising efficiency or accuracy. Our algorithm yields sub-kJ mol−1 deviations for relative energies when compared with canonical CCSD(T), with typical errors being on the order of 0.1 kcal mol−1, using our TightPNO parameters. We extensively tested and optimized our algorithm and parameters for non-covalent interactions, which have been the most difficult interaction to model for orbital (PNO)-based methods historically. To highlight the capabilities of our code, we tested it on large water clusters, as well as insulin (787 atoms).

Chemistry↗

NASA NTRS2013

Orbit Clustering Based on Transfer Cost

We propose using cluster analysis to perform quick screening for combinatorial global optimization problems. The key missing component currently preventing cluster analysis from use in this context is the lack of a useable metric function that defines the cost to transfer between two orbits. We study several proposed metrics and clustering algorithms, including k-means and the expectation maximization algorithm. We also show that proven heuristic methods such as the Q-law can be modified to work with cluster analysis.

combinatorial optimization↗

NASA NTRSDate not supplied

Creating Near Real-time Hourly VIIRS Radiance Mosaic over Polar Regions from SatCORPS Global Cloud Composite (GCC)

While polar orbiting satellites are essential in providing the needed observations over polar regions for data assimilation, weather diagnoses/forecasting, and flight guidance and situation awareness in airborne field campaigns, there is limited temporal coverage. Often, polar mosaics are created by overlaying multiple satellite imagers on top of each other which can lead to transition lines and discontinuities in the data products. To help ease some of these shortcomings, we utilize the NASA Langley Satellite ClOud and Radiation Property retrieval System (SatCORPS) Mosaic algorithm for optimally fusing and merging selected imager radiances from the Visible Infrared Imaging Radiometer Suite (VIIRS) instrument onboard the Suomi National polar-orbiting Partnership (SNPP), Joint Polar Satellite System (JPSS-1), and JPSS-2 satellites, and the MODerate resolution Imaging Spectroradiometer (MODIS) instruments onboard AQUA and TERRA satellites. Since multiple satellites overpasses and instruments are used in creating hourly 3-km composites over the polar regions, selection of the best satellite data for each 3-km composite pixel is based on aggregated ranking of satellite resolution, time, viewing zenith angle, and distance from terminator. This ranking system provides a smoother transition and improves data discontinuity in the merged output resulting in a more seamless polar region dataset. We will discuss the use of this near real-time dataset to support polar airborne field campaigns and SatCORPS satellite-derived Global Cloud Composite (GCC) generation.

Satellite composites↗

DOE OSTI2021

Static and dynamic magnetic properties of honeycomb lattice antiferromagnets Na 2 M 2 TeO 6 , M = Co and Ni

The magnetic structures and spin dynamics of Na 2 CO 2 TeO 6 and Na 2 Ni 2 TeO 6 are investigated by means of elastic and inelastic neutron scattering measurements and the results are discussed in the context of a generalized Kitaev-Heisenberg model on a honeycomb lattice with strong spin-orbit coupling. The large number of parameters involved in the Hamiltonian model is evaluated by using an iterative optimization algorithm capable of extracting model solutions and simultaneously estimating their uncertainty. The analyses indicate that both Co 2+ (d 7 ) and Ni 2+ (d 8 ) antiferromagnets realize bond-dependent anisotropic nearest-neighbor interactions and support the theoretical predictions for the realization of Kitaev physics in 3 d electron systems with effective spins S = 1/2 and 1. By studying the Na-doped system Na 2.4 Ni 2 TeO 6 , we show that the control of Na content can provide an effective route for fine-tuning the magnetic lattice dimensionality, as well as to controlling the bond-dependent anisotropic interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1997

Wing Flutter Control

Through Small Business Innovation Research (SBIR) contracts from Langley Research Center, Orbital Research Inc. developed the Orbital Research Intelligent Control Algorithm (ORICA), the first practical hardware-independent adaptive predictive control structure, specifically suited for optimal control of complex, time-varying systems. ORICA technology has been applied to the problem of controlling aircraft wing flutter. Coupled with NASA expertise, the technology has the possibility of making jet travel safer, more cost effective by extending distance range, and lowering overall aircraft operating costs. Future application areas for ORICA include control of robots, power trains, systems with arrays of sensors, or regulating chemical plants or electrical power plant control.

Source record↗

NASA NTRS2015

Rho-Isp Revisited and Basic Stage Mass Estimating for Launch Vehicle Conceptual Sizing Studies

The ideal rocket equation is manipulated to demonstrate the essential link between propellant density and specific impulse as the two primary stage performance drivers for a launch vehicle. This is illustrated by examining volume-limited stages such as first stages and boosters. This proves to be a good approximation for first-order or Phase A vehicle design studies for solid rocket motors and for liquid stages, except when comparing to hydrogen-fueled stages. A next-order mass model is developed that is able to model the mass differences between hydrogen-fueled and other stages. Propellants considered range in density from liquid methane to inhibited red fuming nitric acid. Calculated comparisons are shown for solid rocket boosters, liquid first stages, liquid upper stages, and a balloon-deployed single-stage-to-orbit concept. The derived relationships are ripe for inclusion in a multi-stage design space exploration and optimization algorithm, as well as for single-parameter comparisons such as those shown herein.

Kibbey, Timothy P.↗

NASA NTRS2001

Optimal Orbit Design for the Magnetospheric Imaging Constellation

The Magnetospheric Imaging Constellation (MagIC) is a NASA space science concept to study the Earth's Magnetosphere. The concept proposes to apply tomography techniques using an array of spacecraft to obtain three dimensional images of the Earth's magnetosphere. This paper presents an optimal orbit design to ensure that the constellation is in the desired region of the magnetosphere for maximum time. The solution is found using a steepest descent optimization algorithm that takes into account perturbations from the non-spherical Earth, drag, Sun, Moon and other significant bodies. The solution also satisfies constraints on maximum eclipse duration and geometry constraints to allow an adequate GPS navigation solution. We present three solutions depending upon the epoch of the primary science: vernal equinox, summer solstice, and a third midway between the vernal equinox and summer solstice. Orbit insertion is also considered. All spacecraft are assumed to be launched on a single vehicle into a nominal orbit and the (Delta)V's to achieve the nominal orbit are presented. After insertion into the nominal orbit, each spacecraft undergoes a phasing maneuver to place it in the appropriate position with respect to the rest of the constellation. We present a minimum fuel approach to maneuver each spacecraft from the nominal orbit into the desired final orbit.

Hughes, Steven P.↗

NASA NTRS2014

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

NASA NTRS1990

Trajectory optimization for real-time guidance. I - Time-varying LQR on a parallel processor

A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.

Psiaki, Mark L.↗

NASA NTRS2010

Guidance and Control System for a Satellite Constellation

A distributed guidance and control algorithm was developed for a constellation of satellites. The system repositions satellites as required, regulates satellites to desired orbits, and prevents collisions. 1. Optimal methods are used to compute nominal transfers from orbit to orbit. 2. Satellites are regulated to maintain the desired orbits once the transfers are complete. 3. A simulator is used to predict potential collisions or near-misses. 4. Each satellite computes perturbations to its controls so as to increase any unacceptable distances of nearest approach to other objects. a. The avoidance problem is recast in a distributed and locally-linear form to arrive at a tractable solution. b. Plant matrix values are approximated via simulation at each time step. c. The Linear Quadratic Gaussian (LQG) method is used to compute perturbations to the controls that will result in increased miss distances. 5. Once all danger is passed, the satellites return to their original orbits, all the while avoiding each other as above. 6. The delta-Vs are reasonable. The controller begins maneuvers as soon as practical to minimize delta-V. 7. Despite the inclusion of trajectory simulations within the control loop, the algorithm is sufficiently fast for available satellite computer hardware. 8. The required measurement accuracies are within the capabilities of modern inertial measurement devices and modern positioning devices.

Bryson, Jonathan Lamar↗

DOE OSTI2025

An improved guess for the variational calculation of charge-transfer excitations in large systems

Ab initio quantum-chemical methods that perform well for computing the electronic ground state are not straightforwardly transferable to electronically excited states, particularly in large molecular systems. Wave function theory offers high accuracy, but is often prohibitively expensive. Methods based on time-dependent density functional theory (TD-DFT) are crucially sensitive to the chosen exchange-correlation functional (XCF) parameterization, and system-specific tuning protocols were therefore proposed to address the method's robustness. Methods based on the variational relaxation of the excited-state electron density showcased promising results for the calculation of charge-transfer excitations, but the complex shape of the electronic hypersurface makes convergence to a specific excited state much more difficult than for the ground state when standard variational techniques are applied. We address the latter aspect by providing suitable initial guesses, which we obtain by two separate constrained algorithms. Combined with the squared-gradient minimization algorithm for all-electrons relaxation in a freeze-and-release scheme (FRZ-SGM), we demonstrate that orbital-optimized density functional theory (OO-DFT) calculations can reliably converge to the charge-transfer states of interest even for large molecular systems. We test the FRZ-SGM method on a phenothiazine-anthraquinone CT excitation in a supramolecular Pd(II) coordination cage complex as a function of the cage conformation. This compound has been studied experimentally prior to our work. We compare this freeze-and-release scheme to two XCF reparameterizations, which were recently proposed as low-cost TD-DFT-based alternatives to variational methods. Two dye-semiconductor complexes, which were previously investigated in the context of photovoltaic applications, serve as a second example to investigate the convergence and stability of the FRZ-SGM approach. Our results demonstrate that FRZ-SGM provides reliable convergence for charge-transfer excited states and avoids variational collapse to lower-lying electronic states, whereas time-dependent DFT calculations with an adequate tuning procedure for the range-separation parameter provide a computationally efficient initial estimate of the corresponding energies, with a computational cost comparable to that of configuration-interaction singles (CIS) calculations.

Bogo, Nicola↗

NASA NTRS2004

Link Design and Planning for Mars Reconnaissance Orbiter (MRO) Ka-band (32 GHz) Telecom Demonstration

NASA is planning an engineering telemetry demonstration with Mars Reconnaissance Orbiter (MRO). Capabilities of Ka-band (32 GHz) for use with deep space mission are demonstrated using the link optimization algorithms and weather forecasting. Furthermore, based on the performance of previous deep space missions with Ka-band downlink capabilities, experiment plans are developed for telemetry operations during superior solar conjunction. A general overview of the demonstration is given followed by a description of the mission planning during cruise, the primary science mission and superior conjunction. As part of the primary science mission planning the expected data return for various data optimization methods is calculated. These results indicate that, given MRO's data rates, a link optimized to use of at most two data rates, subject to a minimum availability of 90%, performs almost as well as a link with no limits on the number of data rates subject to the same minimum availability.

Ka-band↗

NASA NTRS2010

The OMPS Limb Profiler Instrument: Two-Dimensional Retrieval Algorithm

The upcoming Ozone Mapper and Profiler Suite (OMPS), which will be launched on the NPOESS Preparatory Project (NPP) platform in early 2011, will continue monitoring the global distribution of the Earth's middle atmosphere ozone and aerosol. OMPS is composed of three instruments, namely the Total Column Mapper (heritage: TOMS, OMI), the Nadir Profiler (heritage: SBUV) and the Limb Profiler (heritage: SOLSE/LORE, OSIRIS, SCIAMACHY, SAGE III). The ultimate goal of the mission is to better understand and quantify the rate of stratospheric ozone recovery. The focus of the paper will be on the Limb Profiler (LP) instrument. The LP instrument will measure the Earth's limb radiance (which is due to the scattering of solar photons by air molecules, aerosol and Earth surface) in the ultra-violet (UV), visible and near infrared, from 285 to 1000 nm. The LP simultaneously images the whole vertical extent of the Earth's limb through three vertical slits, each covering a vertical tangent height range of 100 km and each horizontally spaced by 250 km in the cross-track direction. Measurements are made every 19 seconds along the orbit track, which corresponds to a distance of about 150km. Several data analysis tools are presently being constructed and tested to retrieve ozone and aerosol vertical distribution from limb radiance measurements. The primary NASA algorithm is based on earlier algorithms developed for the SOLSE/LORE and SAGE III limb scatter missions. All the existing retrieval algorithms rely on a spherical symmetry assumption for the atmosphere structure. While this assumption is reasonable in most of the stratosphere, it is no longer valid in regions of prime scientific interest, such as polar vortex and UTLS regions. The paper will describe a two-dimensional retrieval algorithm whereby the ozone distribution is simultaneously retrieved vertically and horizontally for a whole orbit. The retrieval code relies on (1) a forward 2D Radiative Transfer code (to model limb radiances within a non-uniform atmosphere and evaluate 2D analytical partial derivatives) and (2) an optimal estimator inversion routine. The algorithm uses the typically sparse nature of the kernel matrices as well as fast matrix inversion techniques to allow for fast inversion of limb data with efficient memory management (as was done for MIPAS data processing). While the method has so far only been developed in the context of Single Scatter, the paper will show how the CPU intensive Multiple Scatter modeling can be implemented using parallel CPU processing. Initial results will be presented in terms of retrieved ozone profiles and code performance.

Rault, Didier F.↗

NASA NTRS2004

Minimum-Time and Vibration Avoidance Attitude Maneuver for Spacecraft with Torque and Momentum Limit Constraints in Redundant Reaction Wheel Configuration

In this paper, we present an optimal open-loop slew trajectory algorithm developed at GSFC for the so-called "Yardstick design" of the James Webb Space Telescope (JWST). JWST is an orbiting infrared observatory featuring a lightweight, segmented primary mirror approximately 6 meters in diameter and a sunshield approximately the size of a tennis court. This large, flexible structure will have significant number of lightly damped, dominant flexible modes. With very stringent requirements on pointing accuracy and image quality, it is important that slewing be done within the required time constraint and with minimal induced vibration in order to maximize observing efficiency. With reaction wheels as control actuators, initial wheel speeds as well as individual wheel torque and momentum limits become dominant constraints in slew performance. These constraints must be taken into account when performing slews to ensure that unexpected reaction wheel saturation does not occur, since such saturation leads to control failure in accurately tracking commanded motion and produces high frequency torque components capable of exciting structural modes. A minimum-time constraint is also included and coupled with reaction wheel limit constraints in the optimization to minimize both the effect of the control torque on the flexible body motion and the maneuver time. The optimization is on slew command parameters, such as maximum slew velocity and acceleration, for a given redundant reaction wheel configuration and is based on the dynamic interaction between the spacecraft and reaction wheel motion. Analytical development of the slew algorithm to generate desired slew position, rate, and acceleration profiles to command a feedback/feed forward control system is described. High-fidelity simulation and experimental results are presented to show that the developed slew law achieves the objectives.

Ha, Kong Q.↗

NASA NTRS1989

An adaptive guidance law for single stage to low earth orbit

An adaptive guidance algorithm based on a cubic spline representation of the ascent profile and imposition of a dynamic pressure constraint is studied for a single stage to low earth orbit. The flight path is divided into initial and terminal phases. In the initial phase, fully adaptive, and in the terminal phase, semi-adaptive, guidance schemes are used. The cubic spline paqrameters are determined by gradient optimization for maximum payload to orbit. In the terminal phase, a linear quadratic regulator is used to derive the optimal feedback gains to keep the vehicle close to the nominal path. The computational aspects of the guidance algorithm are examined and criteria are developed to ensure stability and convergence.

Pamadi, Bandu N.↗

NASA NTRS2002

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗