Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution optimization”

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 1,009 records · Page 56

Cislunar Near Rectilinear Halo Orbit for Human Space Exploration

In order to conduct sustained human exploration beyond Low Earth Orbit (LEO), spacecraft systems are designed to operate in a series of missions of increasing complexity. Regardless of the destination, Moon, Mars, asteroids or beyond, there is a substantial set of common objectives that must be met. Many orbit characterization studies have endeavored to evaluate the potential locations in cislunar space that are favorable for meeting common human exploration objectives in a stepwise approach. Multiple studies, by both NASA and other international space agencies, have indicated that Earth-­‐moon libration point orbits are attractive candidates for staging operations in the proving ground and beyond. In particular, the Near Rectilinear Orbit (NRO) has been demonstrated to meet multi-­‐mission and multi-­‐destination architectural constraints. However, a human mission to a selected NRO presents a variety of new challenges for mission planning. While a growing number of robotic missions have completed successful operations to various specific libration point orbits, human missions have never been conducted to orbits of this class. Human missions have unique challenges that differ significantly from robotic missions, including a lower tolerance for mission risk and additional operational constraints that are associated only with human spacecraft. In addition, neither robotic nor human missions have been operated in the NRO regime specifically, and NROs exhibit dynamical characteristics that can differ significantly as compared to other halo orbits. Finally, multi-­‐body orbits, such as libration point orbits, are identified to exist in a simplified orbit model known as the Circular Restricted Three Body Problem (CRTBP) and must then be re-­‐solved in the full ephemeris model. As a result, the behavior of multi-­‐body orbits cannot be effectively characterized within the classical two-­‐body orbit dynamics framework more familiar to the human spaceflight community. In fact, a given NRO is not identified by a set of Keplerian orbit parameters, and a valid epoch specific state vector must be first obtained from a multi-body dynamical model. In this paper, the significant performance and operational challenges of conducting human missions to the NRO are evaluated. First, a systematic process for generating full ephemeris based ballistic NROs of various families is outlined to demonstrate the relative ease in which a multi-­‐revolution orbit can be found for any epoch and for various orbit geometries. In the Earth-­‐Moon system, NROs, which are halo orbits with close passage over a lunar pole, can exist with respect to libration point 1 (L1) or libration point 2 (L2) and are either from a North or South family orbit class with respect to the ecliptic. Second, the ability to maintain the orbit over the lifetime of a habitat mission by applying a reliable station-keeping strategy is investigated. The NRO, while similar to the quasi-­‐halo orbits that the Artemis mission flew, requires an updated station keeping strategy. This is due to several dynamical differences such as the increased relative stability of the NRO compared to other halo orbits and the close passage over the lunar surface as shown in Figure 1. Multiple station-keeping strategies are being investigated to ensure a human spacecraft remains on a predictable path. As the NRO is not described in simple two-­‐body parameters, analysis must determine the best strategy for targeting a reference NRO as well as how closely a future state should be constrained. In addition, costs will be minimized by determining maneuver directionality based on an identified pattern in the optimal station-keeping solutions or an analytically derived relationship. The candidate station-keeping algorithm must be stable and robust to environmental and vehicle uncertainties as well to navigation estimation and flight control execution errors. To that end, navigation accuracies, the impact on the station-keeping execution errors as well as other vehicle uncertainties need to be assessed. Starting with Orion, current navigation accuracies are evaluated and then navigation requirements are derived assuming a desired station-keeping propellant budget. Third, the performance requirements to and from the NRO are evaluated. Important parameters for developing expected propellant costs include epoch of operation, size and type of NRO, Earth departure and return constraints, as well as abort or early-­‐return capability. Finally, rendezvous and proximity operations are vital aspects of multi-­‐mission human exploration endeavors. The ability to conduct rendezvous and the associated propellant costs are assessed as well as the impacts of various profile assumptions including the location within the NRO the rendezvous is performed. The results of these studies will influence plans for international cooperation on both nearer term proving ground missions and beyond.

