Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Allocation”

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 235 records · Page 13

Six Degrees-of-Freedom Ascent Control for Small-Body Touch and Go

A document discusses a method of controlling touch and go (TAG) of a spacecraft to correct attitude, while ensuring a safe ascent. TAG is a concept whereby a spacecraft is in contact with the surface of a small body, such as a comet or asteroid, for a few seconds or less before ascending to a safe location away from the small body. The report describes a controller that corrects attitude and ensures that the spacecraft ascends to a safe state as quickly as possible. The approach allocates a certain amount of control authority to attitude control, and uses the rest to accelerate the spacecraft as quickly as possible in the ascent direction. The relative allocation to attitude and position is a parameter whose optimal value is determined using a ground software tool. This new approach makes use of the full control authority of the spacecraft to correct the errors imparted by the contact, and ascend as quickly as possible. This is in contrast to prior approaches, which do not optimize the ascent acceleration.

Blackmore, Lars James C.↗

Feasibility Study of a Multi Tilt-rotor Aircraft as the Artemis Lunar Training Vehicle

The Lunar Landing Research Vehicles (LLRVs) and the Lunar Landing Training Vehicles (LLTVs) provided astronaut candidates for the Apollo program with essential experience and confidence required to complete the missions, and contributed to six successful manned landings on the moon. The primary challenge in terrestrial training was being able to replicate the ratio of bank angle to linear acceleration that a pilot would experience in lunar gravity. Presently, as the Artemis program seeks to return humans to the Moon by 2025, engineers are evaluating suitable platforms to serve as an In-Flight Trainer (IFT) or Artemis Lunar Training Vehicle (ALTV) for astronauts training in the task of manual landing. The program is investigating the viability of current technology in the field of electric vertical takeoff and landing (eVTOL) vehicles and is evaluating using a multi tilt-rotor aircraft platform as a candidate platform for a preliminary ALTV. The tilt-rotor capability enables the vehicle attitude to be decoupled from its flight path, which is a crucial requirement in realistically simulating lunar gravity on Earth. Other key considerations include compensating for a lack of aerodynamic forces while flying through the atmosphere of Earth, as well as the ability to simulate the dynamics of multiple different lander designs for the Human Landing System (HLS) program. This paper details the feasibility study and presents a preliminary flight control architecture for an IFT based on a notional multi tilt-rotor platform. The modeling-following control law, based on nonlinear dynamic inversion (NDI), removes the need for gain scheduling because the vehicle operates across a wide range of flight conditions. The inner-loop dynamic control allocation strategy consists of a static portion that is optimized offline for trim while compensating for the difference in gravity and a dynamic portion that is computed in real time. The reference model consists of the full closed-loop dynamics of a generic HLS design. The modularity of the flight control architecture enables evaluation of multiple HLS concepts with minimal modifications to the control law. Simulation results of the multi tilt-rotor configuration following the final portion of the Apollo 11 descent trajectory are shown.

Jing Pei↗

Feasibility Study of a Multi-Tilt-Rotor Aircraft as the Artemis Lunar Training Vehicle

The Lunar Landing Research Vehicles (LLRVs) and the Lunar Landing Training Vehicles (LLTVs) provided astronauts of the Apollo program with essential experience and confidence required to complete the missions, and contributed to six successful manned landings on the moon. The primary challenge in terrestrial training was being able to replicate the ratio of tilt angle to linear acceleration that a pilot would experience in lunar gravity. Presently, as the Artemis program seeks to return humans to the Moon by 2025, engineers are evaluating suitable platforms to serve as an In-Flight Trainer (IFT) or Artemis Lunar Training Vehicle (ALTV) for astronauts training in the task of manual landing. The program is investigating the viability of current technology in the field of electric vertical takeoff and landing (eVTOL) vehicles and is evaluating using a multi-tilt-rotor aircraft platform as a candidate for a preliminary ALTV. The tilt-rotor capability enables the vehicle attitude to be decoupled from its flight path, which is a crucial requirement in realistically simulating lunar gravity on Earth. Other key considerations include compensating for a lack of aerodynamic forces while flying through the atmosphere of Earth, as well as the ability to simulate the dynamics of multiple different lander designs for the Human Landing System (HLS) program. This paper details the feasibility study and presents a preliminary flight control architecture for an IFT based on a notional multi-tilt-rotor platform. The model-following control law, based on nonlinear dynamic inversion (NDI), removes the need for gain scheduling. The inner-loop dynamic control allocation strategy consists of a static portion that is optimized offline for trim while compensating for the difference in gravity and a dynamic portion that is computed in real time. The reference model consists of the full closed-loop dynamics of a generic HLS design. The modularity of the flight control architecture enables evaluation of multiple HLS concepts with minimal modifications to the control law. Simulation results of the multi-tilt-rotor configuration following the final portion of the Apollo 11 descent trajectory are shown.

