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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2021

Assessing Relay Communications for Mars Sample Return Surface Mission Concepts

The Mars Sample Return (MSR) Campaign would be a 3-mission campaign concept supported by NASA and ESA to return samples from the Mars surface. MSR would, for the first time ever, present a need to communicate with multiple surface assets that are co-located on Mars in a coordinated effort to accomplish the unified objective of fetching, transporting, and returning samples from Mars. Currently, Mars surface assets relay data to and from Earth using a number of orbiters in what’s known as the Mars Relay Network (MRN). This network is characterized by a small number of surface assets distributed across the Martian globe and a larger number of orbiters to provide relay services. As of June 2020, there are two surface assets for which five orbiters are providing relay. During the MSR Campaign, there would be two rovers and a lander that all would require relay communication from a small number of Mars orbiters to meet the aggressive MSR timeline. The inversion of the current MRN paradigm, a system of many surface assets requiring relay and few orbiters to provide relay, necessitates the unique challenge of optimally allocating relay passes to maximize the operational capability of all assets. The allocation must consider a large number of trade variables including Mars asset operational requirements and Earth ground system constraints, including staffing schedules, operations planning across time zones, and more. To address these telecommunication challenges, the Mars Asset Relay Mission Link Allocation Design Environment (MARMLADE) tool was developed. It is a MATLAB-based tool to assign orbiter passes or Direct-From-Earth (DFE) links to each of the three surface assets and quantify the operational efficiency of each surface asset.MARMLADE uses a data set of simulated Mars relay orbiter geometry and telecommunication capabilities provided by JPL’s Telecom Orbit Analysis and Simulation Tool (TOAST) software to compute which asset should get each pass based on a series of heuristics and predictions of all assets’ states. Within MARMLADE, the user can provide inputs including the option for time-based pass splitting, fixed FWD data rate capabilities, DFE communication capabilities, and link parameters allowing for the assessment of complex operations and hardware trades using surface mission operational efficiency as a primary figure of merit. As the MSR mission concepts continue to mature, MARMLADE is being used to assess ability of all MSR elements to meet the surface mission timeline requirements and to provide relay link allocations to each of the MSR surface assets.This paper will describe the motivation and design of the MARMLADE tool and how it is being used to perform campaign and mission level trades, generate requirements, and support development of the MSR surface mission scenarios.

Lee, Charles↗
NASA NTRS2021

Assessing Relay Communications for Mars Sample Return Surface Mission Concepts

The Mars Sample Return (MSR) Campaign is a 3-mission campaign concept supported by NASA and ESA to return samples from the Mars surface. MSR will, for the firsttime ever, present a need to communicate with multiple surfaceassets that are co-located on Mars in a coordinated effort toaccomplish the unified objective of fetching, transporting, andreturning samples from Mars. Currently, Mars surface assetsrelay data to and from Earth using a number of orbiters inwhat’s known as the Mars Relay Network (MRN). This networkis characterized by a small number of surface assets distributedacross the Martian globe and a larger number of orbiters toprovide relay services. As of June 2020, there are two surfaceassets for which five orbiters are providing relay. During theMSR Campaign, there will be two rovers and a lander that allwill require relay communication from a small number of Marsorbiters to meet the aggressive MSR timeline. The inversion ofthe current MRN paradigm, a system of many surface assetsrequiring relay and few orbiters to provide relay, necessitatesthe unique challenge of optimally allocating relay passes tomaximize the operational capability of all assets. The allocationmust consider a large number of trade variables includingMars asset operational requirements and Earth ground systemconstraints, including staffing schedules, operations planningacross time zones, and more. To address these telecommunicationchallenges, the Mars Asset Relay Mission Link AllocationDesign Environment (MARMLADE) tool was developed. Itis a MATLAB-based tool to assign orbiter passes or Direct-From-Earth (DFE) links to each of the three surface assets andquantify the operational efficiency of each surface asset.MARMLADE uses a data set of simulated Mars relay orbitergeometry and telecommunication capabilities provided by JPL’sTelecom Orbit Analysis and Simulation Tool (TOAST) softwareto compute which asset should get each pass based on a seriesof heuristics and predictions of all assets’ states. WithinMARMLADE, the user can provide inputs including the optionfor time-based pass splitting, fixed FWD data rate capabilities,DFE communication capabilities, and link parameters allowingfor the assessment of complex operations and hardware tradesusing surface mission operational efficiency as a primary figureof merit. As the MSR mission concepts continue to mature,MARMLADE is being used to assess ability of all MSR elementsto meet the surface mission timeline requirements and to provide relay link allocations to each of the MSR surface assets.

