Robust Anisotropy-Based Control for Uncertain Descriptor Systems with Transient Response Constraints
In this paper, a problem of robust anisotropy-based control with regional pole assignment for descriptor systems with norm-bounded parametric uncertainties is concerned. The goal is to find a state-feedback control law, which guarantees desirable disturbance attenuation level from stochastic input with unknown covariance to controllable output of the closed-loop system, and ensures, that all finite eigenvalues of the closed-loop system belong to the given region inside the unit disk for all uncertainties from the given set.
An optimal control problem is formulated for a class of nonlinear systems for which there exists a coordinate representation (diffeomorphism) transforming the original system into a system with a linear main part and a nonlinear feedback. In this case the coordinate transformation significantly changes the form of original quadratic functional. The penalty matrices become dependent on the system state. The linearity of the structure of the transformed system and the quadratic functional make it possible to pass over from the Hamilton–Jacoby–Bellman equation to the Riccati type equation with state-dependent parameters upon the control synthesis. Note that it is impossible to solve the obtained form of Riccati equation analytically in the general case. It is necessary to approximate the solution; this approximation is realized by numerical methods using symbolic computer packages or interpolation methods. In the latter case, it is possible to obtain the suboptimal control. The presented example illustrates the application of the proposed control method for the feedback linearizable nonlinear system.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
This paper is dedicated to optimal state-feedback control problem for discrete-time descriptor systems in presence of “colored” noise with known mean anisotropy level. Here “colored” noise stands for a stationary Gaussian sequence, generated by a linear shaping filter from the Gaussian white noise sequence. The control goal is to find a state feedback control law which makes the closed-loop system admissible and minimizes its a-anisotropic norm (mean anisotropy level a is known).
The theoretical fundamentals for solving the linear quadratic problems may be some times used to design the optimal control actions for the nonlinear systems. The method relying on the Riccati equation with state-dependent coefficients is promising and rapidly developing tools for design of the nonlinear controllers. The set of possible suboptimal solutions is generated by ambiguous representation of the nonlinear system as a linearly structured system with state-depended coefficients and the lack of sufficiently universal algorithms to solve the Riccati equation also having state-depended coefficients. The paper proposed a method to design a guaranteed control for the uncertain nonlinear plant with state-depended parameters. An example of design the controller for an uncertain nonlinear system was presented.
In this paper, anisotropy-based control problem with regional pole assignment for descriptor systems is investigated. The purpose is to find a state-feedback control law, which guar- antees desirable disturbance attenuation level from stochastic input with unknown covariance to controllable output of the closed-loop system, and ensures, that all finite eigenvalues of the closed-loop system belong to the given region inside the unit disk. The proposed control design procedure is based on solving convex optimization problem with strict constraints. The numerical effectiveness is illustrated by numerical example.
In this paper, linear discrete-time descriptor systems with norm-bounded parametric uncertainties are under consider- ation. The input signal is supposed to be a “colored” noise with bounded mean anisotropy. Sufficient conditions of anisotropic norm boundedness for such class of systems are given.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.