Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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 1,675 records · Page 93

All-Digital Plug and Play Passive RFID Sensors for Energy Efficient Building Control

This is the final report for the project “All-Digital Plug and Play Passive RFID Sensors for Energy Efficient Building Control”, funded by DOE, and performed by Clemson University, Phase IV Engineering and Harvard University from October 1, 2016 to December 31, 2020. The main objective of this project is to develop, demonstrate and pre-commercialize a novel, plug & play, battery-free, wireless sensor technology to enable low-cost (<$10 per node) indoor and outdoor temperature and humidity measurement for energy efficient building controls and operations. The proposed technology is based on the novel concept of all-digital sensing and its seamless integration with the passive RFID technology. This project focuses on the design, fabrication, material optimization, interrogation electronics, validation, and demonstration of the novel sensor nodes for building applications. The specific objectives of this research program include: (1) Design, fabricate and optimize a compact, robust, and high-resolution digitizer, which could convert rotation angle into digital numbers. (2) Develop the multi-physics-based modeling and simulation of the temperature/humidity transducer to derive a rational design of the architecture, dimension, structure, materials (i.e., mechanical, electrical, thermal and hygroscopic) properties and functions of the sensor node. (3) Design, fabricate and optimize the bi-material based humidity sensitive coil which could linearly transduce the environmental relative humidity variations to rotation angles. (4) Design, fabricate and optimize an UHF RFID platform which could support long-range passive wireless communications of 8-bit digital numbers. (5) Design, fabricate and optimize the miniaturized all-digital sensor using MEMS technology. (6) Validate the integrated all-digital sensing system in a real building environment to test the system’s performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗

Motion Cueing Algorithm Development: New Motion Cueing Program Implementation and Tuning

A computer program has been developed for the purpose of driving the NASA Langley Research Center Visual Motion Simulator (VMS). This program includes two new motion cueing algorithms, the optimal algorithm and the nonlinear algorithm. A general description of the program is given along with a description and flowcharts for each cueing algorithm, and also descriptions and flowcharts for subroutines used with the algorithms. Common block variable listings and a program listing are also provided. The new cueing algorithms have a nonlinear gain algorithm implemented that scales each aircraft degree-of-freedom input with a third-order polynomial. A description of the nonlinear gain algorithm is given along with past tuning experience and procedures for tuning the gain coefficient sets for each degree-of-freedom to produce the desired piloted performance. This algorithm tuning will be needed when the nonlinear motion cueing algorithm is implemented on a new motion system in the Cockpit Motion Facility (CMF) at the NASA Langley Research Center.

Houck, Jacob A.↗

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗

Risk-averse optimization for resilience enhancement of complex engineering systems under uncertainties

With the growth of complexity and extent, large scale interconnected network systems, e.g., transportation networks or infrastructure networks, become more vulnerable to external disturbances. Hence, managing potential disruptive events during the design, operating, and recovery phase of an engineered system and therefore improving the system’s resilience is an important yet challenging task. Here, to ensure system resilience after the occurrence of failure events, this study proposes a mixed-integer linear programming (MILP) based restoration framework using heterogeneous dispatchable agents. The scenario-based stochastic optimization (SO) technique is adopted to deal with the inherent uncertainties imposed on the recovery process from nature. Moreover, different from conventional SO using deterministic equivalent formulations, the CVaR risk measure is implemented for this study because of the temporal sparsity of the decision making in applications such as the recovery from extreme events. The resulting restoration framework involves a large-scale MILP problem and thus an adequate decomposition technique i.e. modified Lagrangian dual decomposition, is also employed to achieve tractable computational complexity. Case study results based on the IEEE 37-bus test feeder demonstrate the benefits of using the proposed framework for resilience improvement as well as the advantages of adopting SO formulations.

42 ENGINEERING↗

Problems in large-scale structural optimization

A general design optimization model for large complex systems is defined. Major features of the model that challenge various optimization algorithms are discussed. Requirements of a model optimization algorithm are identified. Objectives of the study of various algorithms are defined and a basis for conducting such a study is developed. Primal as well as transformation methods are analytically studied and a unified viewpoint of various methods is presented. Several numerical examples are solved using different methods to study their performance. Conclusions drawn from the study are presented and discussed. Areas of future research in nonlinear programming as well as structural optimization are identified and discussed.

Arora, J. S.↗

CORSS: Cylinder Optimization of Rings, Skin, and Stringers