Jing Pei↗

Optimizing High-Throughput Inference on Graph Neural Networks at Shared Computing Facilities with the NVIDIA Triton Inference Server

Abstract With machine learning applications now spanning a variety of computational tasks, multi-user shared computing facilities are devoting a rapidly increasing proportion of their resources to such algorithms. Graph neural networks (GNNs), for example, have provided astounding improvements in extracting complex signatures from data and are now widely used in a variety of applications, such as particle jet classification in high energy physics (HEP). However, GNNs also come with an enormous computational penalty that requires the use of GPUs to maintain reasonable throughput. At shared computing facilities, such as those used by physicists at Fermi National Accelerator Laboratory (Fermilab), methodical resource allocation and high throughput at the many-user scale are key to ensuring that resources are being used as efficiently as possible. These facilities, however, primarily provide CPU-only nodes, which proves detrimental to time-to-insight and computational throughput for workflows that include machine learning inference. In this work, we describe how a shared computing facility can use the NVIDIA Triton Inference Server to optimize its resource allocation and computing structure, recovering high throughput while scaling out to multiple users by massively parallelizing their machine learning inference. To demonstrate the effectiveness of this system in a realistic multi-user environment, we use the Fermilab Elastic Analysis Facility augmented with the Triton Inference Server to provide scalable and high-throughput access to a HEP-specific GNN and report on the outcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Two Reconfigurable Flight-Control Design Methods: Robust Servomechanism and Control Allocation

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the fight body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Utility-Scale Shared Energy Storage Deployment: Challenges, Research Gaps, and Opportunities

Although community energy storage (CES) and behind-the-meter (BTM) energy storage systems have been widely used to offer homeowners and communities a variety of localized benefits, their scalability and grid support functionalities are limited. On the other hand, utility-scale shared energy storage (USES) systems may offer a number of benefits for grid integration, scalability, and economic viability. When compared to BTM and CES alternatives, these large-scale systems provide more storage capacity, more efficient operations, and more economically viable options. The deployment of USES presents opportunities for optimizing grid performance, integrating renewable energy resources, and improving energy security at the community level. However, significant research gaps exist in optimizing the integration and operation of these systems, especially to allocate energy for consumer use, grid services, and enhancing energy resilience. This paper reviews the literature in this regard, focusing on the opportunities, research gaps, and challenges associated with USES deployment. Firstly, the paper provides an overview of USES systems and emphasizes their benefits. Secondly, the key challenges are identified, and research gaps associated with the operation and integration of these systems are highlighted. Lastly, some potential solutions and opportunities that can be adopted to facilitate the rapid deployment and management of USES are presented. Technological, economic, regulatory, and environmental aspects are also discussed in this paper, providing an overview of the current state and future prospects of this technology.

