ATTRACTION SETS IN ATTAINABILITY PROBLEMS WITH ASYMPTOTIC-TYPE CONSTRAINTS

In control theory, the problem of constructing and investigating attainability domains is very important. However, under perturbations of constraints, this problem lacks stability. It is useful to single out the case when the constraints are relaxed. In this case, greater opportunities arise in terms of attainability, and often a useful effect can be observed even under slight relaxation of the constraints. This situation is analogous to the duality gap in convex programming. Very often, it is not possible to specify in advance how much relaxation of the constraints will occur. Therefore, attention is focused on the limit of the attainability domains under unrestricted tightening of the relaxed conditions. As a result, a certain attainability problem with asymptotic-type constraints arises. This problem formulation can be significantly generalized. Namely, we do not consider any unperturbed conditions at all and instead pose asymptotic-type constraints directly by means of a nonempty family of sets in the space of ordinary controls. Moreover, not only the case of control problems can be considered. In this general formulation, an analogue of the limit of attainability domains naturally appears as the relaxed conditions are infinitely tightened. For asymptotic constraints of this kind, we introduce solutions which are, at the conceptual level, similar to the approximate solutions of J.Warga, but we use filters or directedness, and not just sequences of ordinary solutions (controls). We investigate the most general attainability problem, in which asymptotic-type constraints can be generated by any nonempty family of sets in the ordinary solution space. It is shown, however, that the most practically interesting case is realized by filters, and the role of ultrafilters is noted as well. The action of constraints is associated with sets and elements of attraction. Furthermore, some properties of the family of all attraction sets are investigated.

Abstract licence: CC BY

8 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.