Short Comments on an Energy Pumping Levels in a MEMS Gyroscope Vibrating Problem, by Using of an Global and Local Optimal Linear Control Design

This paper deals with an energy pumping that occurs in a (MEMS) Gyroscope nonlinear dynamical 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 also developed a linear optimal control design for reducing the oscillatory movement of the nonlinear systems to a stable point.

On non-linear dynamics and an optimal control synthesis of the action potential of membranes (ideal and non-ideal cases) of the Hodgkin-Huxley (HH) mathematical model

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

An Optimal Linear Control Design for Nonlinear Systems

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

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

On an optimal control design for Rossler system

In this Letter, an optimal control strategy that directs the chaotic motion of the Rossler system to any desired fixed point is proposed. The chaos control problem is then formulated as being an infinite horizon optimal control nonlinear problem that was reduced to a solution of the associated Hamilton-Jacobi-Bellman equation. We obtained its solution among the correspondent Lyapunov functions of the considered dynamical system. (C) 2004 Elsevier B.V All rights reserved.

Localization of the optimal solution and a posteriori bounds for aggregation

After an aggregated problem has been solved, it is often desirable to estimate the accuracy loss due to the fact that a simpler problem than the original one has been solved. One way of measuring this loss in accuracy is the difference in objective function values. To get the bounds for this difference, Zipkin (Operations Research 1980;28:406) has assumed, that a simple (knapsack-type) localization of an original optimal solution is known. Since then various extensions of Zipkin's bound have been proposed, but under the same assumption. A method to compute the bounds for variable aggregation for convex problems, based on general localization of the original solution is proposed. For some classes of the original problem it is shown how to construct the localization. Examples are given to illustrate the main constructions and a small numerical study is presented.

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.

Optimal space manoeuvres in a non-Keplerian force field

In this work the problem of a spacecraft bi-impulsive transfer between two given non coplanar elliptical orbits, with minimum fuel consumption, is solved considering a non-Keplerian force field (the perturbing forces include Earth gravity harmonics and atmospheric drag). The problem is transformed in the Two Point Boundary Value Problem. It is developed and implemented a new algorithm, that uses the analytical expressions developed here. A dynamics that considered a Keplerian force field was used to produce an initial guess to solve the Two Point Boundary Value Problem. Several simulations were performed to observe the spacecraft orbital behaviour by different kind of perturbations and constraints, on a fuel consumption optimization point of view. (C) 2002 COSPAR. Published by Elsevier B.V. Ltd. All rights reserved.

Logarithmic barrier-augmented Lagrangian function to the optimal power flow problem

This paper presents a new approach to solve the Optimal Power Flow problem. This approach considers the application of logarithmic barrier method to voltage magnitude and tap-changing transformer variables and the other constraints are treated by augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. (C) 2005 Elsevier Ltd. All rights reserved.

A new approach to the solution of the optimal power flow problem based on the modified Newton's method associated to an augmented Lagrangian function

This paper presents a new algorithm for optimal power flow problem. The algorithm is based on Newton's method which it works with an Augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints and is solved using the modified-Newton method. The test results have shown the effectiveness of the approach using the IEEE 30 and 638 bus systems.

A model for optimal chemical control of leaf area damaged by fungi population - Parameter dependence

We present a model to study a fungi population submitted to chemical control, incorporating the fungicide application directly into the model. From that, we obtain an optimal control strategy that minimizes both the fungicide application (cost) and leaf area damaged by fungi population during the interval between the moment when the disease is detected (t = 0) and the time of harvest (t = t(f)). Initially, the parameters of the model are considered constant. Later, we consider the apparent infection rate depending on the time (and the temperature) and do some simulations to illustrate and to compare with the constant case.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.