Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Bilinear Markov Processes of Searching for Moving Targets

Volume 33, Issue 5-8, 2001, 13 pages
DOI: 10.1615/JAutomatInfScien.v33.i5-8.30
Get accessGet access

ABSTRACT

A bilinear Markov model is considered with the aim of solving the game problems of discrete-time search for moving targets with a finite set of states. The necessary optimality conditions for various scenarios are given.

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain