zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Suboptimal fault tolerant control design with the use of discrete optimization. (English) Zbl 1155.49029
Summary: This paper presents a concept of designing fault tolerant control systems with the use of suboptimal methods. We assume that a given (nonlinear) dynamical process is described in a state space. The method consists in searching (at the off-line stage) for a trajectory of operational points of the system state space. The sought trajectory can be constrained by certain conditions, which can express faults or failures already detected. Within this approach, we are able to use the autonomous dynamics of the process in order to minimize a control cost index (a sub-optimality property). The search itself is based on finding a cheapest path in a graph structure, which represents the system’s dynamics described in the state space. Such a cheapest path (if it exists) represents the sought trajectory. Another (on-line) design stage consists in tracking this trajectory by an executive controller.
49N90Applications of optimal control and differential games
93C10Nonlinear control systems