Search NASA⌕ Search

SEARCH · Search NASA

Results for “coordinated 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 361 records · Page 20

Program to Optimize Simulated Trajectories (POST). Volume 1: Formulation manual

A general purpose FORTRAN program for simulating and optimizing point mass trajectories (POST) of aerospace vehicles is described. The equations and the numerical techniques used in the program are documented. Topics discussed include: coordinate systems, planet model, trajectory simulation, auxiliary calculations, and targeting and optimization.

Brauer, G. L.↗

Multidisciplinary optimization of a controlled space structure using 150 design variables

A controls-structures interaction design method is presented. The method coordinates standard finite-element structural analysis, multivariable controls, and nonlinear programming codes and allows simultaneous optimization of the structure and control system of a spacecraft. Global sensitivity equations are used to account for coupling between the disciplines. Use of global sensitivity equations helps solve optimization problems that have a large number of design variables and a high degree of coupling between disciplines. The preliminary design of a generic geostationary platform is used to demonstrate the multidisciplinary optimization method. Design problems using 15, 63, and 150 design variables to optimize truss member sizes and feedback gain values are solved and the results are presented. The goal is to reduce the total mass of the structure and the vibration control system while satisfying constraints on vibration decay rate. Incorporation of the nonnegligible mass of actuators causes an essential coupling between structural design variables and control design variables.

James, Benjamin B.↗

A Novel Zinc Binding Group for HDAC6 Inhibition

Histone deacetylases (HDAC’s) are key regulatory enzymes in gene transcription and cellular motility through the deacetylation of lysine residues. These enzymes bear a distinct clinical significance, as the upregulation of HDACs has been associated with oncogenesis for many hematological malignancies and proliferation of other neurodegenerative or immune disorders. There are four different classes of HDACs, three of which require zinc for catalysis. Among the zinc dependent isozymes, HDAC6 is thought to be a particularly desirable therapeutic target, as its selective inhibition in malignant cells is accompanied by fewer associated toxicities in comparison to pan‐HDAC inhibition. Therefore, optimizing HDAC6 inhibitor selectivity has the potential to yield great clinical significance. This selectivity is often conferred by designing inhibitors with bulky capping groups and a hydrophobic linker region, which make favorable interactions in the hydrophobic region of the HDAC6 active site. Many inhibitors contain a hydroxamate zinc‐binding group, which can coordinate with bidentate or monodentate geometry. In efforts to optimize HDAC6 selectivity by exploring alternative zinc‐binding groups, a unique inhibitor containing an oxadiazole ring was discovered. Surprisingly, the crystal structure of its complex with HDAC6 reveals that the oxadiazole undergoes a ring opening reaction to yield an acylhydrazide that binds with an extended conformation in the active site.

Cragin, Abigail↗

Overcoming Communication Restrictions in Collectives

Many large distributed system are characterized by having a large number of components (eg., agents, neurons) whose actions and interactions determine a %orld utility which rates the performance of the overall system. Such collectives are often subject to communication restrictions, making it difficult for components which try to optimize their own private utilities, to take actions that also help optimize the world utility. In this article we address that coordination problem and derive four utility functions which present different compromises between how aligned a component s private utility is with the world utility and how readily that component can determine the actions that optimize its utility. The results show that the utility functions specifically derived to operate under communication restrictions outperform both traditional methods and previous collective-based methods by up to 75%.

Tumer, Kagan↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗

A Distributed Energy Management Approach for Residential Demand Response

The implementation of large-scale optimization and control of residential appliances to support demand response (DR) programs comes with the challenges of coordinated communication, privacy, and consideration of customer preferences. Solving this complexity is best suited through a distributed optimization and control approach at the residential level by leveraging the availability and intelligence of a home energy management systems (HEMS). In this paper, a hierarchical control scheme to coordinate large-scale residential demand response through coordination of HEMs is proposed. This scheme is based on the exchange of a reward price and aggregated load information between utility system and HEMS. Numerical results on a one hundred-house model demonstrate the computational efficiency of the proposed approach.

Kou, Xiao↗

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗

Multidisciplinary optimization of controlled space structures with global sensitivity equations

A new method for the preliminary design of controlled space structures is presented. The method coordinates standard finite element structural analysis, multivariable controls, and nonlinear programming codes and allows simultaneous optimization of the structures and control systems of a spacecraft. Global sensitivity equations are a key feature of this method. The preliminary design of a generic geostationary platform is used to demonstrate the multidisciplinary optimization method. Fifteen design variables are used to optimize truss member sizes and feedback gain values. The goal is to reduce the total mass of the structure and the vibration control system while satisfying constraints on vibration decay rate. Incorporating the nonnegligible mass of actuators causes an essential coupling between structural design variables and control design variables. The solution of the demonstration problem is an important step toward a comprehensive preliminary design capability for structures and control systems. Use of global sensitivity equations helps solve optimization problems that have a large number of design variables and a high degree of coupling between disciplines.

Padula, Sharon L.↗

