Bilinear Markov Processes of Searching for Moving Targets
Karen G. Dzyubenko, Arkadiy A. Chikriy · Journal of Automation and Information Sciences · 2001
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.