Search NASA⌕ Search

SEARCH · Search NASA

Results for “distribution system 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Model Predictive Optimal Control of a Time-Delay Distributed-Parameter Systems

This paper presents an optimal control method for a class of distributed-parameter systems governed by first order, quasilinear hyperbolic partial differential equations that arise in many physical systems. Such systems are characterized by time delays since information is transported from one state to another by wave propagation. A general closed-loop hyperbolic transport model is controlled by a boundary control embedded in a periodic boundary condition. The boundary control is subject to a nonlinear differential equation constraint that models actuator dynamics of the system. The hyperbolic equation is thus coupled with the ordinary differential equation via the boundary condition. Optimality of this coupled system is investigated using variational principles to seek an adjoint formulation of the optimal control problem. The results are then applied to implement a model predictive control design for a wind tunnel to eliminate a transport delay effect that causes a poor Mach number regulation.

Nguyen, Nhan↗
NASA NTRS2004

Adaptive Multi-Agent Systems for Constrained Optimization

Product Distribution (PD) theory is a new framework for analyzing and controlling distributed systems. Here we demonstrate its use for distributed stochastic optimization. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. The updating of the Lagrange parameters in the Lagrangian can be viewed as a form of automated annealing, that focuses the MAS more and more on the optimal pure strategy. This provides a simple way to map the solution of any constrained optimization problem onto the equilibrium of a Multi-Agent System (MAS). We present computer experiments involving both the Queen s problem and K-SAT validating the predictions of PD theory and its use for off-the-shelf distributed adaptive optimization.

Macready, William↗
NASA NTRS1990

Factorization and the synthesis of optimal feedback gains for distributed parameter systems

An approach based on Volterra factorization leads to a new methodology for the analysis and synthesis of the optimal feedback gain in the finite-time linear quadratic control problem for distributed parameter systems. The approach circumvents the need for solving and analyzing Riccati equations and provides a more transparent connection between the system dynamics and the optimal gain. The general results are further extended and specialized for the case where the underlying state is characterized by autonomous differential-delay dynamics. Numerical examples are given to illustrate the second-order convergence rate that is derived for an approximation scheme for the optimal feedback gain in the differential-delay problem.

Milman, Mark H.↗
NASA NTRS1988

A strategy for reducing turnaround time in design optimization using a distributed computer system

There is a need to explore methods for reducing lengthly computer turnaround or clock time associated with engineering design problems. Different strategies can be employed to reduce this turnaround time. One strategy is to run validated analysis software on a network of existing smaller computers so that portions of the computation can be done in parallel. This paper focuses on the implementation of this method using two types of problems. The first type is a traditional structural design optimization problem, which is characterized by a simple data flow and a complicated analysis. The second type of problem uses an existing computer program designed to study multilevel optimization techniques. This problem is characterized by complicated data flow and a simple analysis. The paper shows that distributed computing can be a viable means for reducing computational turnaround time for engineering design problems that lend themselves to decomposition. Parallel computing can be accomplished with a minimal cost in terms of hardware and software.

Young, Katherine C.↗
NASA NTRS1989

Optimal dynamic control of resources in a distributed system

The authors quantitatively formulate the problem of controlling resources in a distributed system so as to optimize a reward function and derive optimal control strategies using Markov decision theory. The control variables treated are quite general; they could be control decisions related to system configuration, repair, diagnostics, files, or data. Two algorithms for resource control in distributed systems are derived for time-invariant and periodic environments, respectively. A detailed example to demonstrate the power and usefulness of the approach is provided.

Shin, Kang G.↗
NASA NTRS1989

Comparison of joint space versus task force load distribution optimization for a multiarm manipulator system

It is often proposed that the redundancy in choosing a force distribution for multiple arms grasping a single object should be handled by minimizing a quadratic performance index. The performance index may be formulated in terms of joint torques or in terms of the Cartesian space force/torque applied to the body by the grippers. The former seeks to minimize power consumption while the latter minimizes body stresses. Because the cost functions are related to each other by a joint angle dependent transformation on the weight matrix, it might be argued that either method tends to reduce power consumption, but clearly the joint space minimization is optimal. A comparison of these two options is presented with consideration given to computational cost and power consumption. Simulation results using a two arm robot system are presented to show the savings realized by employing the joint space optimization. These savings are offset by additional complexity, computation time and in some cases processor power consumption.

Soloway, Donald I.↗
NASA NTRS1971

Two examples in the time optimal control theory of distributed parameter systems.

The behavior of hyperbolic and parabolic partial differential equations is contrasted by studying the point-to-point time-optimal control problem for the equation of heat conduction and the equation of motion of a vibrating string. A maximal principle is obtained for the time-optimal control of the one-dimensional heat equation, and it is proven that time optimal controls are weakly bang-bang. The bang-bang principle is proven to be invalid for hyperbolic equations because of the finite speed of wave propagation. In the case of boundary value control of the vibrating spring, the latter is demonstrated by deriving an explicit formula for the time optimal control.

Quinn, J. P.↗
NASA NTRS1982

Optimal control of distributed parameter elastic systems

This paper presents an analytical solution to the Riccati equation for self-adjoint systems such as beams, plates, strings and membranes moving in space, and shows how the optimal control law can be implemented using the given solution. It is then shown that there always exists a self-adjoint operator describing the distribution of potential energy if the state space is appropriately augmented. A beam-like gravity-stabilized satellite moving in a circular orbit around the earth is used to illustrate the main results in this paper.

Juang, J.-N.↗
NASA NTRS1984

Chandrasekhar equations and computational algorithms for distributed parameter systems

