A sufficient condition for existence of constantly nondominated trajectories in linear time-invariant systems
Journal Title: Automatyka - Year 2018, Vol 22, Issue 1
Abstract
This paper considers the multi-criteria optimal control problem in linear time-invariant systems with a single bounded input. It has been proven that, under certain assumptions, a state trajectory is non-dominated throughout the whole control process if and only if it is yielded by a control signal that belongs to a particular class of bang-bang functions. Furthermore, an explicit formula relating hyperplanes tangent to an attainable set and control switching times is presented.
Authors and Affiliations
Michał Domka
Keywords
Related Articles
- EP ID EP531447
- DOI 10.7494/automat.2018.22.1.7
- Views 65
- Downloads 0
New approach in modelling of the patients behavior in Primary Health Care (PHC)
The purpose of this paper is to show the concept of simulation of Primary Health Care (PHC) patients behavior. There are two reasons for interest in this area. The first of them is the need for support in decision making...
Analytic method grafpol TM of synthesing sequential control systems
This paper presents the Grafpol TM method and principles of synthesising sequential control algorithms by this method, as well as examples of applying this method for modelling processes and programming PLC controllers.
Supervising control system for oriented PV using weather forecasts
This paper is devoted to the problem of controlling an oriented PV using weather forecasts. The described solution presents the use of fuzzy logic fundamentals in order to increase the efficiency of a PV system. It differ...
Asymmetric cryptography and trapdoor one-way functions
The asymmetric-key (public-key) encryption scheme is considered to be the most important discovery in the history of cryptography. It is based on the use of two complementary keys generated according to a chosen trapdoor...
Novel method to simplify Boolean functions
Most methods for determining the prime implicants of a Boolean function depend on the minterms of the function. Deviating from this philosophy, this paper presents a method that depends on maxterms (the minterms of the c...