Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 811 records · Page 45

CAN-D: A Modular Four-Step Pipeline for Comprehensively Decoding Controller Area Network Data

Controller area networks (CANs) are a broadcast protocol for real-time communication of critical vehicle subsystems. Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable, severely impeding vehicle-related research, including CAN cybersecurity and privacy studies, aftermarket tuning, efficiency and performance monitoring, and fault diagnosis to name a few. Guided by the four-part CAN signal definition, we present CAN-D (CAN-Decoder), a modular, four-step pipeline for identifying each signal's boundaries (start bit and length), endianness (byte ordering), signedness (bit-to-integer encoding), and by leveraging diagnostic standards, augmenting a subset of the extracted signals with meaningful, physical interpretation. En route to CAN-D, we provide a comprehensive review of the CAN signal reverse engineering research. All previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions. Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. In response, we formulate, formally analyze, and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. In addition, we provide two novel, state-of-the-art signal boundary classifiers—both of which are superior to previous approaches in precision and recall in three different test scenarios—and the first signedness classification algorithm, which exhibits a $>$ 97% F-score. Altogether, CAN-D is the only solution with the potential to extract any CAN signal that is also the state of the art. In evaluation on 10 vehicles of different makes, CAN-D's average $\ell ^1$ error is five times better (81% less) than all previous methods and exhibits lower average error, even when considering only signals that meet prior methods’ assumptions. Finally, CAN-D is implemented in lightweight hardware, allowing for an on-board diagnostic (OBD-II) plugin for real-time in-vehicle CAN decoding.

42 ENGINEERING↗

Tools for analysis of optimization models

The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.

Parker, Robert↗

Energy-Efficient and Comfortable Buildings through Multivariate Integrated Control (ECoMIC)

This project aims to develop an integrated control solution for enhanced energy efficiency and user comfort in commercial buildings. The developed technology is a zone-based control framework that minimizes energy usage while maintaining occupants’ visual and thermal comfort through control of electric lights, motorized venetian blinds and thermostats. The control framework is designed following a modular, scalable and flexible architecture to facilitate easy integration with exiting building management systems. The control framework contains two key algorithms: 1) the lighting load balancing algorithm and 2) the thermostat control algorithm. The lighting load balancing algorithm adopts a model-based closed-loop control approach to determine the optimal electric light and venetian blind settings. It is formulated into an optimization problem with minimizing lighting-related energy consumptions as the objective and delivering adequate task light and preventing daylight glare as the constraints. The thermostat control algorithm is based on a well-established thermal comfort model and formulated as a root-finding problem to dynamically determine the optimal thermostat setpoint for both energy savings and improved thermal comfort. To address building-wide scalability, a system architecture was developed for the zone-based control technology. Three levels of services are defined in the architecture: external services, facility level services and zone level services. The zone-level service includes the control algorithms described above as well as the corresponding interfaces, profiles, sensors and actuators to realize the zone controller. The facility level services connect to the zones through a backbone network, handle supervisory level information and controls, and thus facilitate building-wide scalability. The external services provide communication capability to entities outside of the building for grid interaction and remote access. Various aspects of the developed control technology were evaluated and verified through both simulations and testbed implementations. Simulations coupling a DOE medium office reference building in EnergyPlus building simulation software and a prototype controller in Matlab were performed. During summer time in a mixed-humid climate zone, the simulations revealed reductions of 27% and 42% in electric lighting load and cooling load, respectively, when compared to an advanced base case with daylight dimming and blinds automatically tilted to block direct sun. Two single-room testbeds were established. The testbed at Philips Lighting business building (Rosemont, IL) was designed for quantifying energy performance of integrated controls. This particular implementation achieved 40% and 79% savings on lighting and HVAC energy, respectively, compared to a relatively simple base case operated on predefined schedules. While the resulting energy savings was very encouraging, it should be noted that there may be several caveats associated with it. 1) The test was run during late spring and early summer, and the savings numbers might not be directly used to extrapolate the annual energy savings. 2) Due to the needs for separate control and metering of the small-scale demonstrator within a large building, the HVAC system, hence the corresponding savings, did not represent a typical energy code-compliant design. 3) The light level in the control case was regulated at a particular setpoint, which was lower than then the full-on light level in the base case, and the savings resulted from tuning down the light level to the setpoint was not attributable to the contribution of the developed technology. The testbed at the Lawrence Berkeley National Laboratory (Berkeley, CA) specifically focused on glare control integration, and has demonstrated the feasibility and capability of the glare detection and prevention technique. While the short one-month test in this testbed provided a functional indication of the developed technology, and it would require at least a full solstice-to-solstice cycle to ruinously quantify the performance, which was not possible within the project timeframe. There are certain limitations inherited from the operational assumptions, which could potentially affect the effectiveness and applicability of the developed control technologies. The system takes a typical ceiling-mounting approach for the photosensor locations, and therefore, the control performance relies on proper commissioning or the built-in intelligence of the photosensor for pertinent task light level estimations. For spaces where daylight penetration diminishes significantly deeper into the zone, certain modification to the control algorithms is required to accommodate multiple lighting control subzones and the corresponding sensors for providing a more uniform light level across the entire zone. Integrated control of visual and thermal comfort requires the lighting control zone and thermal control zone to coincide with each other. In other words, the area illuminated by a lighting circuit needs to be the same area served by the thermostat. Thus, the original zoning will potentially constrain the applicability of this technology in retrofitting projects. This project demonstrated the technical feasibility of a zone-based integrated control technology. From the simulation results and testbed implementations, up to 60% lighting energy savings in daylit areas relative to a “no-controls” case can easily be achieved. A 20% reduction of whole building energy consumption is also attainable. In the aspect of occupant comfort, the testbed demonstrated the ability to maintain specified light level on the workplane while promptly mitigate daylight glare 90% of the time. The control system also managed to maintain the thermal environment at a comfortable level 90% of the time. The aspect of system scalability was guaranteed by the system architecture design, based on which the testbeds were instantiated. Analysis on the aspect of economic benefit has yielded an about 6-year payback time for a medium-sized building, including the installation of all hardware and software, such as motorized blinds and LED luminaires. The payback time can be significantly reduced if part of the hardware is already in place for retrofitting projects. It needs to be noted that since the payback analysis was partly based on the testbed performance results, it is constrained by the caveats associated with the testbed implementations. The main uncertainty lies in the contribution from the space conditioning energy savings as it was non-trivial to realistically configure a room-size HVAC system for directly extrapolating whole-building HVAC energy savings. It is recommended to further evaluate the developed technology at a larger scale, where the lighting and HVAC energy consumption can be realistically measured at the building level, to more rigorously quantify the performance potentials.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Methodology for Exploring Water and Hydropower Operating Criteria That Simultaneously Improve Economic and Environmental Considerations