Markov Tracking for Agent Coordination

Partially observable Markov decision processes (POMDPs) axe an attractive representation for representing agent behavior, since they capture uncertainty in both the agent's state and its actions. However, finding an optimal policy for POMDPs in general is computationally difficult. In this paper we present Markov Tracking, a restricted problem of coordinating actions with an agent or process represented as a POMDP Because the actions coordinate with the agent rather than influence its behavior, the optimal solution to this problem can be computed locally and quickly. We also demonstrate the use of the technique on sequential POMDPs, which can be used to model a behavior that follows a linear, acyclic trajectory through a series of states. By imposing a "windowing" restriction that restricts the number of possible alternatives considered at any moment to a fixed size, a coordinating action can be calculated in constant time, making this amenable to coordination with complex agents.

Washington, Richard↗

Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs

PIPS-SBB is a distributed-memory parallel solver with a scalable data distribution paradigm. It is designed to solve MIPs with a dual-block angular structure, which is characteristic of deterministic-equivalent Stochastic Mixed-Integer Programs (SMIPs). In this paper, we present two different parallelizations of Branch & Bound (B&B), implementing both as extensions of PIPS-SBB, thus adding an additional layer of parallelism. In the first of the proposed frameworks, PIPS-PSBB, the coordination and load-balancing of the different optimization workers is done in a decentralized fashion. This new framework is designed to ensure all available cores are processing the most promising parts of the B&B tree. The second, ug[PIPS-SBB,MPI], is a parallel implementation using the Ubiquity Generator (UG), a universal framework for parallelizing B&B tree search that has been sucessfully applied to other MIP solvers. We show the effects of leveraging multiple levels of parallelism in potentially improving scaling performance beyond thousands of cores.

97 MATHEMATICS AND COMPUTING↗

Multigene engineering in plants: Technologies, applications, and future prospects

The emerging bioeconomy presents a promising solution to both economic and environmental challenges. Within the bioeconomy, plants serve as a renewable, sustainable, and cost-effective source of foods, fuels, chemicals, and materials. However, traditional breeding and single-gene engineering approaches fall short in addressing complex traits (e.g., drought tolerance, disease resistance, yield, nutrient use efficiency) which are controlled by multiple genes. The complexity of plant biology often necessitates the use of multigene engineering (MGE), which involves simultaneous ectopic expression, up/down-regulation, or editing of multiple genes, to enhance plant traits relevant to the bioeconomy. These genes may be associated with distinct traits or function as components of specific metabolic and regulatory pathways. This review summarizes current technologies for MGE within the synthetic biology-driven Design-Build-Test-Learn (DBTL) framework, detailing its four key stages: Design – gene construct development; Build – DNA assembly and plant transformation; Test – the molecular, biochemical, and physiological characterization of engineered plants; and Learn – computational modeling to refine, multiplex and iterate the process. Despite good progress in the applications of MGE in biofortification, metabolic engineering, and stress resilience, challenges remain in construct stability, coordinated gene expression, and regulatory predictability. We identified optimization paths and future directions to accelerate MGE deployment in sustainable agriculture, with possible societal benefits including reduced production costs, increased yield, and improved food and nutritional security.

AI-aided plant engineering↗

Sequential surface synthesis of dispersed sub-nanometer iridium on titanium nitride for acidic water oxidation

Maximizing iridium utilization while maintaining high oxygen evolution reaction (OER) performance remains a persistent challenge in acidic water electrolysis. Immobilizing Ir on conductive, acid-stable supports is promising, yet simultaneously achieving sub-nanometer size, high area coverage, and strong electronic coupling is difficult. Here, we report a sequential surface synthesis on titanium nitride (TiN) that yields uniformly distributed sub-nanometer Ir arrays (∼0.7 nm). Our method uses ethylenediaminetetraacetic acid (EDTA) as a temporal scaffold: it chemisorbs to TiN to install dense chelating sites, captures Ir 3+ ions, and confines Ir cluster growth. A subsequent thermal treatment at 500 °C in a reducing atmosphere removes the ligand shell, while preserving ultrasmall particle size and establishing direct Ir–TiN electronic coupling. The optimized catalyst exhibits mixed Ir 0 /Ir x+ coordination with low charge-transfer resistance (R ct = 19.2 Ω), delivering a mass activity of 342 A g Ir −1 at 1.54 V in acidic electrolyte. In situ X-ray absorption spectroscopy reveals irreversible surface oxidation as the primary stability-limiting factor. This stepwise strategy provides a general framework for supported catalysts that maximize precious metal utilization via sub-nanometer dispersion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ACTIVE

The Automated Control Testbed for Integration, Verification, and Emulation (ACTIVE) framework is a software platform designed to support the optimized operation and management of a wide range of building types. It enables the development, testing, and validation of diverse control strategies, including AI-based, rule-based, and model-based approaches. The platform facilitates a seamless transition from simulation-based evaluation of control strategies to real-world field validation and deployment. ACTIVE supports the full building management lifecycle, encompassing data acquisition and management, system monitoring, optimized control, adaptive learning services, device dispatch and coordination, as well as advanced analytics and visualization. Together, these capabilities provide an integrated environment for improving building performance, operational efficiency, reducing energy cost, and reliability.

