Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint handling”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Binary Control Pulse Optimization for Quantum Systems

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

A numerical analysis of contact and limit-point behavior in a class of problems of finite elastic deformation

Finite element methods for the analysis of bifurcations, limit-point behavior, and unilateral frictionless contact of elastic bodies undergoing finite deformation are presented. Particular attention is given to the development and application of Riks-type algorithms for the analysis of limit points and exterior penalty methods for handling the unilateral constraints. Applications focus on the problem of finite axisymmetric deformations, snap-through, and inflation of thick rubber spherical shells.

Endo, T.↗
NASA NTRS2016

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗
NASA NTRS2024

Future of the Search for Life: Workshop Report

The 2-week, virtual Future of the Search for Life science and engineering workshop brought together more than 100 scientists, engineers, and technologists in March and April 2022 to provide their expert opinion on the interconnections between life-detection science and technology. Participants identified the advances in measurement and sampling technologies they believed to be necessary to perform in situ searches for life elsewhere in our Solar System, 20 years or more in the future. Among suggested measurements for these searches, those pertaining to three potential indicators of life termed “dynamic disequilibrium,” “catalysis,” and “informational polymers” were identified as particularly promising avenues for further exploration. For these three indicators, small breakout groups of participants identified measurement needs and knowledge gaps, along with corresponding constraints on sample handling (acquisition and processing) approaches for a variety of environments on Enceladus, Europa, Mars, and Titan. Despite the diversity of these environments, sample processing approaches all tend to be more complex than those that have been implemented on missions or envisioned for mission concepts to date. The approaches considered by workshop breakout groups progress from nondestructive to destructive measurement techniques, and most involve the need for fluid (especially liquid) sample processing. Sample processing needs were identified as technology gaps. These gaps include technology and associated sampling strategies that allow the preservation of the thermal, mechanical, and chemical integrity of the samples upon acquisition; and to optimize the sample information obtained by operating suites of instruments on common samples. Crucially, the interplay between science-driven life-detection strategies and their technological implementation highlights the need for an unprecedented level of payload integration and extensive collaboration between scientists and engineers, starting from concept formulation through mission deployment of life-detection instruments and sample processing systems.

Marc Neveu↗
NASA NTRS1989

Conceptual design for aerospace vehicles

The designers of aircraft and more recently, aerospace vehicles have always struggled with the problems of evolving their designs to produce a machine which would perform its assigned task(s) in some optimum fashion. Almost invariably this involved dealing with more variables and constraints than could be handled in any computationally feasible way. With the advent of the electronic digital computer, the possibilities for introducing more variable and constraints into the initial design process led to greater expectations for improvement in vehicle (system) efficiency. The creation of the large scale systems necessary to achieve optimum designs has, for many reason, proved to be difficult. From a technical standpoint, significant problems arise in the development of satisfactory algorithms for processing of data from the various technical disciplines in a way that would be compatible with the complex optimization function. Also, the creation of effective optimization routines for multi-variable and constraint situations which could lead to consistent results has lagged. The current capability for carrying out the conceptual design of an aircraft on an interdisciplinary bases was evaluated to determine the need for extending this capability, and if necessary, to recommend means by which this could be carried out. Based on a review of available documentation and individual consultations, it appears that there is extensive interest at Langley Research Center as well as in the aerospace community in providing a higher level of capability that meets the technical challenges. By implication, the current design capability is inadequate and it does not operate in a way that allows the various technical disciplines to participate and cooperately interact in the design process. Based on this assessment, it was concluded that substantial effort should be devoted to developing a computer-based conceptual design system that would provide the capability needed for the near-term as well as framework for development of more advanced methods to serve future needs.

Gratzer, Louis B.↗
NASA NTRS1973

Function space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function space algorithms, Davidon and projected gradient, are modified so that they may handle directly control variable inequality constraints. A third quasi-Newton type algorithm developed by C. G. Broyden is extended to optimal control problems. The Broyden algorithm is further modified so that it also may handle directly control variable inequality constraints. These methods along with a pure gradient and two conjugate gradient algorithms are simulated on three relatively simple yet representative bounded control problems, two of which have singular subarcs. Overall the Broyden algorithm was found to be superior. The most notable result of the study was the clear superiority of the Broyden and Davidon algorithms in producing a sharp interior control subarc.