Whitley, Ryan↗

Multipurpose Rotating Rake Arrays for Integrated Inlet and Fan Stage Performance Measurement

Low-pressure-ratio fan stage performance measurement requires precise measurement of conditions upstream and downstream of the fan stage. This presentation will discuss the rotating rake arrays used for the recent Boundary Layer Ingesting Inlet-Distortion-Tolerant Fan experiment in the NASA Glenn 8 by 6 foot wind tunnel. To achieve precise measurements, simulations of the rake sampling from pre-test CFD (Computerized Fluid Dynamics) solutions were used to optimize the number and locations of rake instruments.

performanc↗

Evolution of Trajectory Design Requirement of NASA's Planned Europa Clipper Mission

Europa is one of the most scientifically intriguing targets in planetary science due to its potential suitability for extant life. As such, NASA has funded the California Institute of Technology Jet Propulsion Laboratory and the Johns Hopkins University Applied Physics Laboratory to jointly develop the planned Europa Clipper mission—a multiple Europa flyby mission architecture aimed to thoroughly investigate the habitability of Europa and provide reconnaissance data to determine a landing site that maximizes the probability of both a safe landing and high scientific value for a potential future Europa lander. The trajectory design—a major enabling component for this Europa Clipper mission concept—was developed to maximize science from a set of eight model payload instruments determined by a NASA-appointed Europa Science Definition Team (SDT) between 2011-2015. On May 26, 2015, NASA officially selected 10 instruments from 6 different U.S. research facilities and universities. With the selection of instruments have come the development of new science measurement requirements, as well as a rich set of requirements stemming from project policies, planetary protection, and the evolved capability and characteristics of the flight system and mission operations system. This paper will focus on the evolution of requirements levied on the trajectory design, discuss strategies and solutions to the multidimensional optimization problem of designing high fidelity end-to-end trajectories that maximize Europa science while mitigating mission risk, complexity and cost, and last, verification of candidate trajectories to meet the requirements on the trajectory design.

Buffington, Brent↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

Unsupervised Learning for Equitable DER Control: Preprint

In the context of managing distributed energy resources (DERs) within distribution networks (DNs), this work focuses on the task of developing local controllers. We propose an unsupervised learning framework to train functions that can closely approximate optimal power flow (OPF) solutions. The primary aim is to establish specific conditions under which these learned functions can collectively guide the network towards desired configurations asymptotically, leveraging an incremental control approach. The flexibility of the proposed methodology allows to integrate fairness-driven components into the cost function associated with the OPF problem. This addition seeks to mitigate power curtailment disparities among DERs, thereby promoting equitable power injections across the network. To demonstrate the effectiveness of the proposed approach, power flow simulations are conducted using the IEEE 37-bus feeder. The findings not only showcase the guaranteed system stability but also underscore its improved overall performance.

asymptotic stability↗

Solution of the minimum time-to-climb problem by matched asymptotic expansions

Application of singular perturbation techniques to trajectory optimization problems of flight mechanics is discussed. The method of matched asymptotic expansions is used to obtain an approximate solution to the aircraft minimum time-to-climb problem. Outer, boundary-layer, and composite solutions are obtained to zeroth and first orders. A stability criterion is derived for the zeroth-order boundary-layer solutions (the theory requires a form of boundary-layer stability). A numerical example is considered for which it is shown that the stability criterion is satisfied and a useful numerical solution is obtained. The zeroth-order solution proves to be a poor approximation, but the first-order solution gives a good approximation for both the trajectory and the minimum time-to-climb. The computational cost of the singular perturbation solution is considerably less than that of a steepest descent solution. Thus singular perturbation methods appear to be promising for the solution of optimal control problems.

Ardema, M. D.↗

Integrated System-Level Optimization for Concurrent Engineering With Parametric Subsystem Modeling

