| Pursuit differential game with the dynamic in terms of acceleration function |
| کد مقاله : 1102-CCSU-FULL |
| نویسندگان |
|
اکبر اصغرزاده بناب *1، جواد محمدکریمی2، حمید بیگدلی1 1گروه مطالعات علم و فناوری، دانشگاه فرماندهی و ستاد آجا، تهران، ایران 2گروه مطالعات علوم و فناوری، دانشگاه فرماندهی و ستاد آجا، تهران، ایران |
| چکیده مقاله |
| In a given nonempty bounded, closed, so that is compact, and not necessarily convex subset of R^2, we study a pursuit differential game of many pursuers and many evaders based on acceleration function of the players. The game must be done in this set. We use coordinate-wise integral constraints for player’s control functions. The duration of the game for players, which is denoted by k, is fixed. We prove that if the total resource of each evader is less than that of each pursuer, then pursuit can be completed. Pursuers want to catch the pursuit and the evaders are avoiding that. To do this, during the game, pursuers want to minimize the distance to the evader and the evader want to maximize it. The game's cost function is the distance between evader and closest pursuer at time k. Completion of the pursuit means that the distance between pursuer and evader becomes zero. Some conditions for the completion of pursuit are derived. |
| کلیدواژه ها |
| Pursuit-Evasion, non-convex, Integral constraints |
| وضعیت: پذیرفته شده مشروط برای ارائه شفاهی |