Lee, Charles↗
NASA NTRSDate not supplied

Humans to Mars, but How Many? Using Training Requirements Modeling to Inform Crew Size

Missions to Mars will differ from previous human spaceflight missions in that the onboard crew of astronauts will be required to operate in an Earth-independent manner due to the long communication delays. Without a systematic, repeatable process to determine the number and composition of crew necessary to successfully accomplish these missions, NASA increases the risk that crew sizes may be too small to meet primary mission objectives under nominal conditions and, more consequentially, that crewmembers may not have the expertise needed to successfully respond to unforeseen failures without the real-time expertise of the Mission Control Central (MCC) team NASA currently relies upon. The NASA Engineering and Safety Center (NESC) is developing a methodology for assessing the trade space of factors that affect the number of crew for future missions. This methodology includes the consideration of results from three human performance models developed using the Improved Performance Research and Integration Tool (IMPRINT) modeling platform as well as a custom-built model on expertise trained within the crew. The IMPRINT results will be presented in the modeling and simulation sub-tag. Here we present results of a model based on NASA’s crew qualification and responsibility matrix (CQRM), a tool used to identify the crew qualifications for each area of responsibility (operation, system, and payload) for a mission. The model outputs an optimized allocation of training assignments along with a flight-assigned CQRM that can be used to consider the expertise that can be trained within a crew of a given size. We discuss the CQRM model result implications on the trade space for Mars mission crew size.

Mars↗
NASA NTRSDate not supplied

Humans to Mars, but How Many? Using Training Requirements Modeling to Inform Crew Size

Missions to Mars will differ from previous human spaceflight missions in that the onboard crew of astronauts will be required to operate in an Earth-independent manner due to the long communication delays. Without a systematic, repeatable process to determine the number and composition of crew necessary to successfully accomplish these missions, NASA increases the risk that crew sizes may be too small to meet primary mission objectives under nominal conditions and, more consequentially, that crewmembers may not have the expertise needed to successfully respond to unforeseen failures without the real-time expertise of the Mission Control Central (MCC) team NASA currently relies upon. The NASA Engineering and Safety Center (NESC) is developing a methodology for assessing the trade space of factors that affect the number of crew for future missions. This methodology includes the consideration of results from three human performance models developed using the Improved Performance Research and Integration Tool (IMPRINT) modeling platform as well as a custom-built model on expertise trained within the crew. The IMPRINT results will be presented in the modeling and simulation sub-tag. Here we present results of a model based on NASA’s crew qualification and responsibility matrix (CQRM), a tool used to identify the crew qualifications for each area of responsibility (operation, system, and payload) for a mission. The model outputs an optimized allocation of training assignments along with a flight-assigned CQRM that can be used to consider the expertise that can be trained within a crew of a given size. We discuss the CQRM model result implications on the trade space for Mars mission crew size.

Mars↗
NASA NTRS2024

Georgia’s Potentials for Sustainable Intensification, Increasing Food Security and Rural Incomes

