113,219 research outputs found
Robust filtering with randomly varying sensor delay: The finite-horizon case
Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we consider the robust filtering problem for discrete time-varying systems with delayed sensor measurement subject to norm-bounded parameter uncertainties. The delayed sensor measurement is assumed to be a linear function of a stochastic variable that satisfies the Bernoulli random binary distribution law. An upper bound for the actual covariance of the uncertain stochastic parameter system is derived and used for estimation variance constraints. Such an upper bound is then minimized over the filter parameters for all stochastic sensor delays and admissible deterministic uncertainties. It is shown that the desired filter can be obtained in terms of solutions to two discrete Riccati difference equations of a form suitable for recursive computation in online applications. An illustrative example is presented to show the applicability of the proposed method
A new solution approach to polynomial LPV system analysis and synthesis
Based on sum-of-squares (SOS) decomposition, we propose a new solution approach for polynomial LPV system analysis and control synthesis problems. Instead of solving matrix variables over a positive definite cone, the SOS approach tries to find a suitable decomposition to verify the positiveness of given polynomials. The complexity of the SOS-based numerical method is polynomial of the problem size. This approach also leads to more accurate solutions to LPV systems than most existing relaxation methods. Several examples have been used to demonstrate benefits of the SOS-based solution approach
Optimal control of discrete-time switched linear systems via continuous parameterization
The paper presents a novel method for designing an optimal controller for
discrete-time switched linear systems. The problem is formulated as one of
computing the discrete mode sequence and the continuous input sequence that
jointly minimize a quadratic performance index. State-of-art methods for
solving such a control problem suffer in general from a high computational
requirement due to the fact that an exponential number of switching sequences
must be explored. The method of this paper addresses the challenge of the
switching law design by introducing auxiliary continuous input variables and
then solving a non-smooth block-sparsity inducing optimization problem.Comment: 6 pages, 2 figures, 2 tables; To appear in the Proceedings of IFAC
World Congress, 201
Stochastic model predictive control of LPV systems via scenario optimization
A stochastic receding-horizon control approach for constrained Linear Parameter Varying discrete-time systems is proposed in this paper. It is assumed that the time-varying parameters have stochastic nature and that the system's matrices are bounded but otherwise arbitrary nonlinear functions of these parameters. No specific assumption on the statistics of the parameters is required. By using a randomization approach, a scenario-based finite-horizon optimal control problem is formulated, where only a finite number M of sampled predicted parameter trajectories (‘scenarios') are considered. This problem is convex and its solution is a priori guaranteed to be probabilistically robust, up to a user-defined probability level p. The p level is linked to M by an analytic relationship, which establishes a tradeoff between computational complexity and robustness of the solution. Then, a receding horizon strategy is presented, involving the iterated solution of a scenario-based finite-horizon control problem at each time step. Our key result is to show that the state trajectories of the controlled system reach a terminal positively invariant set in finite time, either deterministically, or with probability no smaller than p. The features of the approach are illustrated by a numerical example
Recommended from our members
Non-fragile H∞ control with randomly occurring gain variations, distributed delays and channel fadings
This study is concerned with the non-fragile H∞ control problem for a class of discrete-time systems subject to randomly occurring gain variations (ROGVs), channel fadings and infinite-distributed delays. A new stochastic phenomenon (ROGVs), which is governed by a sequence of random variables with a certain probabilistic distribution, is put forward to better reflect the reality of the randomly occurring fluctuation of controller gains implemented in networked environments. A modified stochastic Rice fading model is then exploited to account for both channel fadings and random time-delays in a unified representation. The channel coefficients are a set of mutually independent random variables which abide by any (not necessarily Gaussian) probability density function on [0, 1]. Attention is focused on the analysis and design of a non-fragile H∞ outputfeedback controller such that the closed-loop control system is stochastically stable with a prescribed H∞ performance. Through intensive stochastic analysis, sufficient conditions are established for the desired stochastic stability and H∞ disturbance attenuation, and the addressed non-fragile control problem is then recast as a convex optimisation problem solvable via the semidefinite programme method. An example is finally provided to demonstrate the effectiveness of the proposed design method
Robust Stability Analysis of Nonlinear Hybrid Systems
We present a methodology for robust stability analysis of nonlinear hybrid systems, through the algorithmic construction of polynomial and piecewise polynomial Lyapunov-like functions using convex optimization and in particular the sum of squares decomposition of multivariate polynomials. Several improvements compared to previous approaches are discussed, such as treating in a unified way polynomial switching surfaces and robust stability analysis for nonlinear hybrid systems
Maximum Entropy/Optimal Projection (MEOP) control design synthesis: Optimal quantification of the major design tradeoffs
The underlying philosophy and motivation of the optimal projection/maximum entropy (OP/ME) stochastic modeling and reduced control design methodology for high order systems with parameter uncertainties are discussed. The OP/ME design equations for reduced-order dynamic compensation including the effect of parameter uncertainties are reviewed. The application of the methodology to several Large Space Structures (LSS) problems of representative complexity is illustrated
- …