Edge, E. R.↗
NASA NTRS1992

Truss topology optimization with simultaneous analysis and design

Strategies for topology optimization of trusses for minimum weight subject to stress and displacement constraints by Simultaneous Analysis and Design (SAND) are considered. The ground structure approach is used. A penalty function formulation of SAND is compared with an augmented Lagrangian formulation. The efficiency of SAND in handling combinations of general constraints is tested. A strategy for obtaining an optimal topology by minimizing the compliance of the truss is compared with a direct weight minimization solution to satisfy stress and displacement constraints. It is shown that for some problems, starting from the ground structure and using SAND is better than starting from a minimum compliance topology design and optimizing only the cross sections for minimum weight under stress and displacement constraints. A member elimination strategy to save CPU time is discussed.

Sankaranarayanan, S.↗
NASA NTRS1988

Experiences in applying optimization techniques to configurations for the Control Of Flexible Structures (COFS) Program

Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general-purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used. The use of optimization in this activity allows investigation of numerous options (such as number of bays, material, minimum diagonal wall thicknesses) in a relatively short time. The procedure provides data for judgments on the effects of different options on the design.

Walsh, Joanne L.↗
NASA NTRS1989

Experiences in applying optimization techniques to configurations for the Control of Flexible Structures (COFS) program

Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used.

Walsh, Joanne L.↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Modeling, analysis, and optimization of complex nuclear processes and facilities via computational methods: The HALEU process case study

Improving and adapting industrial systems to timely meet changing programmatic and market demands is an important goal to achieve, including when operating and maintaining complex nuclear processes and facilities. However, changes to these complex systems are costly, particularly when they are already in place and bounded to stringent requirements and constraints such as when handling radioactive material and contaminated equipment. These conditions often exist when treating spent nuclear fuel remotely within shielded nuclear radiation chambers, commonly referred as hot cells, to condition nuclear material and/or fabricate products for utilization in other nuclear enterprises such as in the manufacture of advanced nuclear fuel. The illustrative case considered here is the production of high assay low enriched uranium (HALEU) products supporting the deployment of advanced nuclear reactors. For the HALEU program, resources invested were and are being systematically analyzed so that these investments are maximized in a facility that is nearly 60 years old. A methodology that has effectively enabled optimized and improvements in the Spent Fuel Treatment (SFT) program, and consequently the HALEU program, involves discrete event simulation as addressed in this article. Here, the quantification of multiple productivity metrics, including material processing rates, cycle times, bottlenecks, number of material transfers as well as equipment, workstation, and material handling utilization, has resulted in a myriad of diverse discoveries and data-informed decisions regarding process layout and constituent, labor levels and schedules, selection of new process units, storage needs, and other critical process configurations. This article describes such a computational capability being applied for decision-making, illustrates its application to an actual process and program, provides illustrative results, and argues how computational methods for the modeling, analysis, and optimization of complex processes and facilities does lead to informed decisions derived from data and not only from intuition.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Advances in actinide thin films: synthesis, properties, and future directions

Actinide-based compounds exhibit unique physics due to the presence of 5f electrons, and serve in many cases as important technological materials. Targeted thin film synthesis of actinide materials has been successful in generating high-purity specimens in which to study individual physical phenomena. These films have enabled the study of the unique electron configuration, strong mass renormalization, and nuclear decay in actinide metals and compounds. The growth of these films, as well as their thermophysical, magnetic, and topological properties, have been studied in a range of chemistries, albeit far fewer than most classes of thin film systems. This relative scarcity is the result of limited source material availability and safety constraints associated with the handling of radioactive materials. Here, we review recent work on the synthesis and characterization of actinide-based thin films in detail, describing both synthesis methods and modeling techniques for these materials. Further, we review reports on pyrometallurgical, solution-based, and vapor deposition methods. We highlight the current state-of-the-art in order to construct a path forward to higher quality actinide thin films and heterostructure devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

