Search NASA⌕ Search

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.

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

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

An investigation of quasi-inertial attitude control for a solar power satellite

An efficient means, a quasi-inertial attitude mode, is developed for maintaining the normal solar orientation of a space satellite for power collection in a synchronous orbit. Formulae are presented which establish the basic parametric properties for ideal quasi-inertial attitude and phasing. An active control system is necessary to compensate for the energy loss since energy dissipation in widely oscillating flexible bodies produces an instability of the quasi-inertial attitude in the sense that the spacecraft will tumble at the orbit rate. A fixed terminal time and state optimal control problem is formulated and an algorithm for determining the optimal control as a means for the periodical attitude and phase compensation is developed. The vehicle orientation affected by internal disturbance (structural flexibility) and external disturbances (e.g., drag forces) is maintained by a specialized controller design.

Juang, J.-N.↗
NASA NTRS1994

Evaluation of sensor placement algorithms for on-orbit identification of space platforms

Anticipating the construction of the international space station, on-orbit modal identification of space platforms through optimally placed accelerometers is an area of recent activity. Unwanted vibrations in the platform could affect the results of experiments which are planned. Therefore, it is important that sensors (accelerometers) be strategically placed to identify the amount and extent of these unwanted vibrations, and to validate the mathematical models used to predict the loads and dynamic response. Due to cost, installation, and data management issues, only a limited number of sensors will be available for placement. This work evaluates and compares four representative sensor placement algorithms for modal identification. Most of the sensor placement work to date has employed only numerical simulations for comparison. This work uses experimental data from a fully-instrumented truss structure which was one of a series of structures designed for research in dynamic scale model ground testing of large space structures at NASA Langley Research Center. Results from this comparison show that for this cantilevered structure, the algorithm based on Guyan reduction is rated slightly better than that based on Effective Independence.

Glassburn, Robin S.↗
NASA NTRS1995

Abort performance for a winged-body single-stage to orbit vehicle

Optimal control theory is employed to determine the performance of abort to orbit (ATO) and return to launch site (RTLS) maneuvers for a single-stage to orbit vehicle. The vehicle configuration examined is a seven engine, winged-body vehicle, that lifts-off vertically and lands horizontally. The abort maneuvers occur as the vehicle ascends to orbit and are initiated when the vehicle suffers an engine failure. The optimal control problems are numerically solved in discretized form via a nonlinear programming (NLP) algorithm. A description highlighting the attributes of this NLP method is provided. ATO maneuver results show that the vehicle is capable of ascending to orbit with a single engine failure at lift-off. Two engine out ATO maneuvers are not possible from the launch pad, but are possible after launch when the thrust to weight ratio becomes sufficiently large. Results show that single engine out RTLS maneuvers can be made for up to 180 seconds after lift-off and that there are scenarios for which RTLS maneuvers should be performed instead of ATP maneuvers.

Lyon, Jeffery A.↗
NASA NTRS1994

Removing cosmic-ray hits from multiorbit HST Wide Field Camera images

We present an optimized algorithm that removes cosmic rays ('CRs') from multiorbit Hubble Space Telescope (HST) Wide Field/Planetary Camera ('WF/PC') images. It computes the image noise in every iteration from the WF/PC CCD equation. This includes all known sources of random and systematic calibration errors. We test this algorithm on WF/PC stacks of 2-12 orbits as a function of the number of available orbits and the formal Poissonian sigma-clipping level. We find that the algorithm needs greater than or equal 4 WF/PC exposures to locate the minimal sky signal (which is noticeably affected by CRs), with an optimal clipping level at 2-2.5 x sigma(sub Poisson). We analyze the CR flux detected on multiorbit 'CR stacks,' which are constructed by subtracting the best CR filtered images from the unfiltered 8-12 orbit average. We use an automated object finder to determine the surface density of CRS as a function of the apparent magnitude (or ADU flux) they would have generated in the images had they not been removed. The power law slope of the CR 'counts' (gamma approximately = 0.6 for N(m) m(exp gamma)) is steeper than that of the faint galaxy counts down to V approximately = 28 mag. The CR counts show a drop off between 28 less than or approximately V less than or approximately 30 mag (the latter is our formal 2 sigma point source sensitivity without spherical aberration). This prevents the CR sky integral from diverging, and is likely due to a real cutoff in the CR energy distribution below approximately 11 ADU per orbit. The integral CR surface density is less than or approximately 10(exp 8)/sq. deg, and their sky signal is V approximately = 25.5-27.0 mag/sq. arcsec, or 3%-13% of our NEP sky background (V = 23.3 mag/sq. arcsec), and well above the EBL integral of the deepest galaxy counts (B(sub J) approximately = 28.0 mag/sq. arcsec). We conclude that faint CRs will always contribute to the sky signal in the deepest WF/PC images. Since WFPC2 has approximately 2.7x lower read noise and a thicker CCD, this will result in more CR detections than in WF/PC, potentially affecting approximately 10%-20% of the pixels in multiorbit WFPC2 data cubes.

Windhorst, Rogier A.↗
NASA NTRS2017

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗
NASA NTRS1992

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗
NASA NTRS2018

A Comprehensive Model of Earth's Magnetic Field Determined from 4 Years of Swarm Satellite Observations

The European Space Agency's three-satellite constellation Swarm, launched in November 2013, has provided unprecedented monitoring of Earth's magnetic field via a unique set of gradiometric and multi-satellite measurements from low Earth orbit. In order to exploit these measurements, an advanced "Comprehensive Inversion" (CI) algorithm has been developed to optimally separate the various major magnetic field sources in the near-Earth regime. The CI algorithm is used to determine Swarm Level-2 (L2) magnetic field data products that include the core, lithospheric, ionospheric, magnetospheric, and associated induced sources. In addition, it has become apparent that the CI is capable of extracting the magnetic signal associated with the oceanic principal lunar semi-diurnal tidal constituent M(sub 2) to such an extent that it has been added to the L2 data product line. This paper presents the parent model of the Swarm L2 CI products derived with measurements from the first four years of the Swarm mission and from ground observatories, denoted as "CIY4", including the new product describing the magnetic signal of the M(sub 2) oceanic tide.

Swarm Satellites↗
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↗
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 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↗