Closed loop design for a simple nonlinear aircraft model using eigenstructure assignment

Aircraft systems are highly nonlinear and time varying. High-performance aircraft at high angles of incidence experience undesired coupling of the lateral and longitudinal variables, resulting in departure from normal controlled flight. The aim of this work is to construct a robust closed-loop control that optimally extends the stable and decoupled flight envelope. For the study of these systems nonlinear analysis methods are needed. Previously, bifurcation techniques have been used mainly to analyze open-loop nonlinear aircraft models and investigate control effects on dynamic behavior. In this work linear feedback control designs calculated by eigenstructure assignment methods are investigated for a simple aircraft model at a fixed flight condition. Bifurcation analysis in conjunction with linear control design methods is shown to aid control law design for the nonlinear system.

Solving the non-convexity problem in some shopping-time and human-capital models

Several works in the shopping-time and in the human-capital literature, due to the nonconcavity of the underlying Hamiltonian, use Örst-order conditions in dynamic optimization to characterize necessity, but not su¢ ciency, in intertemporal problems. In this work I choose one paper in each one of these two areas and show that optimality can be characterized by means of a simple aplication of Arrowís (1968) su¢ ciency theorem.

A note on an application of Arrow's theorem: sufficient conditions for Lucas' inflation and welfare

Bellman's methods for dynamic optimization constitute the present mainstream in economics. However, some results associated with optimal controI can be particularly usefuI in certain problems. The purpose of this note is presenting such an example. The value function derived in Lucas' (2000) shopping-time economy in Infiation and Welfare need not be concave, leading this author to develop numerical analyses to determine if consumer utility is in fact maximized along the balanced path constructed from the first order conditions. We use Arrow's generalization of Mangasarian's results in optimal control theory and develop sufficient conditions for the problem. The analytical conclusions and the previous numerical results are compatible .

Two additions to Lucas's "inflation and welfare"

This work adds to Lucas (2000) by providing analytical solutions to two problems that are solved only numerically by the author. The first part uses a theorem in control theory (Arrow' s sufficiency theorem) to provide sufficiency conditions to characterize the optimum in a shopping-time problem where the value function need not be concave. In the original paper the optimality of the first-order condition is characterized only by means of a numerical analysis. The second part of the paper provides a closed-form solution to the general-equilibrium expression of the welfare costs of inflation when the money demand is double logarithmic. This closed-form solution allows for the precise calculation of the difference between the general-equilibrium and Bailey's partial-equilibrium estimates of the welfare losses due to inflation. Again, in Lucas's original paper, the solution to the general-equilibrium-case underlying nonlinear differential equation is done only numerically, and the posterior assertion that the general-equilibrium welfare figures cannot be distinguished from those derived using Bailey's formula rely only on numerical simulations as well.

Experience generalization for multi-agent reinforcement learning

On-line learning methods have been applied successfully in multi-agent systems to achieve coordination among agents. Learning in multi-agent systems implies in a non-stationary scenario perceived by the agents, since the behavior of other agents may change as they simultaneously learn how to improve their actions. Non-stationary scenarios can be modeled as Markov Games, which can be solved using the Minimax-Q algorithm a combination of Q-learning (a Reinforcement Learning (RL) algorithm which directly learns an optimal control policy) and the Minimax algorithm. However, finding optimal control policies using any RL algorithm (Q-learning and Minimax-Q included) can be very time consuming. Trying to improve the learning time of Q-learning, we considered the QS-algorithm. in which a single experience can update more than a single action value by using a spreading function. In this paper, we contribute a Minimax-QS algorithm which combines the Minimax-Q algorithm and the QS-algorithm. We conduct a series of empirical evaluation of the algorithm in a simplified simulator of the soccer domain. We show that even using a very simple domain-dependent spreading function, the performance of the learning algorithm can be improved.

Structural and electrical characterization of semiconducting barium-lead-titanate ceramics

BaTiO3 is usually doped to achieve the temperature stability required by device applications, as well as to obtain a large positive temperature coefficient anomaly of resistivity (PTCR). Uniform distribution of dopants among the submicron dielectric particles is the key for optimal control of grain size and microstructure to maintain a high reliability. The system Ba0.84Pb0.16TiO3 was synthesized from high purity BaCO3, TiO2, PbO oxide powders as raw materials. Sb2O3, MnSO4 and ZnO were used as dopants and Al2O3, TiO2 and SiO2 as grain growth controllers. Phase composition was analyzed by using XRD and the microstructure was investigated by SEM. EDS attached to SEM was used to analyze phase composition specially related to abnormal grain growth. Electrical resistivities were measured as a function of temperature and the PTCR effect characterized by an abrupt increase on resistivity.

The Variable Sample Size (X)over-bar Chart with Estimated Parameters

The VSS X chart, dedicated to the detection of small to moderate mean shifts in the process, has been investigated by several researchers under the assumption of known process parameters. In practice, the process parameters are rarely known and are usually estimated from an in-control Phase I data set. In this paper, we evaluate the (run length) performances of the VSS chart when the process parameters are estimated, we compare them in the case where the process parameters are assumed known and we propose specific optimal control chart parameters taking the number of Phase I samples into account.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

PMUs optimized allocation using a tabu search algorithm for fault location in electric power distribution system

Phasor Measurement Units (PMUs) optimized allocation allows control, monitoring and accurate operation of electric power distribution systems, improving reliability and service quality. Good quality and considerable results are obtained for transmission systems using fault location techniques based on voltage measurements. Based on these techniques and performing PMUs optimized allocation it is possible to develop an electric power distribution system fault locator, which provides accurate results. The PMUs allocation problem presents combinatorial features related to devices number that can be allocated, and also probably places for allocation. Tabu search algorithm is the proposed technique to carry out PMUs allocation. This technique applied in a 141 buses real-life distribution urban feeder improved significantly the fault location results. © 2004 IEEE.

Uma abordagem para problemas e controle ótimo via métodos de Runge-Kutta e análise de erro

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise não-diferenciável e condições necessárias de otimalidade para problema de controle ótimo com restrições mistas

Pós-graduação em Matemática - IBILCE

Cálculo variacional: aspectos teóricos e aplicações

Pós-graduação em Matemática Universitária - IGCE

Identificação e controle de sistemas dinâmicos utilizando redes wavelets

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Otimização multiobjetivo no controle da dengue

Pós-graduação em Biometria - IBB

Algoritmo genético aplicado ao controle do mosquito transmissor da dengue

Pós-graduação em Biometria - IBB