Sub-optimal control of discrete systems with bounded state and control variables
Suboptimal control of discrete input system with bounded state and control variables, developing algorithm for on-line computation
SEARCH · Engineering Papers
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.
Suboptimal control of discrete input system with bounded state and control variables, developing algorithm for on-line computation
Optimum estimates of nonobservable random variables or random processes which influence the rate functions of a discrete time jump process (DTJP) are obtained. The approach is based on the a posteriori probability of a nonobservable event expressed in terms of the a priori probability of that event and of the sample function probability of the DTJP. A general representation for optimum estimates and recursive equations for minimum mean squared error (MMSE) estimates are obtained. MMSE estimates are nonlinear functions of the observations. The problem of estimating the rate of a DTJP when the rate is a random variable with a probability density function of the form cx super K (l-x) super m and show that the MMSE estimates are linear in this case. This class of density functions explains why there are insignificant differences between optimum unconstrained and linear MMSE estimates in a variety of problems.
Optimum estimates of nonobservable random variables or random processes which influence the rate functions of a discrete time jump process (DTJP) are derived. The approach used is based on the a posteriori probability of a nonobservable event expressed in terms of the a priori probability of that event and of the sample function probability of the DTJP. Thus a general representation is obtained for optimum estimates, and recursive equations are derived for minimum mean-squared error (MMSE) estimates. In general, MMSE estimates are nonlinear functions of the observations. The problem is considered of estimating the rate of a DTJP when the rate is a random variable with a beta probability density function and the jump amplitudes are binomially distributed. It is shown that the MMSE estimates are linear. The class of beta density functions is rather rich and explains why there are insignificant differences between optimum unconstrained and linear MMSE estimates in a variety of problems.
A general first-order dynamic representation for discrete systems with several independent variables is proposed, based on the Dieudonne-Rashevsky form for partial differential equations. This representation does not restrict consideration to causal systems. A minimum principle for such systems is proved, thus extending results known for discrete-time systems to the case of several independent variables. The proof requires only the classical implicit function theorem.
Research on optimization-based design is discussed. Illustrative examples are given for cases involving continuous optimization with discrete variables and optimization with tolerances. Approximation of computationally expensive and noisy functions, electromechanical actuator/control system design using decomposition and application of knowledge-based systems and optimization for the design of a valve anti-cavitation device are among the topics covered.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Deadbeat control theory gives a feedback solution to the time optimal control of discrete time systems. Experience has shown the results to be impractical because they ignore bounds on the actuator strength. This paper develops two algorithms for generating time optimal control in feedback form for discrete systems with bounded controls. The results are also applicable for generating recovery regions and the set of reachable states. For multiple control problems a method of generating sublayers is developed which decreases off-line and on-line computational effort. Two algorithms are presented with somewhat different computational and storage requirements. The algorithms are practical within certain dimension constraints, and are natural for implementation with parallel processing.
In this paper, we present the new discrete optimization-based interface-aware sub-scale dynamics (IA-SSD) closure model for multimaterial cells for Lagrangian cell-centered hydrodynamics. For the multimaterial cell, the kinematic and thermodynamic properties (e.g., velocity, density, pressure and internal energy) will typically vary between the materials. The discrete closure model is responsible for an accurate update of the thermodynamic states of the individual material components in the multimaterial cell, and for determining the nodal forces that move the vertices of the cell. The IA-SSD closure model consists of two stages — a bulk stage followed by a sub-scale stage. During the bulk stage, the total change in the volume of the cell, total force applied to the cell, and total work done on the cell are distributed between the materials to update their volume, velocity and total energy. This distribution is performed using volume fractions of the materials. During the second stage, sub-scale interactions of the materials inside the multimaterial cell are taken into account. At this stage, information about the topology of the materials inside the multimaterial cell is used, allowing the orientations of internal interfaces to be included in the model. Each material interacts in a pair-wise fashion with the materials with which it has a common boundary. The interactions are based on the solution of the acoustic Riemann problem between each pair of materials and are limited using physically justified constraints: positivity of volume, positivity of internal energy, and controlled rate of pressure relaxation. To determine the values of the limiter coefficients, a constrained-optimization framework is employed using a quadratic objective function with linear constraints. It is a first-of-its kind application of constrained optimization to develop discrete closure models in a more rigorous fashion. The pair-wise interaction between materials is essentially one dimensional in the direction that is normal to interface. Finally, for this reason, we demonstrate in this paper the performance of our new model on one dimensional numerical examples.
Discrete time differential dynamic programming algorithm with application to optimal orbit transfer
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
Maximum principle in optimization of discrete time systems described by difference equations
In this paper, we consider the global optimal consensus problem for discrete-time multi-agent systems with bounded control protocols over xed undirected communication networks. Each agent is described by a discrete-time single integrator and endowed with a quadratic objective function which is private to itself. For each agent, we develop two bounded distributed protocols: bounded proportional-integral (PI) protocol and bounded integral (I) protocol, based on information receiving from its neighboring agents through the communication network and the gradient of its own objective function. We show that the proposed bounded distributed protocols with properly chosen parameters solve the global optimal consensus problem if the communication network is connected, i.e., the multi-agent system achieves consensus at a state that minimizes the sum of the objective functions of all agents. The theoretical results are illustrated by numerical simulations.
Not provided.
Comparing a discrete molecular spectrum to a continuous molecular spectrum in a quantitative manner is a challenging problem, for example, when attempting to fit a theoretical stick spectrum to a continuous spectrum. In this paper, the use of computational optimal transport is investigated for such a problem. In the optimal transport literature, the comparison of a discrete and a continuous spectrum is referred to as semi-discrete optimal transport and is a situation where a metric such as least-squares may be difficult to define except under special conditions. The merits of an optimal transport approach for this problem are investigated using the transport distance defined for the semi-discrete case. A tutorial on semi-discrete optimal transport for molecular spectra is included in this paper, and several well-chosen synthetic spectra are investigated to demonstrate the utility of computational optimal transport for the semi-discrete case. Among several types of investigations, we include calculations showing how the frequency resolution of the continuous spectrum affects the transport distance between a discrete and a continuous spectrum. We also use the transport distance to measure the distance between a continuous experimental electronic absorption spectrum of SO 2 and a theoretical stick spectrum for the same system. The comparison of the theoretical and experimental SO 2 spectra also allows us to suggest a theoretical value for the band origin that is closer to the observed band origin than previous theoretical values.