94 research outputs found

    Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

    Full text link
    A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over an infinite time horizon. We present a novel condition on barrier certificates, termed the invariant barrier-certificate condition, that witnesses unbounded-time safety of differential dynamical systems. The proposed condition is the weakest possible one to attain inductive invariance. We show that discharging the invariant barrier-certificate condition -- thereby synthesizing invariant barrier certificates -- can be encoded as solving an optimization problem subject to bilinear matrix inequalities (BMIs). We further propose a synthesis algorithm based on difference-of-convex programming, which approaches a local optimum of the BMI problem via solving a series of convex optimization problems. This algorithm is incorporated in a branch-and-bound framework that searches for the global optimum in a divide-and-conquer fashion. We present a weak completeness result of our method, namely, a barrier certificate is guaranteed to be found (under some mild assumptions) whenever there exists an inductive invariant (in the form of a given template) that suffices to certify safety of the system. Experimental results on benchmarks demonstrate the effectiveness and efficiency of our approach.Comment: To be published in Inf. Comput. arXiv admin note: substantial text overlap with arXiv:2105.1431

    Proceedings of the 1st Virtual Control Conference VCC 2010

    Get PDF

    Structured, Gain-Scheduled Control of Wind Turbines

    Get PDF

    Performance Control for Interconnection of Identical Systems: Application to PLL network design

    Get PDF
    International audienceIn this paper, the problem of the control law design for interconnected identical systems ensuring the global stability and the global performance properties is under consideration. Inspired by the decentralized control law design methodology using the dissipativity input–output approach, the problem is reduced to the problem of satisfying two conditions: (i) the condition on the interconnection and (ii) the condition on the local subsystem dynamics. Both problems are efficiently solved applying a (quasi‐) convex LMI optimization and standard H∞ synthesis. The proposed design methodology is applied to the control law design of a synchronous PLL network

    Robust model predictive control for linear systems subject to norm-bounded model Uncertainties and Disturbances: An Implementation to industrial directional drilling system

    Get PDF
    Model Predictive Control (MPC) refers to a class of receding horizon algorithms in which the current control action is computed by solving online, at each sampling instant, a constrained optimization problem. MPC has been widely implemented within the industry, due to its ability to deal with multivariable processes and to explicitly consider any physical constraints within the optimal control problem in a straightforward manner. However, the presence of uncertainty, whether in the form of additive disturbances, state estimation error or plant-model mismatch, and the robust constraints satisfaction and stability, remain an active area of research. The family of predictive control algorithms, which explicitly take account of process uncertainties/disturbances whilst guaranteeing robust constraint satisfaction and performance is referred to as Robust MPC (RMPC) schemes. In this thesis, RMPC algorithms based on Linear Matrix Inequality (LMI) optimization are investigated, with the overall aim of improving robustness and control performance, while maintaining conservativeness and computation burden at low levels. Typically, the constrained RMPC problem with state-feedback parameterizations is nonlinear (and nonconvex) with a prohibitively high computational burden for online implementation. To remedy this issue, a novel approach is proposed to linearize the state-feedback RMPC problem, with minimal conservatism, through the use of semidefinite relaxation techniques and the Elimination Lemma. The proposed algorithm computes the state-feedback gain and perturbation online by solving an LMI optimization that, in comparison to other schemes in the literature is shown to have a substantially reduced computational burden without adversely affecting the tracking performance of the controller. In the case that only (noisy) output measurements are available, an output-feedback RMPC algorithm is also derived for norm-bounded uncertain systems. The novelty lies in the fact that, instead of using an offline estimation scheme or a fixed linear observer, the past input/output data is used within a Robust Moving Horizon Estimation (RMHE) scheme to compute (tight) bounds on the current state. These current state bounds are then used within the RMPC control algorithm. To reduce conservatism, the output-feedback control gain and control perturbation are both explicitly considered as decision variables in the online LMI optimization. Finally, the aforementioned robust control strategies are applied in an industrial directional drilling configuration and their performance is illustrated by simulations. A rotary steerable system (RSS) is a drilling technology that has been extensively studied over the last 20 years in hydrocarbon exploration and is used to drill complex curved borehole trajectories. RSSs are commonly treated as dynamic robotic actuator systems, driven by a reference signal and typically controlled by using a feedback loop control law. However, due to spatial delays, parametric uncertainties, and the presence of disturbances in such an unpredictable working environment, designing such control laws is not a straightforward process. Furthermore, due to their inherent delayed feedback, described by delay differential equations (DDE), directional drilling systems have the potential to become unstable given the requisite conditions. To address this problem, a simplified model described by ordinary differential equations (ODE) is first proposed, and then taking into account disturbances and system uncertainties that arise from design approximations, the proposed RMPC algorithm is used to automate the directional drilling system.Open Acces

    Robust feedback model predictive control of norm-bounded uncertain systems

    Get PDF
    This thesis is concerned with the Robust Model Predictive Control (RMPC) of linear discrete-time systems subject to norm-bounded model-uncertainty, additive disturbances and hard constraints on the input and state. The aim is to design tractable, feedback RMPC algorithms that are based on linear matrix inequality (LMI) optimizations. The notion of feedback is very important in the RMPC control parameterization since it enables effective disturbance/uncertainty rejection and robust constraint satisfaction. However, treating the state-feedback gain as an optimization variable leads to non-convexity and nonlinearity in the RMPC scheme for norm-bounded uncertain systems. To address this problem, we propose three distinct state-feedback RMPC algorithms which are all based on (convex) LMI optimizations. In the first scheme, the aforementioned non-convexity is avoided by adopting a sequential approach based on the principles of Dynamic Programming. In particular, the feedback RMPC controller minimizes an upper-bound on the cost-to-go at each prediction step and incorporates the state/input constraints in a non-conservative manner. In the second RMPC algorithm, new results, based on slack variables, are proposed which help to obtain convexity at the expense of only minor conservatism. In the third and final approach, convexity is achieved by re-parameterizing, online, the norm-bounded uncertainty as a polytopic (additive) disturbance. All three RMPC schemes drive the uncertain-system state to a terminal invariant set which helps to establish Lyapunov stability and recursive feasibility. Low-complexity robust control invariant (LC-RCI) sets, when used as target sets, yield computational advantages for the associated RMPC schemes. A convex algorithm for the simultaneous computation of LC-RCI sets and the corresponding controller for norm-bounded uncertain systems is also presented. In this regard, two novel results to separate bilinear terms without conservatism are proposed. The results being general in nature also have application in other control areas. The computed LC-RCI sets are shown to have substantially improved volume as compared to other schemes in the literature. Finally, an output-feedback RMPC algorithm is also derived for norm-bounded uncertain systems. The proposed formulation uses a moving window of the past input/output data to generate (tight) bounds on the current state. These bounds are then used to compute an output-feedback RMPC control law using LMI optimizations. An output-feedback LC-RCI set is also designed, and serves as the terminal set in the algorithm.Open Acces
    • 

    corecore