Increasing global demand for agricultural commodities spurs conversions of natural ecosystems. Sustainable intensification in areas of high yield gaps can contribute to reducing the impact of commodity production, while also supporting development, food security, and livelihoods. Following the dissolution of the Union of Soviet Socialist Republics (USSR), Georgia experienced one the highest losses of agricultural productivity among all former USSR countries and is now highly dependent on food imports. Closing yield gaps in Georgia through sustainable intensification has the potential to increase food self-sufficiency, support rural livelihoods, and strengthen food security and sovereignty. We estimated it’s potential for sustainable intensification on current agricultural areas to achieve self-sufficiency for wheat, maize, and barley. We found that crop yields can be doubled to tripled under high input production systems, using high-yielding varieties, optimized inputs, fertilizers, and pest control. Yet, self-sufficiency in wheat can only be reached if at least 60-80% of the potentially attainable yields are achieved and if land is optimally allocated between crops. To achieve such increases, farmers need access to and training for using different crop varieties, fertilizers, and pest and disease control practices and products. Intensification increases the risks to ecosystem services health and livelihoods, particularly raising equity concern. Yet, intensifying very low input systems is often found to be more sustainable, with high yield increases compared to limited impacts on the environment. The high employment in the agricultural sector in Georgia particularly provides opportunities to reduce poverty and increase livelihoods through increasing incomes and food security.

Florian Gollnow↗
NASA NTRS2008

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correc tly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this corre ct selection probability, we derive an asymptotically optimal allocat ion and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocatio ns are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedur e has the potential to enhance computational efficiency for simulation optimization.

Chen, Chun-Hung↗
NASA NTRSDate not supplied

Modified Cascading Generalized Inverse Control Allocation

The current aviation revolution towards electric propulsion aircraft (e.g., electric vertical takeoff-and-landing) brings unique control challenges. These vehicles are typically over-actuated (more effectors than desired control outcomes), may require control strategies for the three phases of flight (hover, transition and cruise), and currently have limited electric power availability. These vehicle challenges bring the need for optimal control allocation to the forefront of research. A leading control allocation algorithm, used in current flight vehicles, is the Cascading Generalized Inverse (CGI). Unfortunately, the Cascading Generalized Inverse algorithm is unable to achieve some desired outcomes, it intermittently provides non-optimal allocations, and it may fail to preserve moment direction near maximal achievable outcomes. In this research, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Rigorous theory is shown that the Modified Cascading Generalized Inverse performs better at obtaining optimal allocations for all attainable outcomes. Numerical case studies for over-actuated vehicles demonstrate resolution to the aforementioned deficiencies.

Control Allocation↗
NASA NTRSDate not supplied

Modified Cascading Generalized Inverse Control Allocation

The current aviation revolution towards electric propulsion aircraft (e.g., electric vertical takeoff-and-landing) brings unique control challenges. These vehicles are typically over-actuated (more effectors than desired control outcomes), may require control strategies for the three phases of flight (hover, transition and cruise), and currently have limited electric power availability. These vehicle challenges bring the need for optimal control allocation to the forefront of research. A leading control allocation algorithm, used in current flight vehicles, is the Cascading Generalized Inverse (CGI). Unfortunately, the Cascading Generalized Inverse algorithm is unable to achieve some desired outcomes, it intermittently provides non-optimal allocations, and it may fail to preserve moment direction near maximal achievable outcomes. In this research, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Rigorous theory is shown that the Modified Cascading Generalized Inverse performs better at obtaining optimal allocations for all attainable outcomes. Numerical case studies for over-actuated vehicles demonstrate resolution to the aforementioned deficiencies.

Control Allocation↗
NASA NTRS2021

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Multi-robot systems are uniquely well-suited to perform complex tasks such as patrolling and tracking, infor- mation gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is dynamic task allocation: assigning robots to tasks (e.g., patrolling an area, or servicing a transportation request) as they appear based on the robots’ states to maximize reward. In many practical situations, the allocation must account for potentially heteroge- neous capabilities (e.g., availability of appropriate sensors or actuators) to ensure the feasibility of execution, and exploit predictive information concerning the likelihood of future tasks to promote a higher reward over a long time horizon. To this end, we present an efficient algorithm for predictive heterogeneous task- allocation achieving an approximation factor of at least 1/2 of the optimal reward. Our approach demonstrates that the problem can be decomposed into several homogeneous subproblems that can be solved efficiently using min-cost flow. Through simulation experiments, we show that our algorithm is faster by several orders of magnitude than a MILP-based approach.

Pavone, Marco↗
NASA NTRS1992

Optimal routing and buffer allocation for a class of finite capacity queueing systems

