Application of C-minimax optimal control theory to flight control problems.
Spacecraft and large launch vehicle nonoptimal /suboptimal/ controllers evaluated with Chebyshev minimax optimal control theory
SEARCH · Search NASA
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.
Spacecraft and large launch vehicle nonoptimal /suboptimal/ controllers evaluated with Chebyshev minimax optimal control theory
This article discusses a discrete-time dynamical system consisting of a set a controllable objects (region and forming it municipalities). The dynamics each of these is described by the corresponding vector nonlinear discrete-time recurrent vector equations and its control system consist from two levels: basic (control level I) that is dominating and subordinate level (control level II). Both levels have different criterions of functioning and united a priori by determined informational and control connections defined in advance. In this paper we study the problem of optimization of guaranteed result for program control by the final state of regional social and economic system in the presence of risks. For this problem we proposed in this work an economical and mathematical model of two-level hierarchical minimax program control the final state of regional social and economic system in the presence of risks and the general scheme for its solving.
The problem of controlling a time-invariant system with parameter uncertainty is considered with incomplete state feedback. The controller is designed by minimaximizing a quadratic performance criterion and a sensitivity (or loss) criterion, involving the state of the system, the control, and the uncertainty vector. The resulting optimal controller is linear and optimal feedback gain matrix must satisfy a set of nonlinear algebraic equations. some algorithms for algebraic minimax problems are presented.
We prove the missing uniqueness theorem for the viscosity solution of a quasi-variational inequality related to a minimax impulse control problem modeling the option pricing with proportional transactions costs. This result makes our robust control approach of option pricing in the interval market model essentially complete.
Classical and minimax optimal control problems arising in the study of aeroassisted coplanar orbit transfer from a high planetary orbit to a low one are considered. Attention is given to (1) the minimization of the energy required for the maneuver; (2) minimization of the time integral of the heating rate; (3) minimization of the time of flight during the atmospheric portion of the trajectory; (4) maximization of the time of flight during the atmospheric portion of the trajectory; (5) minimization of the time integral of the path inclination; and (6) minimization of the sum of the squares of the entry and exit path inclinations.
This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.
Optimal trajectories for hypervelocity flight of interest in aeroassisted orbital transfer are discussed. Both coplanar and noncoplanar transfer are studied. More precisely, the geosynchronous-earth-orbit-, high-earth orbit- and low-earth-orbit-to-low earth-orbit transfers are considered in connection with a spacecraft that is controlled during the atmospheric pass by the angle of attack (coplanar case) or by the angle of attack and the angle of bank (noncoplanar case). Within the framework of classical optimal control, the following problems are studied: minimize the energy required for orbital transfer; maximize the time of flight during the atmospheric portion of the trajectory; and minimize the time integral of the square of the path inclination. Within the framework of minimax optimal control, the problem studied is to minimize the peak rate. Numerical solutions for the problems are obtained by means of the sequential gradient-restoration algorithm. The engineering implications of the results are discussed.
This paper presents the problem of clock skew and offset estimation for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Because of the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of clock skew and offset estimation schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity.
Optimal design procedure as experimental design finite decision problem, using Bayes and minimax techniques
Unilateral and minimax control with functional restrictions, including pursuit and evasion games
We consider a discrete dynamical system consisting of a number of controllable objects whose dynamics is governed by vector nonlinear discrete recurrent relations with control parameters and perturbations (noises). In such system, two levels of making management decisions are distinguished: the dominating (first) level and the subordinate (second) level, which have different criteria of functioning. These levels are integrated by certain information and control relations. We consider the problem of two-level minimax program terminal control in a discrete dynamical system and propose its mathematical statement and a general scheme of its solution.
The optimal ascent problem for an aerospace planes is formulated as an optimal inverse dynamic problem. Both minimum-fuel and minimax type of performance indices are considered. Some important features of the optimal trajectory and controls are used to construct a nonlinear feedback midcourse controller, which not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suited for onboard implementation. Robust ascent guidance is obtained by using combination of feedback compensation and onboard generation of control through the inverse dynamics approach. Accurate orbital insertion can be achieved with near-optimal control of the rocket through inverse dynamics even in the presence of disturbances.
A minimax design method is applied to the problem of obtaining an acceptable output feedback matrix for linear multivariable systems with parameter uncertainty. The result is a set of nonlinear matrix equations (similar to those obtained by Levine and Athans (1970)), which must be solved for the feedback matrix. An example illustrates the technique and the fact that better results are achieved for large parameter variation than with a purely nominal design.
The study proposes a stochastic optimisation approach based on discrete scenarios and the minimax criterion to deal with demand uncertainty in the two-stage unit commitment problem. To avoid making an over-conservative decision, the approach is designed to assign a probability-based weight to each demand scenario and provide a unit commitment schedule that minimises the maximum possible-weighted generation cost. Unit commitment is determined in the first stage and the economic dispatch under the scenario that corresponds to the maximum possible-weighted generation cost is determined in the second stage. The problem is formulated as a type of min-max-min mixed integer programming model. By introducing an auxiliary variable, the model is further transformed into a minimisation problem. A Benders decomposition algorithm is developed to solve the problem. The Benders master problem determines the unit commitment decision, while the Benders subproblem determines the dispatch decision. Multiple Benders feasibility cuts are constructed when the Benders subproblem is infeasible. Valid inequalities are derived to improve the lower bound provided by the Benders master problem. Numerical results show the performance of the algorithm.
In this article, we demonstrate a Petrov-Galerkin Proper Generalized Decomposition (PGD) known as Minimax PGD for modeling neutron transport separated in energy. To compare the Minimax with the classical Galerkin PGD, we assess both on a model problem of UO{sub 2} or Mixed Oxide (MOX) fuel pins in an infinite lattice with 3 industry-standard energy meshes. We find the Minimax PGD achieves a superior decomposition to Galerkin PGD, both with and without update of the energy modes. This suggests Minimax PGD may be more computationally efficient, provided this reduction in modes (to achieve a given accuracy) outweighs the cost of solving the necessary adjoint problems. In either case, we note that PGD offers an a priori Reduced-Order Model (ROM) which may be dramatically cheaper to solve than the full-order model, especially in problems with fine to ultrafine energy meshes. (authors)
Optimal control problem formulated for linear constant-coefficient system subjected to class of amplitude bounded load disturbances
The central dogma of black hole physics – which says that from the outside a black hole can be described in terms of a quantum system with exp(Area/4G N ) states evolving unitarily – has recently been supported by computations indicating that the interior of the black hole is encoded in the Hawking radiation of the exterior. In this paper, we probe whether such a dogma for cosmological horizons has any support from similar computations. The fact that the de Sitter bifurcation surface is a minimax surface (instead of a maximin surface) causes problems with this interpretation when trying to import calculations analogous to the AdS case. This suggests anchoring extremal surfaces to the horizon itself, where we formulate a two-sided extremization prescription and find answers consistent with general expectations for a quantum theory of de Sitter space: vanishing total entropy, an entropy of A/4G N when restricting to a single static patch, an entropy of a subregion of the horizon which grows as the region size grows until an island-like transition at half the horizon size when the entanglement wedge becomes the entire static patch interior, and a de Sitter version of the Hartman-Maldacena transition.
The optimal ascent problem for a hypersonic vehicle is formulated as an inverse dynamic problem. This formulation is essential in solving the trajectory optimization problem via the nonlinear programming approach. Both minimum-fuel and minimax type of performance indices are considered. The results reveal important features of the optimal trajectory and controls, and they are subsequently used to construct a nonlinear feedback midcourse control law. This control law not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suitable for onboard implementation. Finally, off-nominal trajectory guidance is addressed using combination of feedback compensation and onboard generation of control through the inverse dynamics approach.