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 that for any control of the evader the state of system <svg style="vertical-align:-2.3205pt;width:26.15px;" id="M1" height="15.0875" version="1.1" viewBox="0 0 26.15 15.0875" width="26.15" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg"> <g transform="matrix(.017,-0,0,-.017,.062,12.138)"><path id="x1D467" d="M475 445l-64 -69q-119 -128 -289 -280q27 6 81 -15q66 -26 102 -26q48 0 111 93l23 -19q-41 -84 -75.5 -116.5t-73.5 -32.5q-37 0 -147 53q-43 21 -63 7q-22 -15 -38 -41q-4 -7 -11 -7q-8 10 -8 26q0 38 47 83l292 273q-32 -5 -67 -1q-63 7 -105 7q-32 0 -53.5 -22&#xA;t-47.5 -67l-25 13q15 39 38 78q40 66 83 66q57 0 120 -12q52 -10 80 -10q29 0 67 42z" /></g><g transform="matrix(.017,-0,0,-.017,8.528,12.138)"><path id="x28" d="M300 -147l-18 -23q-106 71 -159 185.5t-53 254.5v1q0 139 53 252.5t159 186.5l18 -24q-74 -62 -115.5 -173.5t-41.5 -242.5q0 -130 41.5 -242.5t115.5 -174.5z" /></g><g transform="matrix(.017,-0,0,-.017,14.409,12.138)"><path id="x1D461" d="M324 430l-26 -36l-112 -4l-55 -265q-13 -66 7 -66q13 0 44.5 20t50.5 40l17 -24q-38 -40 -85.5 -73.5t-87.5 -33.5q-50 0 -21 138l55 262h-80l-2 8l25 34h66l25 99l78 63l10 -9l-37 -153h128z" /></g><g transform="matrix(.017,-0,0,-.017,20.206,12.138)"><path id="x29" d="M275 270q0 -296 -211 -440l-19 23q75 62 116.5 174t41.5 243t-42 243t-116 173l19 24q211 -144 211 -440z" /></g> </svg> 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.

Ҳали таржима қилинмаган