Search NASA⌕ Search

SEARCH · Search NASA

Results for “resource 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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

An integrated decision support system for TRAC: A proposal

Optimal allocation and usage of resources is a key to effective management. Resources of concern to TRAC are: Manpower (PSY), Money (Travel, contracts), Computing, Data, Models, etc. Management activities of TRAC include: Planning, Programming, Tasking, Monitoring, Updating, and Coordinating. Existing systems are insufficient, not completely automated, manpower intensive, and has the potential for data inconsistency exists. A system is proposed which suggests a means to integrate all project management activities of TRAC through the development of a sophisticated software and by utilizing the existing computing systems and network resources. The systems integration proposal is examined in detail.

Mukkamala, Ravi↗
NASA NTRS1991

Polynomial optimization techniques for activity scheduling. Optimization based prototype scheduler

Polynomial optimization techniques for activity scheduling (optimization based prototype scheduler) are presented in the form of the viewgraphs. The following subject areas are covered: agenda; need and viability of polynomial time techniques for SNC (Space Network Control); an intrinsic characteristic of SN scheduling problem; expected characteristics of the schedule; optimization based scheduling approach; single resource algorithms; decomposition of multiple resource problems; prototype capabilities, characteristics, and test results; computational characteristics; some features of prototyped algorithms; and some related GSFC references.

Reddy, Surender↗
NASA NTRS1993

Predicting scheduling success

This paper provides an analytical formulation to predict scheduling success for a class of problems frequently referred to as activity scheduling. Space Network communications scheduling is an example of activity scheduling. The principal assumption is that the activity start times are randomly distributed over the available time in the time line. The formulation makes it possible to estimate how much of the demand can be scheduled as a function of the demand, number of resources, activity duration, and activity flexibility. The paper includes computed results for a variety of resource and demand conditions. The results demonstrate that even with highly flexible activities, it is difficult to schedule demand greater than 60 percent of resources without the use of optimization and conflict resolution capabilities in the scheduling system.

Messing, Fredric↗
NASA NTRS1994

The viability of establishing collaborative, reconfigurable research environments for the Human Performance Research Laboratory at NASA Ames

This paper will review and summarize research initiatives conducted between 1987 and 1992 at NASA Ames Research Center by a research team from the University of Michigan Architecture Research Laboratory. These research initiatives, funded by a NASA grant NAG2-635, examined the viability of establishing collaborative, reconfigurable research environments for the Human Performance Research Laboratory at NASA Ames in California. Collaborative Research Environments are envisioned as a way of enhancing the work of NASA research teams, optimizing the use of shared resources, and providing superior environments for housing research activities. The Integrated Simulation Project at NASA, Ames Human Performance Research Laboratory is one of the current realizations of this initiative.

Clipson, Colin↗
NASA NTRS2005

Knowledge Capture and Management for Space Flight Systems

The incorporation of knowledge capture and knowledge management strategies early in the development phase of an exploration program is necessary for safe and successful missions of human and robotic exploration vehicles over the life of a program. Following the transition from the development to the flight phase, loss of underlying theory and rationale governing design and requirements occur through a number of mechanisms. This degrades the quality of engineering work resulting in increased life cycle costs and risk to mission success and safety of flight. Due to budget constraints, concerned personnel in legacy programs often have to improvise methods for knowledge capture and management using existing, but often sub-optimal, information technology and archival resources. Application of advanced information technology to perform knowledge capture and management would be most effective if program wide requirements are defined at the beginning of a program.

Goodman, John L.↗
NASA NTRS2001

Mars scouts: an overview

The Mars program institutes the Mars Scout Missions in order to address science goals in the program not otherwise covered in the baseline Mars plan. Mars Scout Missions will be Principle-Investigator (PI) led science missions. Analogous to the Discovery Program, PI led investigations optimize the use of limited resources to accomplish the best focused science and allow the flexibility to quickly respond to discoveries at Mars. Scout missions also require unique investments in technology and reliance upon Mars-based infrastructure such as telecom relay orbiters.

mars scout missions↗
NASA NTRS2003

Mars Scout 2007 - a current status

The Mars Program institutes the Mars Scout Missions in order to address science goals in the program not otherwise covered in baseline Mars plans. Mars Scout missions will be Principal-Investigator (PI) led science missions. Analogous to the Discovery Program, PI-led investigations optimize the use of limited resources to accomplish focused science and allow the flexibility to quickly respond to discoveries at Mars. Scout missions also require unique investments in technology and reliance upon Mars-based infrastructure such as telecom relay orbiters. Scouts utilize a two-step competitive process for selection. In Dec, 2002, the Step 2 selections by NASA were announced and then approximately five month studies will result in a selection for flight around August, 2003 for a mission to be launched in 2007.