Launch vehicle designs typically make extensive use of cylindrical skin stringer construction. Structural analysis methods are well developed for preliminary design of this type of construction. This report describes an automated, iterative method to obtain a minimum weight preliminary design. Structural optimization has been researched extensively, and various programs have been written for this purpose. Their complexity and ease of use depends on their generality, the failure modes considered, the methodology used, and the rigor of the analysis performed. This computer program employs closed-form solutions from a variety of well-known structural analysis references and joins them with a commercially available numerical optimizer called the 'Design Optimization Tool' (DOT). Any ring and stringer stiffened shell structure of isotropic materials that has beam type loading can be analyzed. Plasticity effects are not included. It performs a more limited analysis than programs such as PANDA, but it provides an easy and useful preliminary design tool for a large class of structures. This report briefly describes the optimization theory, outlines the development and use of the program, and describes the analysis techniques that are used. Examples of program input and output, as well as the listing of the analysis routines, are included.

Finckenor, J.↗

Strength Variation of Parachute Joints

A parachute joint is defined as a location where a component is sewn or connected to another component. During the design and developmental phase of a parachute system, the joints for each structural component are isolated and tested through a process called seam and joint testing. The objective of seam and joint testing is to determine the degradation on a single component due to interaction with other components; this data is then used when calculating the margin of safety for that component. During the engineering developmental phase of CPAS (Capsule Parachute Assembly System), the parachute system for the NASA Orion Crew Module, testing was completed for every joint of the six subsystems: the four parachutes (main, drogue, pilot, and FBCP [forward bay cover parachute]), the retention release bridle, and the retention panels. The number of joint tests for these subsystems totaled 92, which provides a plethora of data and results for further analysis. In this paper, the data and results of these seam and joint tests are examined to determine the effects, if any, of different operators and sewing machines on the strength of parachute joints. Other variables are also studied to determine their effect on joint strength, such as joint complexity, joint strength magnitude, material type, and material construction. Findings reveal that an optimally-run seam and joint test program could result in an increased understanding of the structure of the parachute; this should lead to a parachute built with optimal components, potentially saving system weight and volume.

Mollmann, Catherine↗

Improvements to the Copernicus Trajectory Design and Optimization System for Complex Space Trajectories

The purpose of this assessment was to develop updates and new features for the NASA Copernicus Spacecraft Trajectory Design and Optimization analysis tool (version 5.0) for application to NASA programs and projects. These updates will significantly improve the ability to design and optimize complex trajectories over multiple trajectory phases; will allow the use of unique vehicle-specific guidance, control, and trajectory strategies and constraints; and the creation of an almost unlimited number of unique user-defined capabilities. The primary stakeholders for this assessment are the trajectory design and optimization analysts and engineers, and the chief engineers and project managers for existing programs, projects, and/or tasks that involve impulsive, finite burn, and/or continuous thrust trajectories (e.g., Sun, planet, comet, asteroid, halo orbit, Lagrange point, and distant retrograde orbit). The breadth of application spans the preliminary engineering and mission design concepts and optimization, to the development of candidate reference missions and integrated mission design for vehicle system design and operation, to the design and development of flight trajectories and associated propulsive maneuvers for real-time operations.

Murri, Daniel G.↗

Optimization of self-acting step thrust bearings for load capacity and stiffness.

Linearized analysis of a finite-width rectangular step thrust bearing. Dimensionless load capacity and stiffness are expressed in terms of a Fourier cosine series. The dimensionless load capacity and stiffness were found to be a function of the dimensionless bearing number, the pad length-to-width ratio, the film thickness ratio, the step location parameter, and the feed groove parameter. The equations obtained in the analysis were verified. The assumptions imposed were substantiated by comparing the results with an existing exact solution for the infinite width bearing. A digital computer program was developed which determines optimal bearing configuration for maximum load capacity or stiffness. Simple design curves are presented. Results are shown for both compressible and incompressible lubrication. Through a parameter transformation the results are directly usable in designing optimal step sector thrust bearings.

Hamrock, B. J.↗

High Energy Electromagnetic Particle Transportation on the GPU

We present massively parallel high energy electromagnetic particle transportation through a finely segmented detector on a Graphics Processing Unit (GPU). Simulating events of energetic particle decay in a general-purpose high energy physics (HEP) detector requires intensive computing resources, due to the complexity of the geometry as well as physics processes applied to particles copiously produced by primary collisions and secondary interactions. The recent advent of hardware architectures of many-core or accelerated processors provides the variety of concurrent programming models applicable not only for the high performance parallel computing, but also for the conventional computing intensive application such as the HEP detector simulation. The components of our prototype are a transportation process under a non-uniform magnetic field, geometry navigation with a set of solid shapes and materials, electromagnetic physics processes for electrons and photons, and an interface to a framework that dispatches bundles of tracks in a highly vectorized manner optimizing for spatial locality and throughput. Core algorithms and methods are excerpted from the Geant4 toolkit, and are modified and optimized for the GPU application. Program kernels written in C/C++ are designed to be compatible with CUDA and OpenCL and with the aim to be generic enough for easy porting to future programming models and hardware architectures. To improve throughput by overlapping data transfers with kernel execution, multiple CUDA streams are used. Issues with floating point accuracy, random numbers generation, data structure, kernel divergences and register spills are also considered. Performance evaluation for the relative speedup compared to the corresponding sequential execution on CPU is presented as well.

