On control and synchronization in chaotic and hyperchaotic systems via linear feedback control

This paper presents the control and synchronization of chaos by designing linear feedback controllers. The linear feedback control problem for nonlinear systems has been formulated under optimal control theory viewpoint. Asymptotic stability of the closed-loop nonlinear system is guaranteed by means of a Lyapunov function which can clearly be seen to be the solution of the Hamilton-Jacobi-Bellman equation thus guaranteeing both stability and optimality. The formulated theorem expresses explicitly the form of minimized functional and gives the sufficient conditions that allow using the linear feedback control for nonlinear system. The numerical simulations were provided in order to show the effectiveness of this method for the control of the chaotic Rossler system and synchronization of the hyperchaotic Rossler system. (C) 2007 Elsevier B.V. All rights reserved.

Analysis of a sub-optimal scheme of drug dosage in the AIDS treatment

Here the results for CD4+T cells count and the viral load obtained from HIV sero-positive patients are compared with results from numerical simulations by computer. Also, the standard scheme of administration of drugs anti HIV (HAART schemes) which uses constant doses is compared with an alternative sub-optimal teatment scheme which uses variable drug dosage according to the evolution of a quantitative measure of the side effects. The quantitative analysis done here shows that it is possible to obtain, using the alternative scheme, the same performance of actual data but using variable dosage and having fewer side effects. Optimal control theory is used to solve and also to provide a prognosis related to the strategies for control of viraemia.

The LQ control problem for Markovian jumps linear systems with horizon defined by stopping times

This paper deals with a stochastic optimal control problem involving discrete-time jump Markov linear systems. The jumps or changes between the system operation modes evolve according to an underlying Markov chain. In the model studied, the problem horizon is defined by a stopping time τ which represents either, the occurrence of a fix number N of failures or repairs (TN), or the occurrence of a crucial failure event (τΔ), after which the system is brought to a halt for maintenance. In addition, an intermediary mixed case for which T represents the minimum between TN and τΔ is also considered. These stopping times coincide with some of the jump times of the Markov state and the information available allows the reconfiguration of the control action at each jump time, in the form of a linear feedback gain. The solution for the linear quadratic problem with complete Markov state observation is presented. The solution is given in terms of recursions of a set of algebraic Riccati equations (ARE) or a coupled set of algebraic Riccati equation (CARE).

Swarm control designs applied to a micro-electro-mechanical gyroscope system (MEMS)

This paper analyzes the non-linear dynamics of a MEMS Gyroscope system, modeled with a proof mass constrained to move in a plane with two resonant modes, which are nominally orthogonal. The two modes are ideally coupled only by the rotation of the gyro about the plane's normal vector. We demonstrated that this model has an unstable behavior. Control problems consist of attempts to stabilize a system to an equilibrium point, a periodic orbit, or more general, about a given reference trajectory. We also developed a particle swarm optimization technique for reducing the oscillatory movement of the nonlinear system to a periodic orbit. © 2010 Springer-Verlag.

Chaos suppression in NEMs resonators by using nonlinear control design

In this work the chaotic behavior of a micro-mechanical resonator with electrostatic forces on both sides is suppressed. The aim is to control the system in an orbit of the analytical solution obtained by the Method of Multiple Scales. Two control strategies are used for controlling the trajectory of the system, namely: State Dependent Riccati Equation (SDRE) Control and Optimal Linear Feedback Control (OLFC). The controls proved effectiveness in controlling the trajectory of the system. Additionally, the robustness of each strategy is tested considering the presence of parametric errors and measurement noise in control. © 2012 American Institute of Physics.

Daily biofilm control and oral health: Consensus on the epidemiological challenge-Latin American Advisory Panel

Our understanding of dental plaque biofilm has evolved since the nonspecific plaque hypothesis that considered plaque as a nonspecific mass of native microorganisms that, because of lack of oral hygiene, builds up in proportions great enough to overcome the host resistance threshold and affect the tooth structure and tooth supporting tissues. A great diversity of microorganisms-over 700 species-was detected in the oral cavity, and evidence shows that the investigation of specific microorganisms or associations of microorganisms as etiological agents for periodontal diseases and caries is not a simplistic approach. Although clinical evidence shows that oral mechanical hygiene is fundamental to prevent and control caries and periodontal disease, it is important to highlight that optimal control is not achieved by most individuals. Thus the complementary use of chemotherapeutic agents has been investigated as a way to overcome the deficiencies of mechanical oral hygiene habits, insofar as they reduce both plaque formation and gingival inflammation, and represent a valid strategy to change the biofilm and maintain dental and periodontal health. The role of the dental professional is to monitor patients and offer them the best recommendations to preserve oral health throughout their life. With this in mind, chemical control should be indicated as part of daily oral hygiene, together with mechanical procedures, for all individuals who present supragingival and/or subgingival biofilm, taking into account age, physical and/or psychological limitations, allergies, and other factors.

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

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

