Linear discrete pursuit game problem with total constraints

We study a linear discrete pursuit game problem of one pursuer and one evader. Control vectors of the players are subjected to total constraints which are discrete analogs of the integral constraints. By definition pursuit can be completed in the game if there exists a strategy of the pursuer such t...

詳細記述

保存先:
書誌詳細
主要な著者: Kuchkarov, Atamurat, Ibragimov, Gafurjan, Sotvoldiev, Akmal
フォーマット: 論文
言語:English
出版事項: Hindawi Publishing Corporation 2013
オンライン・アクセス:http://psasir.upm.edu.my/id/eprint/30065/1/30065.pdf
http://psasir.upm.edu.my/id/eprint/30065/
http://www.hindawi.com/journals/aaa/2013/840925/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
その他の書誌記述
要約:We study a linear discrete pursuit game problem of one pursuer and one evader. Control vectors of the players are subjected to total constraints which are discrete analogs of the integral constraints. By definition pursuit can be completed in the game if there exists a strategy of the pursuer such that for any control of the evader the state of system z(t) reaches the origin at some time. We obtain sufficient conditions of completion of the game from any initial position of the state space. Strategy of the pursuer is defined as a function of the current state of system and value of control parameter of the evader.