H∞ and L2–L∞ filtering for two-dimensional linear parameter-varying systems

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Wiley-BlackwellIn this paper, the H∞ and l2–l∞ filtering problem is investigated for two-dimensional (2-D) discrete-time linear parameter-varying (LPV) systems. Based on the well-known Fornasini–Marchesini local state-space (FMLSS) model, the mathematical model of 2-D systems under consideration is established by incorporating the parameter-varying phenomenon. The purpose of the problem addressed is to design full-order H∞ and l2–l∞ filters such that the filtering error dynamics is asymptotic stable and the prescribed noise attenuation levels in H∞ and l2–l∞ senses can be achieved, respectively. Sufficient conditions are derived for existence of such filters in terms of parameterized linear matrix inequalities (PLMIs), and the corresponding filter synthesis problem is then transformed into a convex optimization problem that can be efficiently solved by using standard software packages. A simulation example is exploited to demonstrate the usefulness and effectiveness of the proposed design method

OSQP: An Operator Splitting Solver for Quadratic Programs

We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration. Our algorithm is very robust, placing no requirements on the problem data such as positive definiteness of the objective function or linear independence of the constraint functions. It can be configured to be division-free once an initial matrix factorization is carried out, making it suitable for real-time applications in embedded systems. In addition, our technique is the first operator splitting method for quadratic programs able to reliably detect primal and dual infeasible problems from the algorithm iterates. The method also supports factorization caching and warm starting, making it particularly efficient when solving parametrized problems arising in finance, control, and machine learning. Our open-source C implementation OSQP has a small footprint, is library-free, and has been extensively tested on many problem instances from a wide variety of application areas. It is typically ten times faster than competing interior-point methods, and sometimes much more when factorization caching or warm start is used. OSQP has already shown a large impact with tens of thousands of users both in academia and in large corporations

Optimal Linear Parameter-Varying Control Design for a Pressurized Water Reactors

The applicability of employing parameter-dependent control to a nuclear pressurized water reactor is investigated. The synthesis techque produces a controller which achieves specified performance against the worst-case time variation of a measurable parameter which enters the plant in a linear fractional manner. The plant can thus have widely varying dynamics over the operating range. The results indicate this control technique is comparable to linear control when small operating ranges are considered

Equivalence of robust stabilization and robust performance via feedback

One approach to robust control for linear plants with structured uncertainty as well as for linear parameter-varying (LPV) plants (where the controller has on-line access to the varying plant parameters) is through linear-fractional-transformation (LFT) models. Control issues to be addressed by controller design in this formalism include robust stability and robust performance. Here robust performance is defined as the achievement of a uniform specified $L^{2}$-gain tolerance for a disturbance-to-error map combined with robust stability. By setting the disturbance and error channels equal to zero, it is clear that any criterion for robust performance also produces a criterion for robust stability. Counter-intuitively, as a consequence of the so-called Main Loop Theorem, application of a result on robust stability to a feedback configuration with an artificial full-block uncertainty operator added in feedback connection between the error and disturbance signals produces a result on robust performance. The main result here is that this performance-to-stabilization reduction principle must be handled with care for the case of dynamic feedback compensation: casual application of this principle leads to the solution of a physically uninteresting problem, where the controller is assumed to have access to the states in the artificially-added feedback loop. Application of the principle using a known more refined dynamic-control robust stability criterion, where the user is allowed to specify controller partial-state dimensions, leads to correct robust-performance results. These latter results involve rank conditions in addition to Linear Matrix Inequality (LMI) conditions.Comment: 20 page

Multi-Objective Robust H-infinity Control of Spacecraft Rendezvous

Based on the relative motion dynamic model illustrated by C-W equations, the problem of robust Hinfin control for a class of spacecraft rendezvous systems is investigated, which contains parametric uncertainties, external disturbances and input constraints. An Hinfin state-feedback controller is designed via a Lyapunov approach, which guarantees the closed-loop system to meet the multi-objective design requirements. The existence conditions for admissible controllers are formulated in the form of linear matrix inequalities (LMIs), and the controller design is cast into a convex optimization problem subject to LMI constraints. An illustrative example is provided to show the effectiveness of the proposed control design method

Order Reduction of the Radiative Heat Transfer Model for the Simulation of Plasma Arcs

An approach to derive low-complexity models describing thermal radiation for the sake of simulating the behavior of electric arcs in switchgear systems is presented. The idea is to approximate the (high dimensional) full-order equations, modeling the propagation of the radiated intensity in space, with a model of much lower dimension, whose parameters are identified by means of nonlinear system identification techniques. The low-order model preserves the main structural aspects of the full-order one, and its parameters can be straightforwardly used in arc simulation tools based on computational fluid dynamics. In particular, the model parameters can be used together with the common approaches to resolve radiation in magnetohydrodynamic simulations, including the discrete-ordinate method, the P-N methods and photohydrodynamics. The proposed order reduction approach is able to systematically compute the partitioning of the electromagnetic spectrum in frequency bands, and the related absorption coefficients, that yield the best matching with respect to the finely resolved absorption spectrum of the considered gaseous medium. It is shown how the problem's structure can be exploited to improve the computational efficiency when solving the resulting nonlinear optimization problem. In addition to the order reduction approach and the related computational aspects, an analysis by means of Laplace transform is presented, providing a justification to the use of very low orders in the reduction procedure as compared with the full-order model. Finally, comparisons between the full-order model and the reduced-order ones are presented

Random Finite Set Theory and Optimal Control of Large Collaborative Swarms

Controlling large swarms of robotic agents has many challenges including, but not limited to, computational complexity due to the number of agents, uncertainty in the functionality of each agent in the swarm, and uncertainty in the swarm's configuration. This work generalizes the swarm state using Random Finite Set (RFS) theory and solves the control problem using Model Predictive Control (MPC) to overcome the aforementioned challenges. Computationally efficient solutions are obtained via the Iterative Linear Quadratic Regulator (ILQR). Information divergence is used to define the distance between the swarm RFS and the desired swarm configuration. Then, a stochastic optimal control problem is formulated using a modified L2^2 distance. Simulation results using MPC and ILQR show that swarm intensities converge to a target destination, and the RFS control formulation can vary in the number of target destinations. ILQR also provides a more computationally efficient solution to the RFS swarm problem when compared to the MPC solution. Lastly, the RFS control solution is applied to a spacecraft relative motion problem showing the viability for this real-world scenario.Comment: arXiv admin note: text overlap with arXiv:1801.0731

Robust H∞ filtering for time-delay systems with probabilistic sensor faults

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, a new robust H∞ filtering problem is investigated for a class of time-varying nonlinear system with norm-bounded parameter uncertainties, bounded state delay, sector-bounded nonlinearity and probabilistic sensor gain faults. The probabilistic sensor reductions are modeled by using a random variable that obeys a specific distribution in a known interval [alpha,beta], which accounts for the following two phenomenon: 1) signal stochastic attenuation in unreliable analog channel and 2) random sensor gain reduction in severe environment. The main task is to design a robust H∞ filter such that, for all possible uncertain measurements, system parameter uncertainties, nonlinearity as well as time-varying delays, the filtering error dynamics is asymptotically mean-square stable with a prescribed H∞ performance level. A sufficient condition for the existence of such a filter is presented in terms of the feasibility of a certain linear matrix inequality (LMI). A numerical example is introduced to illustrate the effectiveness and applicability of the proposed methodology