Gautam, Mukesh [BATTELLE (PACIFIC NW LAB)] (ORCID:↗

arco (Assembled Resource-Constrained Optimization) [SWR-26-030]

Arco (Assembled Resource-Constrained Optimization) is a memory-smart optimization DSL and solver for LP and MIP problems on constrained hardware. The software is an optimization framework built around a KDL-based domain-specific language and a CLI compiler/solver. You write optimization models in .kdl files, and the arco CLI compiles, validates, inspects, and solves them. Language bindings (Python today, more planned) provide programmatic access to the same engine. Built for harder optimization problems on constrained resources, Arco is intentional about every allocation, careful with stack and heap behavior, and relentless about minimizing memory usage so more systems can run real workloads. Arco is built primarily for internal use within our organization. You are welcome to try it, but we make no guarantees about API stability or robustness at this stage

Sanchez Perez, Pedro Andres [National Laboratory o↗

Outstanding Research Issues in Systematic Technology Prioritization for New Space Missions: Workshop Proceedings

A workshop entitled, "Outstanding Research Issues in Systematic Technology Prioritization for New Space Missions," was convened on April 21-22, 2004 in San Diego, California to review the status of methods for objective resource allocation, to discuss the research barriers remaining, and to formulate recommendations for future development and application. The workshop explored the state-of-the-art in decision analysis in the context of being able to objectively allocate constrained technical resources to enable future space missions and optimize science return. This article summarizes the highlights of the meeting results.

Weisbin, C. R.↗

Optimizing Management of Persistent Data Structures in High-Performance Analytics

Large-scale data analytics workflows ingest massive input data into various data structures, including graphs and key-value datastores. These data structures undergo multiple transformations and computations and are typically reused in incremental and iterative analytics workflows. Persisting in-memory views of these data structures enables reusing them beyond the scope of a single program run while avoiding repetitive raw data ingestion overheads. Memory-mapped I/O enables persisting in-memory data structures without data serialization and deserialization overheads. However, memory-mapped I/O lacks the key feature of persisting consistent snapshots of these data structures for incremental ingestion and processing. The obstacles to efficient virtual memory snapshots using memory-mapped I/O include background writebacks outside the application’s control, and the significantly high storage footprint of such snapshots. To address these limitations, we present Privateer, a memory and storage management tool that enables storage-efficient virtual memory snapshotting while also optimizing snapshot I/O performance. Here, we integrated Privateer into Metall, a state-of-the-art persistent memory allocator for C++, and the Lightning Memory-Mapped Database (LMDB), a widely-used key-value datastore in data analytics and machine learning. Privateer optimized application performance by 1.22× when storing data structure snapshots to node-local storage, and up to 16.7× when storing snapshots to a parallel file system. Privateer also optimizes storage efficiency of incremental data structure snapshots by up to 11× using data deduplication and compression.

Computer science↗

Game-Theoretic Modeling of Vegetation Composition, Structure, and Dynamics: Physical Constraints, Fundamental Processes, and Emergent Properties

Vegetation structural and compositional dynamics emerge from plant physiological and demographic processes, individual-based competition, vegetation-soil feedbacks, and environmental variations and disturbance events. Predicting long-term changes in vegetation requires scaling plant individual behavior to large scale ecosystem processes. In this presentation, we summarize our studies in the modeling of vegetation demographic processes, competitively dominant plant traits, plant hydraulic processes, and stochastic disturbance effects on ecosystems, and illustrate the roles of the underlying ecological processes and eco-evolutionary optimization in vegetation modeling. With the case studies of evolutionarily stable strategy of allocation, leaf traits, and plant hydraulic processes, we show how the ecosystem processes and vegetation dynamics are determined by the individual-based plant competition and variations of soil and climate conditions. The predictions of ecosystem carbon dynamics can be greatly different with those from the traditional “single-tree” models. We also discuss the tradeoffs of plant traits and evolutionarily optimal strategies in the modeling of terrestrial ecosystem dynamics in an Earth system model.

vegetation models↗

HPC Resource Allocation Under Energy Constraints

We discuss the new problem faced by High-Performance Computing (HPC) facilities in allocating resources to users of their facilities: while facilities once allocated a single finite resource—node-hours—now facilities must also concurrently allocate a second scarce resource: electrical energy, which is bounded within each facility's annual operations budget. Current application optimization practices encourage conservation of the first resource, but can be potentially unaffordably wasteful of the second. We describe a framework for reasoning about such allocations that can be utilized by facilities to articulate policy, while encouraging scientific application developers to write code mindfully of both constraints. We outline the requirements on facilities, on developers, and on hardware vendors and integrators that are necessary to enable the implementation of this framework.

97 MATHEMATICS AND COMPUTING↗

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗

Geometry Optimization of Cable-Based Actuation for Small-Scale Model Testing of a Floating Marine Turbine: Preprint

This research aims to apply combined wave and tidal current loads to a small-scale floating marine current turbine in a wave tank, where an actuation system applies hydrodynamic and mooring forces on the hardware based on results from a simulation. We use a real-time hybrid test setup with physical wave forcing from the wave tank and simulated current and mooring forces implemented through a tensioned cable array. For this paper, we developed an optimization algorithm that adjusts the hardware geometry of the cable array to achieve more efficient tension allocation across the cables for the loads that need to be actuated. By adjusting the points where the cables are attached to the floating platform and the angles between the platform and the winches, an optimal cable geometry can be found to minimize tension variations in the lines, maintain the desired pretension, and prevent excessive tensions. We present the optimization problem formulation, the actuation system evaluation approach, and optimization results that show effective cable actuation setups that are being considered for implementation in the wave tank tests.

cable-based actuation↗

LandScan mosaic enables high-resolution gridded population estimates with explicit uncertainty

Gridded population datasets represent high-resolution distributions of human occupancy, enabling informed decision-making across a broad range of fields. These data products are valuable for assessing environmental risk, urban development, disaster preparedness and resource allocation—areas where accurate population estimates directly enhance policy effectiveness and optimize resource distribution. Despite the importance of gridded population datasets, traditional population modeling approaches often overlook inherent uncertainties in the estimation process. This limitation can create a false sense of certainty in population estimates, potentially leading to flawed decisions by those who rely on the data. To address this methodological gap, we introduce a probabilistic machine learning modeling framework, LandScan Mosaic, that explicitly incorporates uncertainty into the population modeling process. Our approach systematically quantifies uncertainty in three key modeling parameters of the LandScan HD gridded population dataset: building use types, floor counts, and occupancy rates. By employing Monte Carlo simulations, we propagate these uncertainties through the modeling process, yielding probability distributions of population counts in place of deterministic point estimates. We demonstrate the practical application of this framework in Iloilo City, Philippines, using structured decision-making techniques and our probabilistic estimates to identify and prioritize areas most affected by projected flooding, supporting targeted interventions that address both economic and social risks. In doing so, we propose a population-specific approach for incorporating confidence into structured decision making processes. Through a comparative analysis with conventional deterministic approaches and point estimate approaches, including LandScan HD and WorldPop, we evaluate how the incorporation of machine learning and uncertainty influences decision rankings. This research advances population distribution modeling by offering a robust, quantitative approach that explicitly accounts for uncertainty in the underlying data, along with guidance for how users can apply uncertainty in their decision-making.

Environmental sciences↗

Information efficiency in visual communication

This paper evaluates the quantization process in the context of the end-to-end performance of the visual-communication channel. Results show that the trade-off between data transmission and visual quality revolves around the information in the acquired signal, not around its energy. Improved information efficiency is gained by frequency dependent quantization that maintains the information capacity of the channel and reduces the entropy of the encoded signal. Restorations with energy bit-allocation lose both in sharpness and clarity relative to restorations with information bit-allocation. Thus, quantization with information bit-allocation is preferred for high information efficiency and visual quality in optimized visual communication.

Alter-Gartenberg, Rachel↗

Multi Model Monte Carlo with Python (MXMCPy)

Multi Model Monte Carlo with Python (\mxmc {}) is a software package developed as a general capability for computing the statistics of outputs from an expensive, high-fidelity model by leveraging faster, low-fidelity models for speedup. Motivated by uncertainty propagation problems where classical Monte Carlo (MC) simulation is computationally intractable, various multi-model MC approaches have recently emerged that yield unbiased estimators with significantly reduced variance relative to MC for the same cost. These existing methods include multi-level Monte Carlo (MLMC), multi-fidelity Monte Carlo (MFMC), and approximate control variates (ACV). Given a fixed computational budget and a collection of models with varying cost/accuracy, each method seeks a sample allocation strategy across the models that results in an estimator with optimal variance reduction. \mxmc {} is a versatile tool that enables convenient access to many existing multi-model MC approaches within one modular and extensible package. With \mxmc {}, users can easily compare existing methods to determine the best choice for their particular problem, while developers have a basis for implementing and sharing new variance reduction approaches. This report introduces the \mxmc {} software, providing a summary of the problem-solving workflow for users as well as a brief overview of the code layout for developers.

Geoffrey F Bomarito↗