Canal, P.↗

Influence of structural and aerodynamic modeling on optimization with flutter constraint

The influences of structural and aerodynamic modeling on multidisciplinary optimization in an aeroelastic environment are not well understood. Therefore, optimizations with flutter and frequency constraints were performed to investigate the effects these modeling factors have on various representative wings. To this end, the Automated Structural Optimization System (ASTROS) was used as a tool to minimize the weight of various fully built-up finite element wing models in subsonic and supersonic flow under given flutter and frequency constraints. First, the performance of the optimization module was tested against results from other codes on a straight and uniform wing widely used for optimization with flutter constraints. Then, fully built-up finite element models of various wings with different aspect ratios were investigated for the influence on the structural optimization for minimum weight of the following modeling factors: finite element selection, structural grid refinement; number of selected modes, retention of breathing modes; selection of reduced frequencies to be used in flutter analysis; aerodynamic panel size and placement; splining of the aerodynamic grid to the structural grid selection of extra points of the structural wing box for splining; and number of constraints to be retained. Knowledge of these influences as well as of the program behavior is important, since optimization can be made more efficient by the selection of reasonable initial models. Also, it was shown previously that modeling has an impact on the results of modal and aeroelastic analyses. Thus, if modeling errors can negatively affect the analyses, a minimum weight optimization can be jeopardized and result in an optimal design that is rather unreliable. In the following, selected results are presented and the influences of some modeling parameters on optimization are pointed out.

Striz, Alfred G.↗

DOPEX-1D2C: A one-dimensional, two-constraint radiation shield optimization code

A one-dimensional, two-constraint radiation sheild weight optimization procedure and a computer program, DOPEX-1D2C, is described. The DOPEX-1D2C uses the steepest descent method to alter a set of initial (input) thicknesses of a spherical shield configuration to achieve a minimum weight while simultaneously satisfying two dose-rate constraints. The code assumes an exponential dose-shield thickness relation with parameters specified by the user. Code input instruction, a FORTRAN-4 listing, and a sample problem are given. Typical computer time required to optimize a seven-layer shield is less than 1/2 minute on an IBM 7094.

Lahti, G. P.↗

Optimizing the LSST Observing Strategy for Dark Energy Science: DESC Recommendations for the Deep Drilling Fields and other Special Programs

We review the measurements of dark energy enabled by observations of the Deep Drilling Fields and the optimization of survey design for cosmological measurements. This white paper is the result of efforts by the LSST DESC Observing Strategy Task Force (OSTF), which represents the entire collaboration, and aims to make recommendations on observing strategy for the DDFs that will benefit all cosmological analyses with LSST. It is accompanied by the DESC-WFD white paper (Lochner et al.). We argue for altering the nominal deep drilling plan to have $>6$ month seasons, interweaving $gri$ and $zy$ observations every 3 days with 2, 4, 8, 25, 4 visits in $grizy$, respectively. These recommendations are guided by metrics optimizing constraints on dark energy and mitigation of systematic uncertainties, including specific requirements on total number of visits after Y1 and Y10 for photometric redshifts (photo-$z$) and weak lensing systematics. We specify the precise locations for the previously-chosen LSST deep fields (ELAIS-S1, XMM-LSS, CDF-S, and COSMOS) and recommend Akari Deep Field South as the planned fifth deep field in order to synergize with Euclid and WFIRST. Our recommended DDF strategy uses $6.2\%$ of the LSST survey time. We briefly discuss synergy with white papers from other collaborations, as well as additional mini-surveys and Target-of-Opportunity programs that lead to better measurements of dark energy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Orbital angular momentum constraints in the variational optimization of the two-electron reduced-density matrix

