A Stochastic Model for Optimization of Search for Moving Objects
Tóm tắt
Collision of interests of two parties is typical for search processes. Optimization of a search process provides determination of the best strategies (policies) for both sides depending on their knowledge. Then, since dedicated resources for the search process are usually limited, the problem of optimal distribution of search resources, i.e., purpose assignment problem, arises as well.
Tài liệu tham khảo
A. A. Chikrii and. G. Ts. Chikrii, “On discrete Markovian model of search for moving objects,” in: Proc. 7th Intern. Symp. on Dynamic Games and Appl., Kahanawa (Japan), (1996), pp. 108–121.
J. McKinsey, Introduction to Game Theory [Russian translation], Fizmatgiz, Moscow (1960).
V. P. Gulenko and N. D. Shvab, “The method of sequential two-dimensional optimization for mathematical programming problems,” Kibern. Vych. Tekhn., Issue 119, 31–43 (1998).
V. S. Mihalevich, N. Z. Shor, L. A. Galustova et al., Computation Methods of Selecting Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).