Despite the reliability and flexibility of hydropower, the operation of hydroelectric power plants may have significant impacts on the downstream river system, including its water stage, sediment transport, and water temperature, ultimately affecting the ecology. To address these challenges, there is a need to identify water scheduling patterns that improve both hydropower economics and the environment relative to current operations. This paper presents a new methodology to explore promising operational criteria/rules that can achieve such improvements. Typical environmental impact statements and relicensing processes generally perform detailed site-specific analyses of a few alternatives that focus on reservoir water release operating rules and their associated environmental impacts. In contrast, the methodology presented in this article uses a widely applicable approach that explores a much larger solution space. This large set of potential alternatives can be represented in a multidimensional space for which one axis represents the economic value and the other axis quantify individual environmental impacts (e.g., sediment transport and fish growth), and they are explored via two approaches: a Monte Carlo simulation that identifies “win–win” alternatives and a multi-objective optimization problem that identifies Pareto-optimal alternatives.

13 HYDRO ENERGY↗

Particle orbits in a rotating liquid

The motion of small spherical particles under gravity, in a viscous fluid rotating uniformly about a horizontal axis, is investigated. Formulations and solutions are obtained for the particle orbit problem and the rotation rate optimization problem. It was found that the rotation rate which maximizes the fraction of the reactor cross-section area containing particles that will not spiral out to the wall in the experimental time (for heavy particles), or that have spiraled inward without hitting the wall (for light particles) is close to 1 rpm.

Roberts, Glyn O.↗

Implementation and Performance Issues in Collaborative Optimization

Collaborative optimization is a multidisciplinary design architecture that is well-suited to large-scale multidisciplinary optimization problems. This paper compares this approach with other architectures, examines the details of the formulation, and some aspects of its performance. A particular version of the architecture is proposed to better accommodate the occurrence of multiple feasible regions. The use of system level inequality constraints is shown to increase the convergence rate. A series of simple test problems, demonstrated to challenge related optimization architectures, is successfully solved with collaborative optimization.

Braun, Robert↗

New approaches for efficient solution of hitting set problem

A new method for solving the hitting set problem is proposed. This method is based on the mapping of the problem onto an integer programming optimization problem. this new approach provides an algorithm with much better performance compare to the algorithms for the hitting set problem that currently are used for solving the diagnosis problem.

integer programming↗

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗

How to cluster in parallel with neural networks

Partitioning a set of N patterns in a d-dimensional metric space into K clusters - in a way that those in a given cluster are more similar to each other than the rest - is a problem of interest in astrophysics, image analysis and other fields. As there are approximately K(N)/K (factorial) possible ways of partitioning the patterns among K clusters, finding the best solution is beyond exhaustive search when N is large. Researchers show that this problem can be formulated as an optimization problem for which very good, but not necessarily optimal solutions can be found by using a neural network. To do this the network must start from many randomly selected initial states. The network is simulated on the MPP (a 128 x 128 SIMD array machine), where researchers use the massive parallelism not only in solving the differential equations that govern the evolution of the network, but also by starting the network from many initial states at once, thus obtaining many solutions in one run. Researchers obtain speedups of two to three orders of magnitude over serial implementations and the promise through Analog VLSI implementations of speedups comensurate with human perceptual abilities.

Kamgar-Parsi, Behzad↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms

This paper presents a distributed approach to performing real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically, and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approaching real-time control/optimization.

17 WIND ENERGY↗