Incerteza intervalar em otimização e controle

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

Nonlinear state estimation and control for chaos suppression in MEMS resonator

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

Condições de otimalidade para controle ótimo via formalismo de Dubovitskii-Milyutin

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

SELLING BIRD CONTROL

The remarks that I have prepared deal with direct contacts selling pest and bird control programs. I am going to limit my remarks to what I feel are the more important aspects of selling Bird Control. I think it is safe to say that one of the most difficult aspects of selling for most sales personnel is prospecting, that is, finding accounts to call on. Our sales personnel have to more or less come up with their own leads. They have to find out who to contact once they get there. I have found that the best prospect most of us have for selling Bird Control accounts are our present pest control accounts. Generally speaking, we try to main¬tain contact with our applicators in the field, who are in these accounts every day, asking them if there are any of their accounts that are having bird control problems. Another method of finding potential accounts, is driving around looking. It is more difficult to drive around and look for rat and/or roach problems, but generally speaking if a building or some type of business has a bird problem, it is fairly easy to locate. Another thing we can do is call on specific accounts. There are generally cer¬tain accounts that just by the manufacturing process do attract birds, for example: food plants, mills, beet plants, grain elevators, food processors, and so on. Other type operations which lend themselves to bird problems are industrial plants because of the super-structure (physical plant) that they have. Sub-stations and power plants are very attractive to birds. Some other situations that should be checked for bird problems are lumber yards and contractors' storage buildings. After deciding on a contact we get into what I call my basic four. There are four basic things that I try to impress upon our personnel to keep in mind when they go in to make a contact. The first one is the interview or actually making the contact so that you get an opportunity to have the interview, either calling for an appointment or making a "cold" call. The second one is closing for the survey. The third one is making the survey and preparing a proposal. The fourth and last one is the proposal presentation and closing of the sale. An additional item which would make a basic five is after you make the sale don't forget to follow up on the sale.

SINGULARLY PERTURBED DISCOUNTED MARKOV CONTROL PROCESSES IN A GENERAL STATE SPACE

This paper studies the asymptotic optimality of discrete-time Markov decision processes (MDPs) with general state space and action space and having weak and strong interactions. By using a similar approach as developed by Liu, Zhang, and Yin [Appl. Math. Optim., 44 (2001), pp. 105-129], the idea in this paper is to consider an MDP with general state and action spaces and to reduce the dimension of the state space by considering an averaged model. This formulation is often described by introducing a small parameter epsilon > 0 in the definition of the transition kernel, leading to a singularly perturbed Markov model with two time scales. Our objective is twofold. First it is shown that the value function of the control problem for the perturbed system converges to the value function of a limit averaged control problem as epsilon goes to zero. In the second part of the paper, it is proved that a feedback control policy for the original control problem defined by using an optimal feedback policy for the limit problem is asymptotically optimal. Our work extends existing results of the literature in the following two directions: the underlying MDP is defined on general state and action spaces and we do not impose strong conditions on the recurrence structure of the MDP such as Doeblin's condition.

Model predictive flight control systems for rotorcraft UAS

Constraints are widely present in the flight control problems: actuators saturations or flight envelope limitations are only some examples of that. The ability of Model Predictive Control (MPC) of dealing with the constraints joined with the increased computational power of modern calculators makes this approach attractive also for fast dynamics systems such as agile air vehicles. This PhD thesis presents the results, achieved at the Aerospace Engineering Department of the University of Bologna in collaboration with the Dutch National Aerospace Laboratories (NLR), concerning the development of a model predictive control system for small scale rotorcraft UAS. Several different predictive architectures have been evaluated and tested by means of simulation, as a result of this analysis the most promising one has been used to implement three different control systems: a Stability and Control Augmentation System, a trajectory tracking and a path following system. The systems have been compared with a corresponding baseline controller and showed several advantages in terms of performance, stability and robustness.

Black-scholes type equations

In this work we are concerned with the analysis and numerical solution of Black-Scholes type equations arising in the modeling of incomplete financial markets and an inverse problem of determining the local volatility function in a generalized Black-Scholes model from observed option prices. In the first chapter a fully nonlinear Black-Scholes equation which models transaction costs arising in option pricing is discretized by a new high order compact scheme. The compact scheme is proved to be unconditionally stable and non-oscillatory and is very efficient compared to classical schemes. Moreover, it is shown that the finite difference solution converges locally uniformly to the unique viscosity solution of the continuous equation. In the next chapter we turn to the calibration problem of computing local volatility functions from market data in a generalized Black-Scholes setting. We follow an optimal control approach in a Lagrangian framework. We show the existence of a global solution and study first- and second-order optimality conditions. Furthermore, we propose an algorithm that is based on a globalized sequential quadratic programming method and a primal-dual active set strategy, and present numerical results. In the last chapter we consider a quasilinear parabolic equation with quadratic gradient terms, which arises in the modeling of an optimal portfolio in incomplete markets. The existence of weak solutions is shown by considering a sequence of approximate solutions. The main difficulty of the proof is to infer the strong convergence of the sequence. Furthermore, we prove the uniqueness of weak solutions under a smallness condition on the derivatives of the covariance matrices with respect to the solution, but without additional regularity assumptions on the solution. The results are illustrated by a numerical example.

