Auto-weighted minimum-variance self-tuning controller

A self-tuning controller which automatically assigns weightings to control and set-point following is introduced. This discrete-time single-input single-output controller is based on a generalized minimum-variance control strategy. The automatic on-line selection of weightings is very convenient, especially when the system parameters are unknown or slowly varying with respect to time, which is generally considered to be the type of systems for which self-tuning control is useful. This feature also enables the controller to overcome difficulties with non-minimum phase systems.

New developments in batch process input profile optimisation

A novel algorithm for solving nonlinear discrete time optimal control problems with model-reality differences is presented. The technique uses dynamic integrated system optimisation and parameter estimation (DISOPE) which achieves the correct optimal solution in spite of deficiencies in the mathematical model employed in the optimisation procedure. A new method for approximating some Jacobian trajectories required by the algorithm is introduced. It is shown that the iterative procedure associated with the algorithm naturally suits applications to batch chemical processes.

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.

The private memory of aggregate shocks

Em economias caracterizadas por choques agregados e privados, mostramos que a alocação ótima restrita pode depender de forma não-trivial dos choques agregados. Usando versões dos modelos de Atkeson e Lucas (1992) e Mirrlees (1971) de dois períodos, é mostrado que a alocação ótima apresenta memória com relação aos choques agregados mesmo eles sendo i.i.d. e independentes dos choques individuais, quando esses últimos choques não são totalmente persistentes. O fato de os choques terem efeitos persistentes na alocação mesmo sendo informação pública, foi primeiramente apresentado em Phelan (1994). Nossas simulações numéricas indicam que esse não é um resultado pontual: existe uma relação contínua entre persistência de tipos privados e memória do choque agregado.

On endogenous cost of altruism

The paper extends the cost of altruism model, analyzed in Lisboa (1999). There are three types of agents: households, providers of a service and insurance companies. Households have uncertainty about future leveIs of income. Providers, if hired by a household, have to choose a non-observable leveI of effort, perform a diagnoses and privately learn a signal. For each signal there is a procedure that maximizes the likelihood of the household obtaining the good state of nature. Finally, insurance companies offer contracts to both providers and households. The paper provides suflicient conditions for the existence of equilibrium and shows the optimal contract induces providers to care about their income and also about the likelihood households will obtain the good state of nature, which in Lisboa (1999) was stated as altruism assumption. Equilibrium is inefficient in comparison with the standard moral hazard outcome whenever high leveIs of effort is chosen precisely due to the need to incentive providers to choose the least expensive treatment for some signals. We show, however that an equilibrium is always constrained optimal.

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.

Controle ótimo H2 e H¥ com modificação de zeros para o problema de rastreamento usando LMI

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Short and long period optimization of drug doses in the treatment of AIDS

Técnicas de otimização numérica são úteis na solução de problemas de determinação da melhor entrada para sistemas descritos por modelos matemáticos e cujos objetivos podem ser expressos de uma maneira quantitativa. Este trabalho aborda o problema de otimizar as dosagens dos medicamentos no tratamento da AIDS em termos de um balanço entre a resposta terapêutica e os efeitos colaterais. Um modelo matemático para descrever a dinâmica do vírus HIV e células CD4 é utilizado para calcular a dosagem ótima do medicamento no tratamento a curto prazo de pacientes com AIDS por um método de otimização direta utilizando uma função custo do tipo Bolza. Os parâmetros do modelo foram ajustados com dados reais obtidos da literatura. Com o objetivo de simplificar os procedimentos numéricos, a lei de controle foi expressa em termos de uma expansão em séries que, após truncamento, permite obter controles sub-ótimos. Quando os pacientes atingem um estado clínico satisfatório, a técnica do Regulador Linear Quadrático (RLQ) é utilizada para determinar a dosagem permanente de longo período para os medicamentos. As dosagens calculadas utilizando a técnica RLQ , tendem a ser menores do que a equivalente terapia de dose constante em termos do expressivo aumento na contagem das células T+ CD4 e da redução da densidade de vírus livre durante um intervalo fixo de tempo.

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.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

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.

Lower-semicontinuity and optimization of convex functionals

The result that we treat in this article allows to the utilization of classic tools of convex analysis in the study of optimality conditions in the optimal control convex process for a Volterra-Stietjes linear integral equation in the Banach space G([a, b],X) of the regulated functions in [a, b], that is, the functions f : [a, 6] → X that have only descontinuity of first kind, in Dushnik (or interior) sense, and with an equality linear restriction. In this work we introduce a convex functional Lβf(x) of Nemytskii type, and we present conditions for its lower-semicontinuity. As consequence, Weierstrass Theorem garantees (under compacity conditions) the existence of solution to the problem min{Lβf(x)}. © 2009 Academic Publications.