The Chandrasekhar equations arising in optimal control problems for linear distributed parameter systems are considered. The equations are derived via approximation theory. This approach is used to obtain existence, uniqueness, and strong differentiability of the solutions and provides the basis for a convergent computation scheme for approximating feedback gain operators. A numerical example is presented to illustrate these ideas.

Burns, J. A.↗
NASA NTRS1974

Analysis of three-dimensional unsteady flow around oscillating wings

A method based on the Navier-Stokes equations was developed for determining analytically the three-dimensional unsteady flow patterns around oscillating wings. The Helmholz vorticity transport equations were discretized in three-dimensional finite element form from a variational formulation and integrated numerically. At each time step of the numerical integration the velocity field was calculated from the representation of the three-dimensional wing by a system of optimized distribution of vortices in space. During the numerical integration of the vorticity transport equations the time-dependent boundary conditions on the wing were specified as external constraint conditions. Examples of obtained results describing the three-dimensional unsteady flow around a wing were presented.

Bratanow, T.↗
NASA NTRS1999

A Survey of Collective Intelligence

This chapter presents the science of "COllective INtelligence" (COIN). A COIN is a large multi-agent systems where: i) the agents each run reinforcement learning (RL) algorithms; ii) there is little to no centralized communication or control; iii) there is a provided world utility function that, rates the possible histories of tile full system. Tile conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather that approach begins with explicit modeling of the overall system's dynamics, followed by detailed hand-tuning of the interactions between the components to ensure that they "cooperate" as far as the world utility is concerned. This approach is labor-intensive, often results in highly non-robust systems, and usually results in design techniques that, have limited applicability. In contrast, with COINs we wish to solve the system design problems implicitly, via the 'adaptive' character of the RL algorithms of each of the agents. This COIN approach introduces an entirely new, profound design problem: Assuming the RL algorithms are able to achieve high rewards, what reward functions for the individual agents will, when pursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of the commons, or Braess's paradox? Although still very young, the science of COINs has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur's "El Farol bar problem". It is expected that as it matures not only will COIN science expand greatly the range of tasks addressable by human engineers, but it will also provide much insight into already established scientific fields, such as economics, game theory, or population biology.

Wolpert, David H.↗
NASA NTRSDate not supplied

Real-Time Drag Optimization of Aspect Ratio 13.5 Common Research Model with Distributed Flap System

This paper presents a real-time drag optimization study of the aspect ratio 13.5 Common Research Model (CRM) with a distributed mini-plain flap system. A surrogate aerodynamic model of the aspect ratio 13.5 CRM is developed based on an aerodynamic database computed by a transonic panel method to capture the aerodynamic coefficients as functions of the angle of attack, flap deflections, and Mach number. A recursive least-squares parameter estimation algorithm is designed to estimate the aerodynamic parameters of the surrogate model. The estimated surrogate model is then used in an on-line drag optimization strategy based on an adjoint method. The results of the real-time drag optimization indicate a drag reduction of 2.46% for Mach 0.80, 3.37% for Mach 0.85, and 1.95% for Mach 0.88. The results show the convergence of all parameter estimates.

Drag Optimization↗
NASA NTRS1974

A minimum principle for smooth first-order distributed systems

Consideration of the problem of characterizing optimal controls for a class of distributed parameter systems. The system dynamics are characterized mathematically by a finite number of coupled partial differential equations involving first-order time and space derivatives of the state variables. Boundary conditions on the state are in the form of a finite number of algebraic relations between the state and boundary control variables. A few directions are outlined in which the results obtained may be extended further.

Johnson, T. L.↗
NASA NTRS1971

Optimization of life support systems and their systems reliability

The identification, analysis, and optimization of life support systems and subsystems have been investigated. For each system or subsystem that has been considered, the procedure involves the establishment of a set of system equations (or mathematical model) based on theory and experimental evidences; the analysis and simulation of the model; the optimization of the operation, control, and reliability; analysis of sensitivity of the system based on the model; and, if possible, experimental verification of the theoretical and computational results. Research activities include: (1) modeling of air flow in a confined space; (2) review of several different gas-liquid contactors utilizing centrifugal force: (3) review of carbon dioxide reduction contactors in space vehicles and other enclosed structures: (4) application of modern optimal control theory to environmental control of confined spaces; (5) optimal control of class of nonlinear diffusional distributed parameter systems: (6) optimization of system reliability of life support systems and sub-systems: (7) modeling, simulation and optimal control of the human thermal system: and (8) analysis and optimization of the water-vapor eletrolysis cell.

Fan, L. T.↗
NASA NTRS1994

Optimal pattern distributions in Rete-based production systems

Since its introduction into the AI community in the early 1980's, the Rete algorithm has been widely used. This algorithm has formed the basis for many AI tools, including NASA's CLIPS. One drawback of Rete-based implementation, however, is that the network structures used internally by the Rete algorithm make it sensitive to the arrangement of individual patterns within rules. Thus while rules may be more or less arbitrarily placed within source files, the distribution of individual patterns within these rules can significantly affect the overall system performance. Some heuristics have been proposed to optimize pattern placement, however, these suggestions can be conflicting. This paper describes a systematic effort to measure the effect of pattern distribution on production system performance. An overview of the Rete algorithm is presented to provide context. A description of the methods used to explore the pattern ordering problem area are presented, using internal production system metrics such as the number of partial matches, and coarse-grained operating system data such as memory usage and time. The results of this study should be of interest to those developing and optimizing software for Rete-based production systems.

Scott, Stephen L.↗