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 127 records · Page 7

Optimized FPGA Implementation of Multi-Rate FIR Filters Through Thread Decomposition

Multirate (decimation/interpolation) filters are among the essential signal processing components in spaceborne instruments where Finite Impulse Response (FIR) filters are often used to minimize nonlinear group delay and finite-precision effects. Cascaded (multi-stage) designs of Multi-Rate FIR (MRFIR) filters are further used for large rate change ratio, in order to lower the required throughput while simultaneously achieving comparable or better performance than single-stage designs. Traditional representation and implementation of MRFIR employ polyphase decomposition of the original filter structure, whose main purpose is to compute only the needed output at the lowest possible sampling rate. In this paper, an alternative representation and implementation technique, called TD-MRFIR (Thread Decomposition MRFIR), is presented. The basic idea is to decompose MRFIR into output computational threads, in contrast to a structural decomposition of the original filter as done in the polyphase decomposition. Each thread represents an instance of the finite convolution required to produce a single output of the MRFIR. The filter is thus viewed as a finite collection of concurrent threads. The technical details of TD-MRFIR will be explained, first showing its applicability to the implementation of downsampling, upsampling, and resampling FIR filters, and then describing a general strategy to optimally allocate the number of filter taps. A particular FPGA design of multi-stage TD-MRFIR for the L-band radar of NASA's SMAP (Soil Moisture Active Passive) instrument is demonstrated; and its implementation results in several targeted FPGA devices are summarized in terms of the functional (bit width, fixed-point error) and performance (time closure, resource usage, and power estimation) parameters.

DSP↗

Spaceport Command and Control System Software Development

There is an immense challenge in organizing personnel across a large agency such as NASA, or even over a subset of that, like a center's Engineering directorate. Workforce inefficiencies and challenges are bound to grow over time without oversight and management. It is also not always possible to hire new employees to fill workforce gaps, therefore available resources must be utilized more efficiently. The goal of this internship was to develop software that improves organizational efficiency by aiding managers, making employee information viewable and editable in an intuitive manner. This semester I created an application for managers that aids in optimizing allocation of employee resources for a single division with the possibility of scaling upwards. My duties this semester consisted of developing frontend and backend software to complete this task. The application provides user-friendly information displays and documentation of the workforce to allow NASA to track diligently track the status and skills of its workforce. This tool should be able to prove that current employees are being effectively utilized and if new hires are necessary to fulfill skill gaps.

SCCS↗

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↗

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↗

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↗

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↗

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↗

PlumeSeeker{sup TM}: A Model-Based Least-Cost Monitoring Network Design Technology for 3-D Contaminant Plume Boundary Delineation - 19582

Delineating the extent of contamination in an aquifer is a pre-requisite for designing remediation schemes as well as for satisfying regulators and stakeholders. Contaminant plumes are typically delineated using either monitoring well locations with observed concentrations below remedial goals or with computer-drawn contour maps based on available concentration measurements in the groundwater. Computer-generated plume information lacks ground truth resulting in uncertainty about the true limits of contamination. The location of groundwater delineation wells is usually chosen solely based on professional judgement and experience. Both approaches can be inefficient, risky and often unnecessarily expensive. PlumeSeeker{sup TM} is a software-based technology well-suited for the optimal delineation of radiological or emerging contaminant plumes with single or multiple source locations. The software is an enhancement of a university research code for plume delineation using geostatistical and stochastic modeling tools integrated with the widely used groundwater flow and transport modeling software MODFLOW-SURFACT{sup TM}. PlumeSeeker{sup TM} increases the overall confidence in the location and geometry of the plume boundary through the sequential (i.e. a rank-ordered listing) or batch (i.e. a suite of multiple wells) selection of existing or new monitoring wells based on the criteria of maximizing plume boundary uncertainty reduction and on new field information. Using PlumeSeeker{sup TM}, remediation managers can optimally locate new wells at sites where well installation costs are high or hydrogeology is complex. Applicable at sites with or without existing monitoring wells, PlumeSeeker{sup TM} is particularly powerful for optimally allocating project resources (labor, well installation, and laboratory costs) between existing wells and sampling at new locations. An application of PlumeSeeker{sup TM} at a DoD installation demonstrates how the cost of delineating a plume can be minimized. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Towards Precision Photometric Type ia Supernova Cosmology With Machine Learning