Parallel Computational Environment for Substructure Optimization

Design optimization of large structural systems can be attempted through a substructure strategy when convergence difficulties are encountered. When this strategy is used, the large structure is divided into several smaller substructures and a subproblem is defined for each substructure. The solution of the large optimization problem can be obtained iteratively through repeated solutions of the modest subproblems. Substructure strategies, in sequential as well as in parallel computational modes on a Cray YMP multiprocessor computer, have been incorporated in the optimization test bed CometBoards. CometBoards is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for Design of Structures. Three issues, intensive computation, convergence of the iterative process, and analytically superior optimum, were addressed in the implementation of substructure optimization into CometBoards. Coupling between subproblems as well as local and global constraint grouping are essential for convergence of the iterative process. The substructure strategy can produce an analytically superior optimum different from what can be obtained by regular optimization. For the problems solved, substructure optimization in a parallel computational mode made effective use of all assigned processors.

Gendy, Atef S.↗

Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification

We present that identification of radioisotopic signature patterns in gamma-ray spectra is of paramount importance in various applications of gamma spectroscopy. Therefore, there are several active research efforts to develop accurate and precise methods to perform automated spectroscopic analysis and subsequently recognize gamma-ray signatures. In this work, the authors present a new method for radioisotope identification in gamma-ray spectra obtained with a low resolution radiation detector. The method fits the obtained spectrum with a linear combina-tion of known template signature patterns. Coefficients of the linear combination are evaluated by computing the solution of a single objective optimization problem, whose objective is the Theil-1 inequality coefficient. Optimization of the problem is performed by the Fireworks Algorithm, which identifies a set of coefficients that minimize the Theil-1 value. The computed coefficients are statistically tested for being significantly different than zero or not, and if at least one is found to be zero then the Fireworks Algorithm is used to reiterate fitting using the non-zero templates. Fitting iterations are continued up to the point that no linear coefficients are found to be zero. The output of the method is a list that contains the radioisotopes that have been identified in the measured spectrum. The method is tested on a set of both simulated and real experimental gamma-ray spectra comprised of a variety of isotopes, and compared to a multiple linear regression fitting, and genetic algorithm Theil-1 based fitting. Finally, results demonstrate the potentiality of the Fireworks Algorithm based method, expressed as higher accuracy and similar precision over the other two tested methodologies for radioisotope signature pattern identification in the framework of gamma-ray spectrum fitting.

Theil Coefficient↗

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗

Analytical and Computational Aspects of Collaborative Optimization

Bilevel problem formulations have received considerable attention as an approach to multidisciplinary optimization in engineering. We examine the analytical and computational properties of one such approach, collaborative optimization. The resulting system-level optimization problems suffer from inherent computational difficulties due to the bilevel nature of the method. Most notably, it is impossible to characterize and hence identify solutions of the system-level problems because the standard first-order conditions for solutions of constrained optimization problems do not hold. The analytical features of the system-level problem make it difficult to apply conventional nonlinear programming algorithms. Simple examples illustrate the analysis and the algorithmic consequences for optimization methods. We conclude with additional observations on the practical implications of the analytical and computational properties of collaborative optimization.

Alexandrov, Natalia M.↗

A feedback linearization approach to spacecraft control using momentum exchange devices

Recent developments in the area of nonlinear control theory have shown how coordiante changes in the state and input spaces can be used with nonlinear feedback to transform certain nonlinear ordinary differential equations into equivalent linear equations. These feedback linearization techniques are applied to resolve two problems arising in the control of spacecraft equipped with control moment gyroscopes (CMGs). The first application involves the computation of rate commands for the gimbals that rotate the individual gyroscopes to produce commanded torques on the spacecraft. The second application is to the long-term management of stored momentum in the system of control moment gyroscopes using environmental torques acting on the vehicle. An approach to distributing control effort among a group of redundant actuators is described that uses feedback linearization techniques to parameterize sets of controls which influence a specified subsystem in a desired way. The approach is adapted for use in spacecraft control with double-gimballed gyroscopes to produce an algorithm that avoids problematic gimbal configurations by approximating sets of gimbal rates that drive CMG rotors into desirable configurations. The momentum management problem is stated as a trajectory optimization problem with a nonlinear dynamical constraint. Feedback linearization and collocation are used to transform this problem into an unconstrainted nonlinear program. The approach to trajectory optimization is fast and robust. A number of examples are presented showing applications to the proposed NASA space station.

Dzielski, John Edward↗

Neural networks: What non-linearity to choose

Neural networks are now one of the most successful learning formalisms. Neurons transform inputs (x(sub 1),...,x(sub n)) into an output f(w(sub 1)x(sub 1) + ... + w(sub n)x(sub n)), where f is a non-linear function and w, are adjustable weights. What f to choose? Usually the logistic function is chosen, but sometimes the use of different functions improves the practical efficiency of the network. The problem of choosing f as a mathematical optimization problem is formulated and solved under different optimality criteria. As a result, a list of functions f that are optimal under these criteria are determined. This list includes both the functions that were empirically proved to be the best for some problems, and some new functions that may be worth trying.

Kreinovich, Vladik YA.↗