Optimal search for moving objects in a discrete domain (Q2881309)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal search for moving objects in a discrete domain |
scientific article; zbMATH DE number 6021803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal search for moving objects in a discrete domain |
scientific article; zbMATH DE number 6021803 |
Statements
4 April 2012
0 references
signal
0 references
optimal searching
0 references
multi-channel communication system
0 references
Markov process
0 references
semi-Markov process
0 references
Optimal search for moving objects in a discrete domain (English)
0 references
The authors deal with the problem of optimal searching for signals in a multi-channel communication system with the help of methods of the Markov and semi-Markov process theory. Problems solved by this approach have been collected in the first part of the book \textit{L. N. Shlepakov} and \textit{N. G. Vovkodav} [Pratsi Instytutu Matematyky Natsional'noï\ Akademiï\ Nauk Ukraïny. Matematyka ta ïï\ Zastosuvannya 49. Kyïv: Instytut Matematyky NAN Ukraïny. 214~p. (2003; Zbl 1099.94013)]. The present book contains review of results from the mentioned monograph and proposes a new optimal search solved by the so-called ``phase enlargement method'' (see the book by \textit{V. S. Koroliuk} and \textit{N. Limnios} [Hackensack, NJ: World Scientific. xv, 331~p. (2005; Zbl 1101.60003)] for more results) which makes it possible to simplify the corresponding analytic calculations. There are eight of optimal search for signals in multi-channel communication systems united by a common approach to solving them.NEWLINENEWLINE The book is intended for mathematicians, engineers and students who are interested in applications of probability theory and theory of stochastic processes.
0 references