EVALUATION OF THE PURSUIT TIME IN DIFFERENTIAL GAMES OF MANY PLAYERS ON A CONVEX COMPACT

Q3 Engineering
M. Mamatov, A. Zunnunov, Egamberdi Esonov
{"title":"EVALUATION OF THE PURSUIT TIME IN DIFFERENTIAL GAMES OF MANY PLAYERS ON A CONVEX COMPACT","authors":"M. Mamatov, A. Zunnunov, Egamberdi Esonov","doi":"10.34229/1028-0979-2021-2-5","DOIUrl":null,"url":null,"abstract":"The paper is devoted to the study of the problem of constructing a pursuit strategy in simple differential games of many persons with phase constraints in the state of the players, in the sense of getting into a certain neighborhood of the evader. The game takes place in -dimensional Euclidean space on a convex compact set. The pursuit problem is considered when the number of pursuing players is , that is, less than , in the sense of — captures. A structure for constructing pursuit controls is proposed, which will ensure the completion of the game in a finite time. An upper bound is obtained for the game time for the completion of the pursuit. An auxiliary problem of simple pursuit on a unit cube in the first orthant is considered, and strategies of pursuing players are constructed to complete the game with special initial positions. The results obtained are used to solve differential games with arbitrary initial positions. For this task, a structure for constructing a pursuit strategy is proposed that will ensure the completion of the game in a finite time. The generalization of the problem in the sense of complicating the obstacle is also considered. A more general problem of simple pursuit on a cube of arbitrary size in the first orthant is considered. With the help of the proposed strategies, the possibilities of completing the pursuit are proved and an estimate of the time is obtained. As a consequence of this result, lower and upper bounds are obtained for the pursuit time in a game with ball-type obstacles. Estimates are obtained for the pursuit time when the compact set is an arbitrarily convex set. The concept of a convex set in a direction relative to a section, which is not necessarily convex, is defined. And in it the problem of simple pursuit in a differential game of many players is studied and the possibilities of completing the pursuit using the proposed strategy are shown. The time of completion of the pursuit of the given game is estimated from above.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Automation and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/1028-0979-2021-2-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

The paper is devoted to the study of the problem of constructing a pursuit strategy in simple differential games of many persons with phase constraints in the state of the players, in the sense of getting into a certain neighborhood of the evader. The game takes place in -dimensional Euclidean space on a convex compact set. The pursuit problem is considered when the number of pursuing players is , that is, less than , in the sense of — captures. A structure for constructing pursuit controls is proposed, which will ensure the completion of the game in a finite time. An upper bound is obtained for the game time for the completion of the pursuit. An auxiliary problem of simple pursuit on a unit cube in the first orthant is considered, and strategies of pursuing players are constructed to complete the game with special initial positions. The results obtained are used to solve differential games with arbitrary initial positions. For this task, a structure for constructing a pursuit strategy is proposed that will ensure the completion of the game in a finite time. The generalization of the problem in the sense of complicating the obstacle is also considered. A more general problem of simple pursuit on a cube of arbitrary size in the first orthant is considered. With the help of the proposed strategies, the possibilities of completing the pursuit are proved and an estimate of the time is obtained. As a consequence of this result, lower and upper bounds are obtained for the pursuit time in a game with ball-type obstacles. Estimates are obtained for the pursuit time when the compact set is an arbitrarily convex set. The concept of a convex set in a direction relative to a section, which is not necessarily convex, is defined. And in it the problem of simple pursuit in a differential game of many players is studied and the possibilities of completing the pursuit using the proposed strategy are shown. The time of completion of the pursuit of the given game is estimated from above.
凸紧集上多玩家微分博弈的追踪时间评价
本文研究了具有相位约束的多人简单微分对策中,在进入逃避者的某一邻域的情况下,在参与人的状态下构造追逐策略的问题。游戏发生在一个凸紧集上的维欧几里德空间中。当追逐者的数量小于,即在-捕获的意义上,考虑追逐问题。提出了一种能够保证在有限时间内完成游戏的寻迹控制结构。得到了完成追击的游戏时间的上界。考虑了一个辅助问题,即在第一正交的单位立方体上进行简单的追捕,构造了具有特定初始位置的追捕者的策略来完成博弈。所得结果用于求解具有任意初始位置的微分对策。针对这一任务,提出了一种构建追逐策略的结构,以确保在有限时间内完成游戏。同时考虑了问题在障碍物复杂性意义上的泛化。考虑了在第一正交上任意大小的立方体上进行简单追踪的更一般的问题。利用所提出的策略,证明了完成追捕的可能性,并得到了时间的估计。根据这一结果,得到了具有球型障碍物的游戏中追逐时间的下界和上界。得到了紧集为任意凸集时的追踪时间估计。定义了相对于截面方向上的凸集的概念,该截面不一定是凸的。研究了多参与人微分对策中的简单追击问题,并给出了用所提策略完成追击的可能性。完成给定游戏的时间是由上面估计的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Automation and Information Sciences
Journal of Automation and Information Sciences AUTOMATION & CONTROL SYSTEMS-
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: This journal contains translations of papers from the Russian-language bimonthly "Mezhdunarodnyi nauchno-tekhnicheskiy zhurnal "Problemy upravleniya i informatiki". Subjects covered include information sciences such as pattern recognition, forecasting, identification and evaluation of complex systems, information security, fault diagnosis and reliability. In addition, the journal also deals with such automation subjects as adaptive, stochastic and optimal control, control and identification under uncertainty, robotics, and applications of user-friendly computers in management of economic, industrial, biological, and medical systems. The Journal of Automation and Information Sciences will appeal to professionals in control systems, communications, computers, engineering in biology and medicine, instrumentation and measurement, and those interested in the social implications of technology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信