The introduction of concurrent design practices to the aerospace industry has greatly increased the productivity of engineers and teams during design sessions as demonstrated by JPL's Team X. Simultaneously, advances in computing power have given rise to a host of potent numerical optimization methods capable of solving complex multidisciplinary optimization problems containing hundreds of variables, constraints, and governing equations. Unfortunately, such methods are tedious to set up and require significant amounts of time and processor power to execute, thus making them unsuitable for rapid concurrent engineering use. This paper proposes a framework for Integration of System-Level Optimization with Concurrent Engineering (ISLOCE). It uses parametric neural-network approximations of the subsystem models. These approximations are then linked to a system-level optimizer that is capable of reaching a solution quickly due to the reduced complexity of the approximations. The integration structure is described in detail and applied to the multiobjective design of a simplified Space Shuttle external fuel tank model. Further, a comparison is made between the new framework and traditional concurrent engineering (without system optimization) through an experimental trial with two groups of engineers. Each method is evaluated in terms of optimizer accuracy, time to solution, and ease of use. The results suggest that system-level optimization, running as a background process during integrated concurrent engineering sessions, is potentially advantageous as long as it is judiciously implemented.

Schuman, Todd↗

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗

A Transformation Approach to Optimal Control Problems with Bounded State Variables

A technique is described and utilized in the study of the solutions to various general problems in optimal control theory, which are converted in to Lagrange problems in the calculus of variations. This is accomplished by mapping certain properties in Euclidean space onto closed control and state regions. Nonlinear control problems with a unit m cube as control region and unit n cube as state region are considered.

Hanafy, Lawrence Hanafy↗

Active vibration mitigation of distributed parameter, smart-type structures using Pseudo-Feedback Optimal Control (PFOC)

A new, near-optimal feedback control technique is introduced that is shown to provide excellent vibration attenuation for those distributed parameter systems that are often encountered in the areas of aeroservoelasticity and large space systems. The technique relies on a novel solution methodology for the classical optimal control problem. Specifically, the quadratic regulator control problem for a flexible vibrating structure is first cast in a weak functional form that admits an approximate solution. The necessary conditions (first-order) are then solved via a time finite-element method. The procedure produces a low dimensional, algebraic parameterization of the optimal control problem that provides a rigorous basis for a discrete controller with a first-order like hold output. Simulation has shown that the algorithm can successfully control a wide variety of plant forms including multi-input/multi-output systems and systems exhibiting significant nonlinearities. In order to firmly establish the efficacy of the algorithm, a laboratory control experiment was implemented to provide planar (bending) vibration attenuation of a highly flexible beam (with a first clamped-free mode of approximately 0.5 Hz).

Patten, W. N.↗

A method for determining optimum phasing of a multiphase propulsion system for a single-stage vehicle with linearized inert weight

A general analytical treatment is presented of a single-stage vehicle with multiple propulsion phases. A closed-form solution for the cost and for the performance and a derivation of the optimal phasing of the propulsion are included. Linearized variations in the inert weight elements are included, and the function to be minimized can be selected. The derivation of optimal phasing results in a set of nonlinear algebraic equations for optimal fuel volumes, for which a solution method is outlined. Three specific example cases are analyzed: minimum gross lift-off weight, minimum inert weight, and a minimized general function for a two-phase vehicle. The results for the two-phase vehicle are applied to the dual-fuel rocket. Comparisons with single-fuel vehicles indicate that dual-fuel vehicles can have lower inert weight either by development of a dual-fuel engine or by parallel burning of separate engines from lift-off.

Martin, J. A.↗

Observations on computational methodologies for use in large-scale, gradient-based, multidisciplinary design

Various computational methodologies relevant to large-scale multidisciplinary gradient-based optimization for engineering systems design problems are examined with emphasis on the situation where one or more discipline responses required by the optimized design procedure involve the solution of a system of nonlinear partial differential equations. Such situations occur when advanced CFD codes are applied in a multidisciplinary procedure for optimizing an aerospace vehicle design. A technique for satisfying the multidisciplinary design requirements for gradient information is presented. The technique is shown to permit some leeway in the CFD algorithms which can be used, an expansion to 3D problems, and straightforward use of other computational methodologies.