The revolutionary discovery of dark energy and accelerating cosmic expansion was made with just 42 type Ia supernovae (SNe Ia) in 1999. Since then, large synoptic surveys, e.g., Dark Energy Survey (DES), have observed thousands more SNe Ia and the upcoming Rubin Legacy Survey of Space and Time (LSST) and Roman Space Telescope promise to deliver millions in the next decade. This unprecedented data volume can produce the required precision to unambiguously test concordance cosmology which could represent a monumental shift in our understanding of dark energy and its role in cosmic history. However, extracting a pure SN Ia sample with accurate redshifts for such a large dataset will be a challenge. Specifically, spectroscopic classification will not be possible for the vast majority of discovered objects, and only ~25% will have spectroscopic redshifts. This thesis presents a series of observational and methodological studies designed to address the questions associated with this new era of photometric SN Ia cosmology. First, we present a machine learning method for photometric classification of SNe, Supernova Classification with a COnvolutional Neural Network (SCONE). Photometric classification enables SNe with no spectroscopic information to be confidently categorized, and is a critical component of current and future analysis pipelines. SCONE achieves >99% accuracy distinguishing simulated SNe Ia from non-Ia SNe, and has been integrated into DES, LSST, and Roman analysis pipelines. We also demonstrate the efficacy of SCONE on early-time photometric classification, which will be vital for optimal allocation of spectroscopic resources. We show that SCONE can distinguish between 6 SN types with 75% accuracy on the night of initial discovery, comparable to results in the literature for full-phase SNe. Next, we study current methods for estimating SN Ia redshifts and propose a machine learning alternative that uses SN photometry alone to extract redshift information. Most SNe Ia inherit redshift information from their host galaxy, but the process of matching SNe to the correct host galaxy can be challenging. We systematically analyze the impact of incorrect redshifts from host galaxy mismatch on 5 years of DES SN data, and conclude that improved host matching or redshift estimation methods can reduce our systematic errors by ~10%. In response to this finding, we present a SN photometry-only method for estimating redshifts independent of host galaxy information, Photo-zSNthesis. We show that Photo-zSNthesis redshift estimates are accurate to within 2% across the full redshift range of LSST, a first in the literature. Finally, we focus on the robustness of machine learning (ML) algorithms for real-world and scientific applications. ML models generalize poorly beyond their training set and often experience severe performance degradation when deployed on new data. We demonstrate a general method for improving robustness that achieves new state-of-the-art results on astronomical object classification, wildlife identification, and tumor detection.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

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↗

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↗

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↗

Water Resources Utilization and Protection in the Coal Mining Area of Northern China

This study investigates multiple types of water resources in the western mining area in China, their supply-demand balance by using the same dimension gray recurrence dynamic model GM (1, 1), and water content coefficients of mines to ease water supply-demand contradiction. A multi-objective programming model is proposed for optimal water resources allocation management. Optimal technical schemes for water resources allocation among different users are obtained. The optimization model improves upon the previous studies by using water demand and water supply forecast. Coordinated development for mining safety, mine water utilization, and remediation and control of water environment is achieved.

54 ENVIRONMENTAL SCIENCES↗

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↗

A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS

Existing approaches for allocating resources on edge environments are inefficient and lack the support of heterogeneous edge devices, which in turn fail to optimize the dependency on cloud infrastructures or datacenters. To this extent, we propose in this paper OpERA, a multi-layered edge-based resource allocation optimization framework that supports heterogeneous and seamless execution of offloadable tasks across edge, fog, and cloud computing layers and architectures. By capturing offloadable task requirements, OpERA is capable of identifying suitable resources within nearby edge or fog layers, thus optimizing the execution process. Throughout the paper, we present results which show the effectiveness of our proposed optimization strategy in terms of reducing costs, minimizing energy consumption, and promoting other residual gains in terms of processing computations, network bandwidth, and task execution time. We also demonstrate that by optimizing resource allocation in computation offloading, it is then possible to increase the likelihood of successful task offloading, particularly for computationally intensive tasks that are becoming integral as part of many IoT applications such robotic surgery, autonomous driving, smart city monitoring device grids, and deep learning tasks. The evaluation of our OpERA optimization algorithm reveals that the TOPSIS MCDM technique effectively identifies optimal compute resources for processing offloadable tasks, with a 96% success rate. Moreover, the results from our experiments with a diverse range of use cases show that our OpERA optimization strategy can effectively reduce energy consumption by up to 88%, and operational costs by 76%, by identifying relevant compute resources.

97 MATHEMATICS AND COMPUTING↗

A multistage distributionally robust optimization approach to water allocation under climate uncertainty

This paper investigates a Multistage Distributionally Robust Optimization (MDRO) approach to water allocation under climate uncertainty. The MDRO is formed by creating sets of conditional distributions (called conditional ambiguity sets) on a finite scenario tree. The distributions in the conditional ambiguity sets remain close to a nominal conditional distribution according a ø-divergence (e.g., Kullback-Leibler divergence, Hellinger distance, Burg entropy, etc.). Here, the paper discusses a decomposition algorithm to solve the resulting MDRO with ø-divergences, which uses the dual formulation and solves only linear subproblems instead of convex ones. Some properties of the algorithm such as generating feasible policies and valid upper/lower bounds are established. The paper then applies the modeling and solution techniques to allocate water in a rapidly-developing area of Tucson, Arizona. Tucson, like many arid and semi-arid regions around the world, faces considerable uncertainty in its ability to provide water for its citizens in the future. The primary sources of uncertainty in the Tucson region include (1) unpredictable population growth, (2) the availability of water from the Colorado River, and (3) the effects of climate variability on water consumption. This paper integrates forecasts for all these sources of uncertainty into a single optimization model for robust and sustainable water allocation. Then, it uses this model to analyze the value of constructing additional treatment facilities to reduce future water shortages. The results indicate that the MDRO approach can be very valuable for water managers by providing insights to minimize their risks and help them plan for the future.

54 ENVIRONMENTAL SCIENCES↗