The problem of routing jobs to K parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Routing decisions are taken by a controller which has buffering space available to it and may delay routing of a customer to a queue. Using ideas from weak majorization, it is shown that the shorter nonfull queue delayed (SNQD) policy minimizes both the total number of customers in the system at any time and the number of customers that are rejected by that time. The SNQD policy always delays routing decisions as long as all servers are busy. Only when all the buffers at the controller are occupied is a customer routed to the queue with the shortest queue length that is not at capacity. Moreover, it is shown that, if a fixed number of buffers is to be distributed among the K queues, then the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
DOE OSTI2025

Efficient frequency allocation for superconducting quantum processors using improved optimization techniques

Building on previous research on frequency allocation optimization for superconducting circuit quantum processors, this work incorporates several techniques to improve overall solution quality. Here, we introduce constraints and imposed edgewise differences help to improve the optimization results. We also introduce optimization variables for the orientation of each edge, defined as the direction from the control qubit to the target qubit, to be chosen during optimization. To scale up to larger processors, multimodule designs are employed with various boundary conditions, thereby enhancing the collective yield. These enhancements allow for greater flexibility in processor design by eliminating the need for handpicked orientations. We support the efficient assembly of large processors with dense connectivity by choosing the best boundary conditions. Examples demonstrate that, at low computational cost, this optimization approach finds a frequency configuration for a square chip with over 1000 qubits and over 10% yield at much larger dispersion levels than required by previous approaches.

Zhang, Zewen [Argonne National Laboratory (ANL), A↗
NASA NTRS2016

Applicability and Limitations of Reliability Allocation Methods

Reliability allocation process may be described as the process of assigning reliability requirements to individual components within a system to attain the specified system reliability. For large systems, the allocation process is often performed at different stages of system design. The allocation process often begins at the conceptual stage. As the system design develops, more information about components and the operating environment becomes available, different allocation methods can be considered. Reliability allocation methods are usually divided into two categories: weighting factors and optimal reliability allocation. When properly applied, these methods can produce reasonable approximations. Reliability allocation techniques have limitations and implied assumptions that need to be understood by system engineers. Applying reliability allocation techniques without understanding their limitations and assumptions can produce unrealistic results. This report addresses weighting factors, optimal reliability allocation techniques, and identifies the applicability and limitations of each reliability allocation technique.

Reliability allocation↗
NASA NTRS2018

Optimal Control Prediction Method for Control Allocation

This paper proposes a novel prediction method for online optimal control allocation that extends the volume of moments achievable with the Moore-Penrose generalized inverse to the entire Attainable Moment Set. This method formulates the control allocation problem using selected basis vectors and associated gains which reduces the optimization problem dimensions and provides physical insight into the resulting optimal solutions. The proposed algorithm finds the entire family of unique optimal control solutions along the desired moment vector from the origin to the boundary of the Attainable Moment Set. Numerical results for the Moore-Penrose prediction method show that the unique minimal controls obtained yield the desired moment with near machine precision accuracy while maintaining control effectors within specified position limits. This method has been fully validated against the unique solution obtained on the boundary of the Attainable Moment Set using the Durham Direct Allocation method. Minimal control solutions obtained for moments in the interior of the Attainable Moment Set, similarly yield the desired moment to near machine precision while providing control solutions that are smaller (i.e. 2-norm) than solutions found with traditional control allocation algorithms (e.g. interior point methods) applied to the minimal control problem. Numerical simulations using a Matlab® autocoded executable (MEX) for the representative real world problem of 3-moments with 20 individual control effectors and prescribed control position limits show a mean computation speed of approximately 125 Hz which is sufficient to enable real-time flight allocation.

Acheson, Michael J.↗
DOE OSTI2025

Hybridization Assessment of Trybrid Pumped Storage Hydropower System—Part 1: A Case Study of Corral Summit

This report is a part of the deliverables for technical assistance provided to Cat Creek Energy for the Coral Summit Trybrid (Triple Hybrid-Pumped Storage Hydropower, Battery Energy Storage System, and photovoltaic solar energy) energy project. This report explores the operational benefits and challenges of hybridizing an open loop PSH (200MW) located at Mackay, Custer County, Idaho with solar PV (Ground mount 300MW and floating 40MW) and battery (720MWhr). This document reports two activities performed as a part of the hybridization assessment task 1) optimal resource allocation and energy management strategy, and 2) power quality and reliability assessment. From optimal resource allocation and energy management strategy (activity 1), the following key findings can be observed: • Conventional PSH (CPSH) with two reversible pump turbines and separate penstocks can provide required flexibility equivalent to that from two ternary PSH with separate penstock. With single unit CPSH, upper reservoir head cannot be maintained accurately, the variation of water level is rapid and pump mode flexibility is not available. These disadvantages can be overcome by single unit TPSH. However, using two CPSH units with separate penstocks also overcome these disadvantages with the formation of the hydraulic short circuit between two conventional units. • Flooding of the lower reservoir is a severe concern when considering continuous operation for black start. This limits the duration of continuous operation from PSH alone to around 50 hours. Due to the complementary PV and battery action, the duration of continuous operation and smooth power output can be extended. • An optimization problem is framed that maximizes the power output on an hourly basis while minimizing constraint violations and respecting seasonal variations of solar PV and load profiles . Two value streams, arbitrage and baseload generation are served by this profile. It was uncovered that for smooth power output during regular operation, PV curtailment will be required, or the battery capacity needs to be increased above 90MW to accommodate additional PV. From power quality and reliability assessment (activity 2) the following takeaway points can be observed: • The Trybrid, when integrated at the Lost River bus, and limited to 250MW in generation mode and -150MW in the pump mode, causes no violation of voltage or flow.

