On one simple pursuit problem of two rigidly coordinated evaders

N. Petrov
{"title":"On one simple pursuit problem of two rigidly coordinated evaders","authors":"N. Petrov","doi":"10.35634/2226-3594-2022-59-05","DOIUrl":null,"url":null,"abstract":"In a finite-dimensional Euclidean space, the problem of pursuit by a group of pursuers of two evaders described by a system of the form $$\\dot z_{ij} = u_i - v,\\quad u_i, v \\in V $$ is considered. It is assumed that all evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and control history of the evaders. The set of admissible controls $V$ is unit ball centered at zero, target sets are the origin. The goal of the pursuers' group is to capture at least one evader by two pursuers or to capture two evaders. In terms of initial positions and game parameters a sufficient condition for the capture is obtained. In the study, the method of resolving functions is used as a basic one, which allows obtaining sufficient conditions for the solvability of the approach problem in some guaranteed time.","PeriodicalId":42053,"journal":{"name":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","volume":"102 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35634/2226-3594-2022-59-05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In a finite-dimensional Euclidean space, the problem of pursuit by a group of pursuers of two evaders described by a system of the form $$\dot z_{ij} = u_i - v,\quad u_i, v \in V $$ is considered. It is assumed that all evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and control history of the evaders. The set of admissible controls $V$ is unit ball centered at zero, target sets are the origin. The goal of the pursuers' group is to capture at least one evader by two pursuers or to capture two evaders. In terms of initial positions and game parameters a sufficient condition for the capture is obtained. In the study, the method of resolving functions is used as a basic one, which allows obtaining sufficient conditions for the solvability of the approach problem in some guaranteed time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于两个刚性协调逃避者的简单追逐问题
在有限维欧几里得空间中,考虑了由形式为$$\dot z_{ij} = u_i - v,\quad u_i, v \in V $$的系统描述的两个逃避者的一组追逐者的追逐问题。假设所有逃避者使用相同的控制。追捕者根据关于逃避者的初始位置和控制历史的信息使用对抗策略。容许控制的集合$V$是以零为中心的单位球,目标集合是原点。追捕者组的目标是被两个追捕者捕获至少一个逃避者或捕获两个逃避者。在初始位置和博弈参数方面,得到了捕获的充分条件。在本研究中,采用函数解析法作为基本方法,可以在一定保证时间内得到逼近问题可解的充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.00
自引率
0.00%
发文量
0
期刊最新文献
Integration of the mKdV Equation with nonstationary coefficients and additional terms in the case of moving eigenvalues On the exploitation of a population given by a system of linear equations with random parameters Asymptotic expansion of the solution to an optimal control problem for a linear autonomous system with a terminal convex quality index depending on slow and fast variables Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices A bottleneck routing problem with a system of priority tasks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1