The direct variational determination of the two-electron reduced-density matrix (2-RDM) corresponding to an atomic or molecular system is usually carried out in a basis of real-valued atom-centered Gaussian basis functions, under the assumption that the 2-RDM is a real-valued quantity. Furthermore, for systems that possess orbital angular momentum symmetry, the description of states with a well-defined, nonzero z projection of the orbital angular momentum requires a computational framework generalized to include either complex basis functions or a complex-valued 2-RDM. We consider a semidefinite program suitable for the direct optimization of a complex-valued 2-RDM and explore the role of orbital angular momentum constraints in systems that possess the relevant symmetries. For atomic systems, constraints on the expectation values of the square and z projection of the orbital angular momentum operator allow one to optimize 2-RDMs for multiple orbital angular momentum states. Similarly, in linear molecules, orbital angular momentum projection constraints enable the description of multiple electronic states and, moreover, the application of such constraints is essential for a qualitatively correct description of the electronic structure. For example, in the case of molecular oxygen, we demonstrate that orbital angular momentum constraints are necessary to recover the correct energy ordering of the lowest-energy singlet and triplet states near the equilibrium geometry. However, care must still be taken in the description of the dissociation limit, because the 2-RDM-based approach is not size consistent, and the size-consistency error varies dramatically, depending on the z projections of the spin and orbital angular momenta.

74 ATOMIC AND MOLECULAR PHYSICS↗

Optimization of distributed compute resources utilization in the CMS Global Pool

The CMS Submission Infrastructure is the primary system for managing computing resources for CMS workflows, including data processing, simulation, and analysis. It integrates geographically distributed resources from Grid, HPC, and cloud providers into federated pools managed by HTCondor and Glidein- WMS, for a total of around 500k CPU cores. This system dynamically manages workloads based on priorities defined by the collaboration. Additionally, CMS scheduling strategies must be flexible to handle multiple concurrent workloads while considering changing processing demands and resource availability from various providers.Efficient utilization of vast amounts of distributed compute resources is a key element for the success of the scientific programs of the LHC experiments. Optimizing the system is essential to maximize resource efficiency and fully utilize the distributed computing power. The CMS Submission Infrastructure team thus systematically investigates sources of inefficiency in workload scheduling to reduce their impact. In addition, a strategy of pilot overloading has been introduced to compensate for other inefficiency sources, thereby optimizing resource utilization and enhancing computational throughput.

Mascheroni, Marco [UC, San Diego (main)]↗

Coordinated PEV Charging for Distribution System Management

Plug-in electric vehicles (PEVs) can help to reduce worldwide dependence on petroleum and carbon emissions. In the past a few years, PEVs have received considerable attention as an eco-friendly and cost-effective alternative to conventional gasoline vehicles. PEVs consume higher power from the grid during charging compared to conventional residential loads. Therefore, the emerging fleet of PEVs will introduce a considerable amount of additional load on power system. On the other hand, majority of PEVs are parked for more than 90% of the time, making them ideal for providing various services through Electric Vehicle Supply Equipment (EVSE), a.k.a. charging stations which are PEVs’ connection points to the power system. In this project, coordinated PEV charging are developed to provide distribution system services, considering PEV characteristics, realistic travel pattern, charging behaviors, and EVSE power rating and availability. The main efforts and contributions are summarized as follows. • Mobility models and EVSE charging capability/availability are indispensable for evaluating PEV charging coordination strategies and developing PEV charging control. Many existing studies utilize simplified mobility models assuming that the entire vehicle fleet returns home in the evening and is parked at home until the next morning. Some other PEV models better represent diversified home arrival and departure time, but cannot capture varying charging flexibility and capability at different locations, and therefore are not appropriate to study the impacts of public EVSE on PEV load and utilization. In this work, a mobility and charging flexibility model is proposed to better represent the temporal availability and varying charging capability from PEV onboard charger and EVSE. • Based on the mobility model, a generalized optimization method is proposed to evaluate different PEV charging coordination strategies. In existing literature, different algorithms and methods need to be designed to evaluate each charging strategy from both vehicle owners’ and system’s perspective. With the optimization method proposed in this work, different charging control strategies can be studied and compared by only updating objective functions. Moreover, optimization tricks are provided to convert the optimization problems to equivalent linear programming problems, which can be efficiently solved with existing solvers. • An innovative scheduling and control framework is proposed to enable smart PEV charging for grid services while meeting PEV owners’ travel needs. In the proposed framework, each set of EVSE is equipped with a controller that estimates charging power and energy flexibility based on vehicle characteristics, EVSE power rating, battery energy state, and upcoming trip information. With the simplified charging flexibility model received from each EVSE controller, the central coordinator determines the optimal power allocation for a look-ahead time window for the given grid services. The proposed charging control can help reduce the computational complexity and communication requirement compared with existing methods. It is also scalable to the expanding PEV fleet and robust to uncertainties in upcoming vehicle trips and future system condition. • The proposed charging strategy evaluation and smart charging control methods are applied to one of the prototypical feeders developed by the Pacific Northwest National Laboratory (PNNL) for case studies. Detailed trip information extracted from the National Household Travel Survey (NHTS) is used to represent travel and parking patterns. Different scenarios are simulated to evaluate the performance of the proposed methods and understand how PEV mobility and public EVSE availability affect PEV load and potential grid services.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