Search results for "Convex optimization"
showing 10 items of 57 documents
Design on fuzzy control for a class of stochastic nonlinear systems
2014
The problem of Hankel-norm output feedback control is solved for a class of T-S fuzzy stochastic systems. The dynamic output feedback controller design technique is proposed by employing fuzzy-basis-dependent Lyapunov function approach and the conversion on the Hankel-norm controller parameters. Sufficient conditions are established to design the controllers such that the resulting closed-loop system is stochastically stable and satisfies a prescribed performance. The desired output feedback controller can be obtained by solving a convex optimization problem, which can be efficiently solved by standard numerical algorithms Refereed/Peer-reviewed
An LMI Approach to Exponential Stock Level Estimation for Large-Scale Logistics Networks
2013
This article aims to present a convex optimization approach for exponential stock level estimation problem of large-scale logistics networks. The model under consideration presents the dependency and interconnections between the dynamics of each single location. Using a Lyapunov function, new sufficient conditions for exponential estimation of the networks are driven in terms of linear matrix inequalities (LMIs). The explicit expression of the observer gain is parameterized based on the solvability conditions. A numerical example is included to illustrate the applicability of the proposed design method.
Dynamic Output-Feedback Passivity Control for Fuzzy Systems under Variable Sampling
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/767093 Open Access This paper concerns the problem of dynamic output-feedback control for a class of nonlinear systems with nonuniform uncertain sampling via Takagi-Sugeno (T-S) fuzzy control approach. The sampling is not required to be periodic, and the state variables are not required to be measurable. A new type fuzzy dynamic output-feedback sampled-data controller is constructed, and a novel time-dependent Lyapunov-Krasovskii functional is chosen for fuzzy systems under variable sampling. By using Lyapunov stability theory, a sufficie…
Direct Numerical Methods for Optimal Control Problems
2003
Development of interior point methods for linear and quadratic programming problems occurred during the 1990’s. Because of their simplicity and their convergence properties, interior point methods are attractive solvers for such problems. Moreover, extensions have been made to more general convex programming problems.
Optimal Guaranteed Cost Control of a Class of Discrete-Time Nonlinear Systems with Markovian Switching and Mode-Dependent Mixed Time Delays
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/653628 Open Access The guaranteed cost control problem is investigated for a class of nonlinear discrete-time systems with Markovian jumping parameters and mixed time delays. The mixed time delays involved consist of both the mode-dependent discrete delay and the distributed delay with mode-dependent lower bound. The associated cost function is of a quadratic summation form over the infinite horizon. The nonlinear functions are assumed to satisfy sector-bounded conditions. By introducing new Lyapunov-Krasovskii functionals and developing some ne…
Robust control for autonomous spacecraft evacuation with model uncertainty and upper bound of performance with constraints
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/589381 This paper studies the problem of guaranteed cost control for spacecraft evacuation. The relative dynamic model is established based on Clohessy-Wiltshire (C-W) equations. The paper has taken parameter uncertainty, output tracking, disturbance attenuation, and fuel cost into consideration. The paper introduces a new Lyapunov approach, so the controller design problem can be transferred into a convex optimization problem subject to linear matrix inequality (LMI) constraints. By using the controller, the spacecraft evacuation can be …
Approximation of the Feasible Parameter Set in worst-case identification of Hammerstein models
2005
The estimation of the Feasible Parameter Set (FPS) for Hammerstein models in a worst-case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidic uncertainties. It consists in the projection of the FPS of the extended parameter vector onto suitable subspaces and in the solution of convex optimization problems which provide Uncertainties Intervals of the model parameters. The bounds obtained are tighter than in the previous approaches. hes.
A passivity approach to control of Markovian jump systems with mixed time-varying delays
2013
This paper investigated the problem of control design for a class of stochastic systems with Markovian jump parameters and time-varying delays. For the model under consideration, a passivity-based approach is introduced for designing mode-dependent output feedback controllers with mixed discrete and distributed delays. A Lypunov-Krasovskii function (LKF) is defined to establish new required sufficient conditions for ensuring exponentially mean-square stability and the passivity criteria, simultaneously. Moreover, controller gains are calculated based on a convex optimization method by solving a Linear Matrix Inequality (LMI). Finally, simulation results are provided to illustrate the effect…
Delay-Range-Dependent Linear Matrix Inequality Approach to Quantized H∞ Control of Linear Systems with Network-Induced Delays and Norm-Bounded Uncert…
2010
This paper deals with a convex optimization approach to the problem of robust network-based H∞ control for linear systems connected over a common digital communication network with static quantizers. Both the polytopic and the norm-bounded uncertainties are taken into consideration separately. First, the effect of both the output quantization levels and the network conditions under static quantizers is investigated. Second, by introducing a descriptor technique, using a Lyapunov—Krasovskii functional and a suitable change of variables, new required sufficient conditions are established in terms of delay-range-dependent linear matrix inequalities for the existence of the desired network-bas…
Optimality conditions for nondifferentiable convex semi-infinite programming
1983
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.