Search NASASearch

SEARCH · Search NASA

Results for “Discrete 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 127 records · Page 7

Constant directions of the Riccati equation

A constant direction of the Riccati equation associated with a class of singular discrete-time optimization problems is defined. The set of constant directions is completely characterized using a control viewpoint. Constant directions are used to reduce the computational complexity of the optimal system. Application to optimal filtering in colored noise is given.

Rappaport, D.

The preview control problem with application to man-machine system analysis

The preview control problem is formulated in a general form and its solution is obtained. The analytical tool used is discrete stochastic optimal control theory. Aiming the application to manual control situations with preview, time delay, observation noise, motor noise, etc. were included in formulating the problem. Manual preview control experiments were performed to qualitatively check the validity of the model, and it was found that the mechanism of the manual control problem was explained by the developed model.

Tomizuka, M.

Four-dimensional guidance problem with control delays

This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.

Nagarajan, N.

An extension of the quickened display for manual control

It is very difficult (or even impossible) for a human to control plants of third order or more with little or no damping by just knowing the instantaneous error. It has been shown that adding first and/or higher order derivatives to the error signal and displaying the combined signal are effective in facilitating human control over such plants. This signal quickening technique by Birmingham and Taylor is further extended to incorporate the future trajectory variation into the displayed signal so as to minimize the tracking error. A method for tuning free parameters in ordinary and extended quickening is established by applying discrete-time optimal control. Experimental results for a triple integrator plant indicate the effectiveness of the proposed method to achieve high quality tracking.

Tomizuka, M.

Radiative Transfer Simulations of the Two-Dimensional Ocean Glint Reflectance and Determination of the Sea Surface Roughness

An optimized discrete-ordinate radiative transfer model (DISORT3) with a pseudo-two-dimensional bidirectional reflectance distribution function (BRDF) is used to simulate and validate ocean glint reflectances at an infrared wavelength (1036 nm) by matching model results with a complete set of BRDF measurements obtained from the NASA cloud absorption radiometer (CAR) deployed on an aircraft. The surface roughness is then obtained through a retrieval algorithm and is used to extend the simulation into the visible spectral range where diffuse reflectance becomes important. In general, the simulated reflectances and surface roughness information are in good agreement with the measurements, and the diffuse reflectance in the visible, ignored in current glint algorithms, is shown to be important. The successful implementation of this new treatment of ocean glint reflectance and surface roughness in DISORT3 will help improve glint correction algorithms in current and future ocean color remote sensing applications.

glint

Adaptive control based on retrospective cost optimization

A discrete-time adaptive control law for stabilization, command following, and disturbance rejection that is effective for systems that are unstable, MIMO, and/or nonminimum phase. The adaptive control algorithm includes guidelines concerning the modeling information needed for implementation. This information includes the relative degree, the first nonzero Markov parameter, and the nonminimum-phase zeros. Except when the plant has nonminimum-phase zeros whose absolute value is less than the plant's spectral radius, the required zero information can be approximated by a sufficient number of Markov parameters. No additional information about the poles or zeros need be known. Numerical examples are presented to illustrate the algorithm's effectiveness in handling systems with errors in the required modeling data, unknown latency, sensor noise, and saturation.

Santillo, Mario A.

A Framework for Optimization-Based ISRU Tool Design Using Discrete Element Modeling

Novel robotic excavation technologies are needed to perform in-situ resource utilization (ISRU) tasks at levels required to sustain a long-term presence on the lunar surface. Developing and testing multiple iterations of functional hardware is time and cost prohibitive, thus slowing down the pace of progress and delaying humanity’s settlement of the Moon. High-fidelity, physics-based simulation can reduce the time and effort required to develop and deploy robotic systems [1]. We have adopted this approach to create high-fidelity models of robotic test hardware to enable rapid virtual design and optimization of excavation technologies [2]. Such models can leverage modern computational tools like Discrete Element Method (DEM) simulations that can be coupled with automated design approaches like topology optimization to reduce the amount of prototyping and physical testing needed to realize useful tools.

