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)
Global optimization method for continuous-time sensor scheduling. (English) Zbl 1225.37120
The authors consider a situation in which several sensors are used to collect data for signal processing. Since operating multiple sensors simultaneously causes system interference, only one sensor can be activate at a time. The authors formulate the problem of “scheduling operation of the sensors to minimize the signal estimation error” as a discrete-valued optimal control problem. Instead of using the conventional optimization techniques, they decompose the transformed problem into a bi-level optimization problem and then solve the resulting problem using a discrete filled function method in conjunction with a conventional optimal control algorithm. They also perform some numerical simulations which seem to show that their algorithm is robust, efficient and reliable in attaining a new global optimal solution.

37N35Dynamical systems in control
37N40Dynamical systems in optimization and economics
90C06Large-scale problems (mathematical programming)