Newman, P. A.↗

Fuel optimal propulsive reboost of flexible spacecraft

The following paper is presented in viewgraph format and topics include: (1) exact solutions are difficult to obtain for higher order systems; (2) impulsive forces cannot be implemented directly; (3) exact solution provide the basis for judging the optimality of approximate techniques; and (4) properties of the exact solution can be used to develop improved approximations. Furthermore, the author discusses a floating harmonic oscillator whose model possesses rigid and flexible body motion characteristics of the proposed spacecraft.

Redmond, Jim↗

A reduced-dynamic technique for precise orbit determination

Observations of the Global Positioning System (GPS) will enable a reduced-dynamic technique for achieving subdecimeter orbit determination of earth-orbiting satellites. With this technique, information on the transition between satellite states at different observing times is furnished by both a formal dynamic model and observed satellite positional change (which is inferred kinematically from continuous GPS carrier-phase data). The relative weighting of dynamic and kinematic information can be freely varied. Covariance studies show that in situations where observing geometry is poor and the dynamic model is good, the model dominates determination of the state transition; where the dynamic model is poor and the geometry strong, carrier phase governs the determination of the transition. When neither kinematic nor dynamic information is clearly superior, the reduced-dynamic combination of the two can substantially improve the orbit-determination solution. Guidelines are given here for selecting a near-optimal weighting for the reduced-dynamic solution, and sensitivity of solution accuracy to this weighting is examined.

Wu, S. C.↗

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗

Parallel and vector computation for stochastic optimal control applications

A general method for parallel and vector numerical solutions of stochastic dynamic programming problems is described for optimal control of general nonlinear, continuous time, multibody dynamical systems, perturbed by Poisson as well as Gaussian random white noise. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random atmospheric fluctuations. The numerical formulation is highly suitable for a vector multiprocessor or vectorizing supercomputer, and results exhibit high processor efficiency and numerical stability. Advanced computing techniques, data structures, and hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations.

Hanson, F. B.↗

Data-Driven Recommendation of Optimal Tuning Scheme for Range-Separated Hybrid Functionals in Solution-Phase UV/Vis Absorption Energy Prediction

Time-dependent density functional theory (TDDFT) combined with range-separated hybrid (RSH) functionals and a tuned range-separation parameter γ offers a computationally economical approach for high-throughput excited- state property predictions. The γ-tuning procedure in the gas phase is well established. However, no agreement on the best γ- tuning procedure has been made when considering the solvent effect with implicit solvent models like the polarizable continuum model (PCM). To answer that question, this study created a diverse dataset with 937 molecules with experimental solutionphase UV/vis absorption spectra. Three γ-tuning methods, the gasphase γ-tuning (GPγT), the partial vertical γ-tuning (PVγT), and the strict vertical γ-tuning (SVγT), were evaluated for the ωPBEh functional over the entire dataset. Additional benchmarks are done for the optimally tuned screened range-separated hybrid combined with the PCM approach (SRSH-PCM) and the solvation-mediated tuning procedure (sol-med-OT). Our findings revealed that the optimal γ-values obtained by the PVγT and the SVγT are significantly smaller than the GPγT. This trend holds consistently across all molecules in our dataset, and we explained the origin of this phenomenon. TDDFT calculations with PVγTand SVγT-tuned γ-values and default global Fock exchange fraction achieve superior performance compared to those using GPγTtuned or default γ and slightly outperform SRSH-PCM and sol-med-OT with similar or lesser computational cost. Furthermore, we found that the smaller γ-values from SVγT captured the expected 1/(εR) asymptotic behavior in the solution phase, resulting in accurate prediction of solution-phase CT excitations, consistent with the screened asymptote behavior encoded in SRSH-PCM. These results show that SVγT is the best scheme for high-throughput UV/vis absorption spectrum calculations using the ωPBEh functional from a data-driven perspective.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