Mars Scout↗
NASA NTRS2003

Enhanced Multi-Modal Access to Planetary Exploration

Tomorrow's Interplanetary Network (IPN) will evolve from JPL's Deep-Space Network (DSN) and provide key capabilities to future investigators, such as simplified acquisition of higher-quality science at remote sites and enriched access to these sites. These capabilities could also be used to foster public interest, e.g., by making it possible for students to explore these environments personally, eventually perhaps interacting with a virtual world whose models could be populated by data obtained continuously from the IPN. Our paper looks at JPL's approach to making this evolution happen, starting from improved communications. Evolving space protocols (e.g., today's CCSDS proximity and file-transfer protocols) will provide the underpinning of such communications in the next decades, just as today's rich web was enabled by progress in Internet Protocols starting from the early 1970's (ARPAnet research). A key architectural thrust of this effort is to deploy persistent infrastructure incrementally, using a layered service model, where later higher-layer capabilities (such as adaptive science planning) are enabled by earlier lower-layer services (such as automated routing of object-based messages). In practice, there is also a mind shift needed from an engineering culture raised on point-to-point single-function communications (command uplink, telemetry downlink), to one in which assets are only indirectly accessed, via well-defined interfaces. We are aiming to foster a 'community of access' both among space assets and the humans who control them. This enables appropriate (perhaps eventually optimized) sharing of services and resources to the greater benefit of all participants. We envision such usage to be as automated in the future as using a cell phone is today - with all the steps in creating the real-time link being automated.

interplanetary network (IPN)↗
NASA NTRS2012

Physics Mining of Multi-Source Data Sets

Powerful new parallel data mining algorithms can produce diagnostic and prognostic numerical models and analyses from observational data. These techniques yield higher-resolution measures than ever before of environmental parameters by fusing synoptic imagery and time-series measurements. These techniques are general and relevant to observational data, including raster, vector, and scalar, and can be applied in all Earth- and environmental science domains. Because they can be highly automated and are parallel, they scale to large spatial domains and are well suited to change and gap detection. This makes it possible to analyze spatial and temporal gaps in information, and facilitates within-mission replanning to optimize the allocation of observational resources. The basis of the innovation is the extension of a recently developed set of algorithms packaged into MineTool to multi-variate time-series data. MineTool is unique in that it automates the various steps of the data mining process, thus making it amenable to autonomous analysis of large data sets. Unlike techniques such as Artificial Neural Nets, which yield a blackbox solution, MineTool's outcome is always an analytical model in parametric form that expresses the output in terms of the input variables. This has the advantage that the derived equation can then be used to gain insight into the physical relevance and relative importance of the parameters and coefficients in the model. This is referred to as physics-mining of data. The capabilities of MineTool are extended to include both supervised and unsupervised algorithms, handle multi-type data sets, and parallelize it.

Helly, John↗
NASA NTRS2018

New Crop Selection

For extended space flight, reliable food supplies are a necessity. Most of the food products consumed by astronauts today are stored for flight via freeze drying. Fresh food is needed to supplement known national deficiencies in the stored food diet (Cooper et al.). This is so because stored foods can lose nutritional value. Fresh food is the answer to the nutritional demands of space flight. Kennedy Space Center's Utilization and Life Sciences Office (UB-A), under the Exploration Research and Technology Program (UB), conducts research on plant growth and development under International Space Station (ISS) conditions. UB-A analyzes the growth responses of leafy greens in microgravity and through the manipulation of environmental conditions (CO2 levels, light intensity, relative humidity, and water delivery). By manipulating growing conditions researchers can optimize food production using minimal/restricted resources. The New Crop Selection experiments are testing the suitability of leafy crops to ISS conditions. Results from this study showed that 'Dragoon' Lettuce and 'Red Russian' Kale have the largest fresh mass.

Bhuiyan, Ruqayah H.↗
NASA NTRS2018

IV&V Planning & Execution Initiative

Independent verification and validation (IV&V) is a systems engineering discipline which seeks to provide confidence that mission-critical software-dependent systems will operate safely and achieve all mission objectives. In order to optimize application of IV&V resources, it is necessary to identify specific assurance objectives that are most likely to reveal difficulty and therefore to increase confidence. Software assurance literature deals predominantly with the code itself. However, our experience is that the most significant software-related issues are discovered via analysis of other system artifacts such as operations concepts, requirements and design. Consequently, it is desirable to, when assessing risk and defining assurance objectives, consider all facets of the software system architecture. We describe in this presentation progress and lessons learned from an IV&V capability development initiative to enhance the IV&V project planning process using all available architecture information.

Risk↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
NASA NTRSDate not supplied