Smith, Robert [Oak Ridge National Laboratory (ORNL↗

Observing Arctic Sea Ice

Our understanding of Arctic sea ice and its wide-ranging influence is deeply rooted in observation. Advancing technologies have profoundly improved our ability to observe Arctic sea ice, document its processes and properties, and describe atmosphere-ice-ocean interactions with unprecedented detail. Yet, our progress toward better understanding the Arctic sea ice system is mired by the stark disparities between observations that tend to be siloed by method, scientific discipline, and application. This article presents a review and philosophical design for observing sea ice and accelerating our understanding of the Arctic sea ice system. We give a brief history of Arctic sea ice observations and showcase the 2018 melt season within the context of five observational themes: spatial heterogeneity, temporal variability, cross-disciplinary science, scalability, and retrieval uncertainty. We synthesize buoy data, optical imagery, satellite retrievals, and airborne measurements to demonstrate how disparate data sets can be woven together to transcend observational-scale issues. The results show that there are limitations to interpreting any single data set alone. However, many of these limitations can be surmounted by combining observations that cross spatial and temporal scales. We conclude the article with pathways toward coordinating across observational platforms in order to: (1) optimize the scientific, operational, and community return on observational investments, and (2) facilitate a richer understanding of Arctic sea ice and its role in the climate system.

54 ENVIRONMENTAL SCIENCES↗

Space Reclamation for Uncoordinated Checkpointing in Message-Passing Systems

Checkpointing and rollback recovery are techniques that can provide efficient recovery from transient process failures. In a message-passing system, the rollback of a message sender may cause the rollback of the corresponding receiver, and the system needs to roll back to a consistent set of checkpoints called recovery line. If the processes are allowed to take uncoordinated checkpoints, the above rollback propagation may result in the domino effect which prevents recovery line progression. Traditionally, only obsolete checkpoints before the global recovery line can be discarded, and the necessary and sufficient condition for identifying all garbage checkpoints has remained an open problem. A necessary and sufficient condition for achieving optimal garbage collection is derived and it is proved that the number of useful checkpoints is bounded by N(N+1)/2, where N is the number of processes. The approach is based on the maximum-sized antichain model of consistent global checkpoints and the technique of recovery line transformation and decomposition. It is also shown that, for systems requiring message logging to record in-transit messages, the same approach can be used to achieve optimal message log reclamation. As a final topic, a unifying framework is described by considering checkpoint coordination and exploiting piecewise determinism as mechanisms for bounding rollback propagation, and the applicability of the optimal garbage collection algorithm to domino-free recovery protocols is demonstrated.

Wang, Yi-Min↗

Probabilistic Design of a Plate-Like Wing to Meet Flutter and Strength Requirements

An approach is presented for carrying out reliability-based design of a metallic, plate-like wing to meet strength and flutter requirements that are given in terms of risk/reliability. The design problem is to determine the thickness distribution such that wing weight is a minimum and the probability of failure is less than a specified value. Failure is assumed to occur if either the flutter speed is less than a specified allowable or the stress caused by a pressure loading is greater than a specified allowable. Four uncertain quantities are considered: wing thickness, calculated flutter speed, allowable stress, and magnitude of a uniform pressure load. The reliability-based design optimization approach described herein starts with a design obtained using conventional deterministic design optimization with margins on the allowables. Reliability is calculated using Monte Carlo simulation with response surfaces that provide values of stresses and flutter speed. During the reliability-based design optimization, the response surfaces and move limits are coordinated to ensure accuracy of the response surfaces. Studies carried out in the paper show the relationship between reliability and weight and indicate that, for the design problem considered, increases in reliability can be obtained with modest increases in weight.

Stroud, W. Jefferson↗

A multidimensional model of the effect of gravity on the spatial orientation of the monkey

A "sensory conflict" model of spatial orientation was developed. This mathematical model was based on concepts derived from observer theory, optimal observer theory, and the mathematical properties of coordinate rotations. The primary hypothesis is that the central nervous system of the squirrel monkey incorporates information about body dynamics and sensory dynamics to develop an internal model. The output of this central model (expected sensory afference) is compared to the actual sensory afference, with the difference defined as "sensory conflict." The sensory conflict information is, in turn, used to drive central estimates of angular velocity ("velocity storage"), gravity ("gravity storage"), and linear acceleration ("acceleration storage") toward more accurate values. The model successfully predicts "velocity storage" during rotation about an earth-vertical axis. The model also successfully predicts that the time constant of the horizontal vestibulo-ocular reflex is reduced and that the axis of eye rotation shifts toward alignment with gravity following postrotatory tilt. Finally, the model predicts the bias, modulation, and decay components that have been observed during off-vertical axis rotations (OVAR).

NASA Discipline Neuroscience↗