A Scalings Approach to H2-Gain-Scheduling Synthesis without Elimination
نویسندگان
چکیده
منابع مشابه
Gain-Scheduled H2 Filter Synthesis via Polynomially Parameter-Dependent Lyapunov Functions with Inexact Scheduling Parameters
This paper addresses the design problem of GainScheduled (GS) H2 filters for Linear Parameter-Varying (LPV) systems under the condition that only inexactly measured scheduling parameters are available. The state-space matrices of the LPV systems are supposed to be polynomially parameter dependent and those of filters which are to be designed are supposed to be rationally parameter dependent. Th...
متن کاملCounter-example to a Common Lpv Gain-scheduling Design Approach
The shortcomings of a popular LPV gain-scheduling design approach are demonstrated by a simple counterexample. It is shown that, for a very general class of nonlinear systems, such an ad hoc design approach is unnecessary since soundly-based methods exist for transforming the plant dynamics into LPV/quasi-LPV form.
متن کاملA Gain Scheduling Approach to Active Queue Management
The aim of this paper is to discuss the use of gain scheduling to improve the performance of classical AQM controllers. We show that by using gain scheduling it is possible to synthesize controllers able to better cope with unwanted variations of the network operating regime; for example variations of the round-trip time, the load or the buffer capacities. Simulations are provided to compare th...
متن کاملTransfer Function Synthesis without Quantifier Elimination
Abstract. Traditionally, transfer functions have been designed manually for each operation in a program, instruction by instruction. In such a setting, a transfer function describes the semantics of a single instruction, detailing how a given abstract input state is mapped to an abstract output state. The net effect of a sequence of instructions, a basic block, can then be calculated by composi...
متن کاملA Variable Elimination Approach for Optimal Scheduling with Linear Preferences
In many practical scheduling problems, feasible solutions can be partially ordered according to differences between the temporal objects in each solution. Often, these orderings can be computed from a compact value function that combines the local preference values of the temporal objects. However, in part because it is natural to view temporal domains as continuous, finding complete, preferred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.12.347