Reinforcement Lernen mit Regularisierungsnetzwerken

Die Arbeit behandelt das Problem der Skalierbarkeit von Reinforcement Lernen auf hochdimensionale und komplexe Aufgabenstellungen. Unter Reinforcement Lernen versteht man dabei eine auf approximativem Dynamischen Programmieren basierende Klasse von Lernverfahren, die speziell Anwendung in der Künstlichen Intelligenz findet und zur autonomen Steuerung simulierter Agenten oder realer Hardwareroboter in dynamischen und unwägbaren Umwelten genutzt werden kann. Dazu wird mittels Regression aus Stichproben eine Funktion bestimmt, die die Lösung einer "Optimalitätsgleichung" (Bellman) ist und aus der sich näherungsweise optimale Entscheidungen ableiten lassen. Eine große Hürde stellt dabei die Dimensionalität des Zustandsraums dar, die häufig hoch und daher traditionellen gitterbasierten Approximationsverfahren wenig zugänglich ist. Das Ziel dieser Arbeit ist es, Reinforcement Lernen durch nichtparametrisierte Funktionsapproximation (genauer, Regularisierungsnetze) auf -- im Prinzip beliebig -- hochdimensionale Probleme anwendbar zu machen. Regularisierungsnetze sind eine Verallgemeinerung von gewöhnlichen Basisfunktionsnetzen, die die gesuchte Lösung durch die Daten parametrisieren, wodurch die explizite Wahl von Knoten/Basisfunktionen entfällt und so bei hochdimensionalen Eingaben der "Fluch der Dimension" umgangen werden kann. Gleichzeitig sind Regularisierungsnetze aber auch lineare Approximatoren, die technisch einfach handhabbar sind und für die die bestehenden Konvergenzaussagen von Reinforcement Lernen Gültigkeit behalten (anders als etwa bei Feed-Forward Neuronalen Netzen). Allen diesen theoretischen Vorteilen gegenüber steht allerdings ein sehr praktisches Problem: der Rechenaufwand bei der Verwendung von Regularisierungsnetzen skaliert von Natur aus wie O(n**3), wobei n die Anzahl der Daten ist. Das ist besonders deswegen problematisch, weil bei Reinforcement Lernen der Lernprozeß online erfolgt -- die Stichproben werden von einem Agenten/Roboter erzeugt, während er mit der Umwelt interagiert. Anpassungen an der Lösung müssen daher sofort und mit wenig Rechenaufwand vorgenommen werden. Der Beitrag dieser Arbeit gliedert sich daher in zwei Teile: Im ersten Teil der Arbeit formulieren wir für Regularisierungsnetze einen effizienten Lernalgorithmus zum Lösen allgemeiner Regressionsaufgaben, der speziell auf die Anforderungen von Online-Lernen zugeschnitten ist. Unser Ansatz basiert auf der Vorgehensweise von Recursive Least-Squares, kann aber mit konstantem Zeitaufwand nicht nur neue Daten sondern auch neue Basisfunktionen in das bestehende Modell einfügen. Ermöglicht wird das durch die "Subset of Regressors" Approximation, wodurch der Kern durch eine stark reduzierte Auswahl von Trainingsdaten approximiert wird, und einer gierigen Auswahlwahlprozedur, die diese Basiselemente direkt aus dem Datenstrom zur Laufzeit selektiert. Im zweiten Teil übertragen wir diesen Algorithmus auf approximative Politik-Evaluation mittels Least-Squares basiertem Temporal-Difference Lernen, und integrieren diesen Baustein in ein Gesamtsystem zum autonomen Lernen von optimalem Verhalten. Insgesamt entwickeln wir ein in hohem Maße dateneffizientes Verfahren, das insbesondere für Lernprobleme aus der Robotik mit kontinuierlichen und hochdimensionalen Zustandsräumen sowie stochastischen Zustandsübergängen geeignet ist. Dabei sind wir nicht auf ein Modell der Umwelt angewiesen, arbeiten weitestgehend unabhängig von der Dimension des Zustandsraums, erzielen Konvergenz bereits mit relativ wenigen Agent-Umwelt Interaktionen, und können dank des effizienten Online-Algorithmus auch im Kontext zeitkritischer Echtzeitanwendungen operieren. Wir demonstrieren die Leistungsfähigkeit unseres Ansatzes anhand von zwei realistischen und komplexen Anwendungsbeispielen: dem Problem RoboCup-Keepaway, sowie der Steuerung eines (simulierten) Oktopus-Tentakels.