BrickQA: Bridging the Semantic Gap in Building Operations with Dynamic Graph Exploration

While standardized ontologies like the Brick schema address data heterogeneity in Building Automation Systems (BAS), accessing this semantic data remains a challenge as domain experts often lack the expertise to formulate complex SPARQL queries. To bridge this gap, we present BrickQA, a Large Language Model (LLM)-based framework that translates natural language into executable SPARQL queries through structured query decomposition, dynamic schema exploration, and inline validation. BrickQA utilizes an iterative reasoning agent to actively navigate graph topology through dynamic exploration actions without requiring exhaustive context injection or model fine-tuning. This approach effectively mitigates hallucinations, particularly in large-scale building knowledge graphs. Empirical evaluation on BuildingQA, a standardized benchmark, demonstrates that BrickQA significantly outperforms ReAct baselines, delivering a 0.291–0.355 absolute F1 improvement while achieving 3 × –12.7 × higher token cost-efficiency. Beyond these metrics, the framework maintains structural fidelity across heterogeneous buildings and remains resilient to ambiguous queries without requiring site-specific fine-tuning. Furthermore, a case study on operational analytics validates the framework’s capability to handle temporal and aggregation constraints, effectively transforming abstract semantic models into actionable facility management insights.1

Ko, Yun-Dam↗
NASA NTRS1989

Computational neural learning formalisms for manipulator inverse kinematics

An efficient, adaptive neural learning paradigm for addressing the inverse kinematics of redundant manipulators is presented. The proposed methodology exploits the infinite local stability of terminal attractors - a new class of mathematical constructs which provide unique information processing capabilities to artificial neural systems. For robotic applications, synaptic elements of such networks can rapidly acquire the kinematic invariances embedded within the presented samples. Subsequently, joint-space configurations, required to follow arbitrary end-effector trajectories, can readily be computed. In a significant departure from prior neuromorphic learning algorithms, this methodology provides mechanisms for incorporating an in-training skew to handle kinematics and environmental constraints.

Gulati, Sandeep↗
NASA NTRS1991

An active set algorithm for tracing parametrized optima

Optimization problems often depend on parameters that define constraints or objective functions. It is often necessary to know the effect of a change in a parameter on the optimum solution. An algorithm is presented here for tracking paths of optimal solutions of inequality constrained nonlinear programming problems as a function of a parameter. The proposed algorithm employs homotopy zero-curve tracing techniques to track segments where the set of active constraints is unchanged. The transition between segments is handled by considering all possible sets of active constraints and eliminating nonoptimal ones based on the signs of the Lagrange multipliers and the derivatives of the optimal solutions with respect to the parameter. A spring-mass problem is used to illustrate all possible kinds of transition events, and the algorithm is applied to a well-known ten-bar truss structural optimization problem.

Rakowska, J.↗
NASA NTRS1998

Lunar prospector mission design and trajectory support

The Lunar Prospector mission is the first dedicated NASA lunar mapping mission since the Apollo Orbiter program which was flown over 25 years ago. Competitively selected under the NASA Discovery Program, Lunar Prospector was launched on January 7, 1998 on the new Lockheed Martin Athena 2 launch vehicle. The mission design of Lunar Prospector is characterized by a direct minimum energy transfer trajectory to the moon with three scheduled orbit correction maneuvers to remove launch and cislunar injection errors prior to lunar insertion. At lunar encounter, a series of three lunar orbit insertion maneuvers and a small circularization burn were executed to achieve a 100 km altitude polar mapping orbit. This paper will present the design of the Lunar Prospector transfer, lunar insertion and mapping orbits, including maneuver and orbit determination strategies in the context of mission goals and constraints. Contingency plans for handling transfer orbit injection and lunar orbit insertion anomalies are also summarized. Actual flight operations results are discussed and compared to pre-launch support analysis.

Lozier, David↗