13 - HYDRO ENERGY↗
DOE OSTI2026

Constrained variational optimization of counting-time allocation in sequential scattering measurements: Application to Bonse–Hart USANS

Sequential scattering measurements are often performed under a fixed experimental-time budget, even though the expected count rate varies strongly across the measured coordinate. When the dwell time at each measurement position can be controlled independently, this variation creates a general resource-allocation problem: how should the available time be distributed to minimize the uncertainty of the reconstructed profile? We formulate this problem as a constrained variational optimization for measurements governed by Poisson counting statistics. When each measurement is treated independently, minimizing the averaged squared relative uncertainty yields an inverse-square-root intensity allocation. The formulation is then generalized to include correlations between neighboring measurements and an instrumental resolution operator, leading to an allocation criterion that equalizes the marginal reduction in posterior uncertainty per unit measurement time. Bonse–Hart ultra-small-angle neutron scattering (USANS), in which reciprocal space is sampled sequentially through analyzer-angle stepping, provides an experimentally grounded application. Computational benchmarking shows that the optimized allocation outperforms uniform-time and constant-relative-error strategies, while application to an experimentally measured graphite USANS profile from the Spallation Neutron Source, using Poisson resampling under alternative schedules, demonstrates how counting time should be redistributed toward weak-intensity regions under an identical total duration. The resulting framework applies to sequential scattering and related scanning measurements whenever local dwell times are adjustable and directly determine the measurement uncertainties, and when the relevant correlation and instrumental-response models are available.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗
NASA NTRS2011

Integrated Control with Structural Feedback to Enable Lightweight Aircraft

This presentation for the Fundamental Aeronautics Program Technical Conference covers the benefits of active structural control, related research areas, and focuses on the use of optimal control allocation for the prevention of critical loads. Active control of lightweight structures has the potential to reduce aircraft weight and fuel burn. Sensor, control law, materials, control effector, and system level research will be necessary to enable active control of lightweight structures. Optimal control allocation with structural feedback has been shown in simulation to be feasible in preventing critical loads and is one example of a control law to enable future lightweight aircraft.

Taylor, Brian R.↗
NASA NTRS1999

Robust Passification via Optimal Sensor Blending and Control Allocation

Robust passification is considered for uncertain linear, time invariant, systems having redundant actuators and sensors. The approach is to obtain optimal sensor blending and control allocation matrices that maximize the region in the parameter space in which the system remains passive. The approach results in a generalized eigenvalue problem consisting of a number of linear matrix inequalities (LMIs). Reduction of the number of LMIs is investigated, and a numerical example is given for demonstrating the approach.

Joshi, S. M.↗