Bilinear Markovian Processes of Search for Stationary and Moving Objects.

Panos M. Pardalos,Vitaliy A. Yatsenko,Michael B. Fenn,Arkadii A. Chikrii

Nato Science for Peace and Security Series D-Information and Communication Security（2014）

引用 0|浏览6

暂无评分

摘要

The cell model for the search of moving objects under conflict condition is advanced as demonstrated herein. The necessary conditions for the probability of detection in a finite time are derived. The various episodes of search, based on corresponding number with groups of controlled objects as participants, are analyzed in a unified scheme. The mathematical techniques for the creation of information technologies concerning the search of moving objects in condition of imperfect information is developed.

查看译文

关键词

bilinear process,game problem of search,probability of detection,Markovian chain,stationary target,necessary optimality conditions

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要