Providing Long-term Solar and Meteorological Resource Information from NASA Research through the GIS-Enabled POWER Web Services Portal

Solar and other renewable energy systems are optimized using geophysical parameters describing information about the solar resource and meteorological environments and how those environments may be changing in time. The Prediction of Worldwide Renewable Energy Resource (POWER) team at the NASA LaRC Research Center deployed its first version of the revitalized POWER geophysical parameter website that employs Esri Geographic Information System (GIS) tools. This web application provides access to both time series and climatological data sets spanning from a few days behind real-time back to the early 1980’s with a spatial resolution of 0.5 x 0.5 degree, thus extending over 30 years. The GIS tools enable, generate and store climatological averages using spatial queries and calculations in a spatial database resulting in greater accessibility to government agencies, industry and individuals. There is an API that provides data through a URL coding and can also invoked inside user software packages. Output data formats now include ASCII, CSV, geoTiff, JSON and .netCDF. Since May 2018, over 10.4 TB of data have been delivered to fulfill over 110 million data requests from 240,000 unique user IPs (https://power.larc.nasa.gov). This presentation provides an overview of this project and the current version of the new POWER web capabilities through to the end usage. Surface solar parameters are adapted from both the NASA/GEWEX (Global and Energy Water Cycle Exchange) SRB (Surface Radiation Budget) project and the CERES (Clouds and Earth’s Radiant Energy System) data products. The meteorological parameters are adapted from NASA’s MERRA-2 (Modern Era Retrospective-analysis for Research and Applications). We review uncertainty of various basic parameters using surface measurements. After the introduction, we specifically discuss various clusters of parameters for equator pointing tilted surfaces that provide for the estimation of optimal tilt angle by month and year. The discussion will emphasize a few examples of how solar and building engineers are using the data products. We will then preview the capabilities of Version 2 featuring examples of hourly solar and meteorological data products, customized user reports and expanded web mapping services from CERES data products. The web services provide a unique, expandable resource for renewable energy systems engineers to design, evaluate and optimize to environments worldwide.

Solar Resource↗
DOE OSTI2025

Leveraging artificial intelligence and advanced food processing techniques for enhanced food safety, quality, and security: a comprehensive review

Artificial intelligence is emerging as a transformative force in addressing the multifaceted challenges of food safety, food quality, and food security. This review synthesizes advancements in AI-driven technologies, such as machine learning, deep learning, natural language processing, and computer vision, and their applications across the food supply chain, based on a comprehensive analysis of literature published from 1990 to 2024. AI enhances food safety through real-time contamination detection, predictive risk modeling, and compliance monitoring, reducing public health risks. It improves food quality by automating defect detection, optimizing shelf-life predictions, and ensuring consistency in taste, texture, and appearance. Furthermore, AI addresses food security by enabling resource-efficient agriculture, yield forecasting, and supply chain optimization to ensure the availability and accessibility of nutritious food resources. This review also highlights the integration of AI with advanced food processing techniques such as high-pressure processing, ultraviolet treatment, pulsed electric fields, cold plasma, and irradiation, which ensure microbial safety, extend shelf life, and enhance product quality. Additionally, the integration of AI with emerging technologies such as the Internet of Things, blockchain, and AI-powered sensors enables proactive risk management, predictive analytics, and automated quality control. By examining these innovations' potential to enhance transparency, efficiency, and decision-making within food systems, this review identifies current research gaps and proposes strategies to address barriers such as data limitations, model generalizability, and ethical concerns. These insights underscore the critical role of AI in advancing safer, higher-quality, and more secure food systems, guiding future research and fostering sustainable food systems that benefit public health and consumer trust.

AI↗
NASA NTRS1995

Structural design using equilibrium programming formulations

Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.

Scotti, Stephen J.↗
NASA NTRS2010

Goal Selection for Embedded Systems with Oversubscribed Resources

We describe an efficient, online goal selection algorithm and its use for selecting goals at runtime. Our focus is on the re-planning that must be performed in a timely manner on the embedded system where computational resources are limited. In particular, our algorithm generates near optimal solutions to problems with fully specified goal requests that oversubscribe available resources but have no temporal flexibility. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. This enables shorter response cycles and greater autonomy for the system under control.

Rabideau, Gregg↗
NASA NTRS2010

Onboard Run-Time Goal Selection for Autonomous Operations

We describe an efficient, online goal selection algorithm for use onboard spacecraft and its use for selecting goals at runtime. Our focus is on the re-planning that must be performed in a timely manner on the embedded system where computational resources are limited. In particular, our algorithm generates near optimal solutions to problems with fully specified goal requests that oversubscribe available resources but have no temporal flexibility. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. This enables shorter response cycles and greater autonomy for the system under control.

Rabideau, Gregg↗