ISRU

Implementation of Autonomous GPS Guidance and Control for Spacecraft Formation Flying

This paper presents the general relative orbit dynamics equations and GPS (Global Positioning System) orbit observational equations that have been developed for on-board control of spacecraft flying in formation. The approach to the implementation of the autonomous control for orbit acquisition and maintenance of spacecraft formation using GPS code pseudoranges are presented. As a practical application of the models and method provided in this paper, the orbit control of the Earth-Orbiter 1(EO-1) / Landsat 7 system has been designed, using the discrete-time linear optimal output feedback control. For the actuator of the on/off type reaction jets, the implementation problem of the pulse-amplitude modulation is also studied. Simulation results of autonomous orbit control and maintenance, for 3-dimensional initial orbit error, using optimal output feedback control are shown. These simulation results certified the feasibility of the implementation of the autonomous maintenance control for EO-1/Landsat 7 formation flying by means of the discrete-time linear optimal output feedback control.

Xing, Guang Q.

Optimal placement of excitations and sensors by simulated annealing

The optimal placement of discrete actuators and sensors is posed as a combinatorial optimization problem. Two examples for truss structures were used for illustration; the first dealt with the optimal placement of passive dampers along existing truss members, and the second dealt with the optimal placement of a combination of a set of actuators and a set of sensors. Except for the simplest problems, an exact solution by enumeration involves a very large number of function evaluations, and is therefore computationally intractable. By contrast, the simulated annealing heuristic involves far fewer evaluations and is best suited for the class of problems considered. As an optimization tool, the effectiveness of the algorithm is enhanced by introducing a number of rules that incorporate knowledge about the physical behavior of the problem. Some of the suggested rules are necessarily problem dependent.

Salama, Moktar

Optimization methods for passive damper placement and tuning

The effectiveness of viscous elements in introducing damping in a structure is a function of several variables, including their number, their location in the structure, and their physical properties. In this paper several optimization problems are posed to optimize these variables. The paper investigates various metrics to define the optimization problem, and compares the damping profiles that are obtained. Both discrete and continuous optimization problems are formulated and solved, corresponding, respectively, to the problems of placement of damping elements and to the tuning of their parameters. The paper particularly emphasizes techniques to make feasible the large scale problems resulting from the optimization formulations. Numerical results involving a lightly damped tested structure are presented.

Milman, M. H.

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.

Adjoint-Based Methodology for Time-Dependent Optimization

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

Yamaleev, N. K.

Smoothers for Optimization Problems

We present a multigrid one-shot algorithm, and a smoothing analysis, for the numerical solution of optimal control problems which are governed by an elliptic PDE. The analysis provides a simple tool to determine a smoothing minimization process which is essential for multigrid application. Numerical results include optimal control of boundary data using different discretization schemes and an optimal shape design problem in 2D with Dirichlet boundary conditions.

Arian, Eyal

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Gibson, J. S.

A Convex Guidance Algorithm for Formation Reconfiguration

In this paper, a reconfiguration guidance algorithm for formation flying spacecraft is presented. The formation reconfiguration guidance problem is first formulated as a continuous-time minimum-fuel or minimum-energy optimal control problem with collision avoidance and control constraints. The optimal control problem is then discretized to obtain a finite dimensional parameter optimization problem. In this formulation, the collision avoidance constraints are imposed via separating planes between each pair of spacecraft. A heuristic is introduced to choose these separating planes that leads to the convexification of the collision avoidance constraints. Additionally, convex constraints are imposed to guarantee that no collisions occur between discrete time samples. The resulting finite dimensional optimization problem is a second order cone program, for which standard algorithms can compute the global optimum with deterministic convergence and a prescribed level of accuracy. Consequently, the formation reconfiguration algorithm can be implemented onboard a spacecraft for real-time operations.

formation reconfiguration