矩阵在群体追猎模型创建中的应用方法

A. Dubanov
{"title":"矩阵在群体追猎模型创建中的应用方法","authors":"A. Dubanov","doi":"10.23947/2687-1653-2023-23-2-191-202","DOIUrl":null,"url":null,"abstract":"Introduction. It is obvious that in the near future, the issues of equipping moving robotic systems with autonomous control elements will remain relevant. This requires the development of models of group pursuit. Note that optimization in pursuit tasks is reduced to the construction of optimal trajectories (shortest trajectories, trajectories with differential constraints, fuel consumption indicators). At the same time, the aspects of automated distribution by goals in group pursuit were not considered. To fill this gap, the presented piece of research has been carried out. Its result should be the construction of a model of automated distribution of pursuers by goals in group pursuit.Materials and Methods. A matrix was formed to study the multiple goal group pursuit. The control parameters for the movement of the pursuers were modified according to the minimum curvature of the trajectory. The methods of pursuit and approach were considered in detail. The possibilities of modifying the method of parallel approach were shown. Matrix simulation was used to build a scheme of multiple goal group pursuit. The listed processes were illustrated by functions in the given coordinate systems and animation. Block diagrams of the phase coordinates of the pursuer at the next step, the time and distance of the pursuer reaching the goal were constructed as a base of functions. In some cases, the location of targets and pursuers was defined as points on the circle of Apollonius. The matrix was formed by samples corresponding to the distribution of pursuers by goals.Results. Nine variants of the pursuit, parallel, proportional and three-point approach on the plane and in space were considered. The maximum value of the goal achievement time was calculated. There were cases when the speed vector of the pursuer was directed arbitrarily and to a point on the Apollonius circle. It was noted that the three-point approach method was convenient if the target was moving along a ballistic trajectory. To modify the method of parallel approach, a network of parallel lines was built on the plane. Here, the length of the arc of the line (which can be of any shape) and the array of reference points of the target trajectory were taken into account. An equation was compiled and solved with these elements. On an array of samples with corresponding time values, the minimum time was found, i.e., the optimal time for simultaneous group achievement of multiple goals was determined. For unified access to the library, the control vector was expressed through a one-parameter family of parallel planes. A library of calculations of control vectors was formed. An example of applying matrix simulation to group pursuit was shown. A scheme of group pursuit of multiple goals was presented. For two goals and three pursuers, six samples corresponding to the distribution of pursuers by goals were considered. The data was presented in the form of a matrix. Based on the research results, the computer program was created and registered – “Parallel Approach on Plane of Group of Pursuers with Simultaneous Achievement of the Goal”.Discussions and Conclusion. The methods of using matrices in modeling group pursuit were investigated. The possibility of modifying the method of parallel approach was shown. Matrix simulation of group pursuit enabled to build its scheme for a set of purposes. The matrix of the distribution of pursuers by goals would be generated at each moment of time. Methods of forming matrices of the distribution of pursuers and targets are of interest in the design of virtual reality systems, for tasks with simulating the process of group pursuit, escape, evasion. The dynamic programming method opens up the possibility of automating the distribution with optimization according to the specified parameters under the formation of the matrix of the distribution of pursuers by goals.","PeriodicalId":13758,"journal":{"name":"International Journal of Advanced Engineering Research and Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Methods for Applying Matrices when Creating Models of Group Pursuit\",\"authors\":\"A. Dubanov\",\"doi\":\"10.23947/2687-1653-2023-23-2-191-202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Introduction. It is obvious that in the near future, the issues of equipping moving robotic systems with autonomous control elements will remain relevant. This requires the development of models of group pursuit. Note that optimization in pursuit tasks is reduced to the construction of optimal trajectories (shortest trajectories, trajectories with differential constraints, fuel consumption indicators). At the same time, the aspects of automated distribution by goals in group pursuit were not considered. To fill this gap, the presented piece of research has been carried out. Its result should be the construction of a model of automated distribution of pursuers by goals in group pursuit.Materials and Methods. A matrix was formed to study the multiple goal group pursuit. The control parameters for the movement of the pursuers were modified according to the minimum curvature of the trajectory. The methods of pursuit and approach were considered in detail. The possibilities of modifying the method of parallel approach were shown. Matrix simulation was used to build a scheme of multiple goal group pursuit. The listed processes were illustrated by functions in the given coordinate systems and animation. Block diagrams of the phase coordinates of the pursuer at the next step, the time and distance of the pursuer reaching the goal were constructed as a base of functions. In some cases, the location of targets and pursuers was defined as points on the circle of Apollonius. The matrix was formed by samples corresponding to the distribution of pursuers by goals.Results. Nine variants of the pursuit, parallel, proportional and three-point approach on the plane and in space were considered. The maximum value of the goal achievement time was calculated. There were cases when the speed vector of the pursuer was directed arbitrarily and to a point on the Apollonius circle. It was noted that the three-point approach method was convenient if the target was moving along a ballistic trajectory. To modify the method of parallel approach, a network of parallel lines was built on the plane. Here, the length of the arc of the line (which can be of any shape) and the array of reference points of the target trajectory were taken into account. An equation was compiled and solved with these elements. On an array of samples with corresponding time values, the minimum time was found, i.e., the optimal time for simultaneous group achievement of multiple goals was determined. For unified access to the library, the control vector was expressed through a one-parameter family of parallel planes. A library of calculations of control vectors was formed. An example of applying matrix simulation to group pursuit was shown. A scheme of group pursuit of multiple goals was presented. For two goals and three pursuers, six samples corresponding to the distribution of pursuers by goals were considered. The data was presented in the form of a matrix. Based on the research results, the computer program was created and registered – “Parallel Approach on Plane of Group of Pursuers with Simultaneous Achievement of the Goal”.Discussions and Conclusion. The methods of using matrices in modeling group pursuit were investigated. The possibility of modifying the method of parallel approach was shown. Matrix simulation of group pursuit enabled to build its scheme for a set of purposes. The matrix of the distribution of pursuers by goals would be generated at each moment of time. Methods of forming matrices of the distribution of pursuers and targets are of interest in the design of virtual reality systems, for tasks with simulating the process of group pursuit, escape, evasion. The dynamic programming method opens up the possibility of automating the distribution with optimization according to the specified parameters under the formation of the matrix of the distribution of pursuers by goals.\",\"PeriodicalId\":13758,\"journal\":{\"name\":\"International Journal of Advanced Engineering Research and Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advanced Engineering Research and Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23947/2687-1653-2023-23-2-191-202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Engineering Research and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23947/2687-1653-2023-23-2-191-202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

介绍。很明显,在不久的将来,为移动机器人系统配备自主控制元件的问题仍将是相关的。这就需要群体追求模式的发展。注意,追踪任务的优化被简化为最优轨迹的构建(最短轨迹、微分约束轨迹、油耗指标)。同时,未考虑群体追求中按目标自动分配的问题。为了填补这一空白,已经进行了这项研究。其结果应该是构建群体追捕中按目标自动分配追捕者的模型。材料与方法。建立了一个矩阵来研究多目标群体追求问题。跟踪器的运动控制参数根据轨迹的最小曲率进行修改。详细讨论了跟踪和接近的方法。指出了改进并行逼近方法的可能性。采用矩阵仿真的方法建立了一种多目标群寻的方案。所列出的过程用给定坐标系中的函数和动画进行了说明。构建了下一步跟踪器的相位坐标框图、跟踪器到达目标的时间和距离框图作为函数的基础。在某些情况下,目标和追击者的位置被定义为阿波罗尼乌斯圆上的点。该矩阵由与目标跟踪者分布相对应的样本组成。在平面和空间上分别考虑了追迹、平行、比例和三点方法的9种变体。计算目标实现时间的最大值。在某些情况下,追赶者的速度矢量被任意地指向阿波罗尼乌斯圆上的一点。有人指出,如果目标沿弹道轨迹移动,三点接近法是方便的。为了改进平行逼近的方法,在平面上建立了平行线网络。这里考虑了直线的弧长(可以是任意形状)和目标轨迹的参考点阵列。用这些元素编制了一个方程并求解。在一组具有相应时间值的样本上,找到最小时间,即确定群体同时实现多个目标的最优时间。为了统一访问库,控制向量通过一个单参数的平行平面族来表示。建立了控制向量计算库。最后给出了矩阵仿真在群体追捕中的应用实例。提出了一种多目标群体追求方案。对于两个目标和三个追逐者,考虑六个与追逐者按目标分布相对应的样本。数据以矩阵的形式呈现。在研究结果的基础上,编制并注册了“同时达到目标的追逐群平面平行逼近”的计算机程序。讨论与结论。研究了在群体追捕建模中使用矩阵的方法。给出了改进并行逼近方法的可能性。群体追捕的矩阵仿真可以建立一组目标的群体追捕方案。在每一时刻,将生成按目标排列的追击者分布矩阵。在虚拟现实系统设计中,跟踪者和目标分布矩阵的形成方法是模拟群体追击、逃跑、躲避过程的重要任务。动态规划方法在目标分布矩阵形成的条件下,开辟了按指定参数进行自动优化分配的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Methods for Applying Matrices when Creating Models of Group Pursuit
Introduction. It is obvious that in the near future, the issues of equipping moving robotic systems with autonomous control elements will remain relevant. This requires the development of models of group pursuit. Note that optimization in pursuit tasks is reduced to the construction of optimal trajectories (shortest trajectories, trajectories with differential constraints, fuel consumption indicators). At the same time, the aspects of automated distribution by goals in group pursuit were not considered. To fill this gap, the presented piece of research has been carried out. Its result should be the construction of a model of automated distribution of pursuers by goals in group pursuit.Materials and Methods. A matrix was formed to study the multiple goal group pursuit. The control parameters for the movement of the pursuers were modified according to the minimum curvature of the trajectory. The methods of pursuit and approach were considered in detail. The possibilities of modifying the method of parallel approach were shown. Matrix simulation was used to build a scheme of multiple goal group pursuit. The listed processes were illustrated by functions in the given coordinate systems and animation. Block diagrams of the phase coordinates of the pursuer at the next step, the time and distance of the pursuer reaching the goal were constructed as a base of functions. In some cases, the location of targets and pursuers was defined as points on the circle of Apollonius. The matrix was formed by samples corresponding to the distribution of pursuers by goals.Results. Nine variants of the pursuit, parallel, proportional and three-point approach on the plane and in space were considered. The maximum value of the goal achievement time was calculated. There were cases when the speed vector of the pursuer was directed arbitrarily and to a point on the Apollonius circle. It was noted that the three-point approach method was convenient if the target was moving along a ballistic trajectory. To modify the method of parallel approach, a network of parallel lines was built on the plane. Here, the length of the arc of the line (which can be of any shape) and the array of reference points of the target trajectory were taken into account. An equation was compiled and solved with these elements. On an array of samples with corresponding time values, the minimum time was found, i.e., the optimal time for simultaneous group achievement of multiple goals was determined. For unified access to the library, the control vector was expressed through a one-parameter family of parallel planes. A library of calculations of control vectors was formed. An example of applying matrix simulation to group pursuit was shown. A scheme of group pursuit of multiple goals was presented. For two goals and three pursuers, six samples corresponding to the distribution of pursuers by goals were considered. The data was presented in the form of a matrix. Based on the research results, the computer program was created and registered – “Parallel Approach on Plane of Group of Pursuers with Simultaneous Achievement of the Goal”.Discussions and Conclusion. The methods of using matrices in modeling group pursuit were investigated. The possibility of modifying the method of parallel approach was shown. Matrix simulation of group pursuit enabled to build its scheme for a set of purposes. The matrix of the distribution of pursuers by goals would be generated at each moment of time. Methods of forming matrices of the distribution of pursuers and targets are of interest in the design of virtual reality systems, for tasks with simulating the process of group pursuit, escape, evasion. The dynamic programming method opens up the possibility of automating the distribution with optimization according to the specified parameters under the formation of the matrix of the distribution of pursuers by goals.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Investigation of Dynamic Characteristics of an Automated Position Long-Stroke Pneumatic Actuator of Fabrication System Optimization of Geometric Characteristics of Cycloidal Profiles of Gerotor Hydraulic Machines Sensitivity of Diffusion-Weighted Image Combined with T2 Turbo Inversion Recovery Magnitude Sequence and as an Alternative to Contrast-Enhanced MRI in the Detection of Perianal Fistula GATCGGenerator: New Software for Generation of Quasirandom Nucleotide Sequences 3D Human Motion Capture Method Based on Computer Vision
×
引用
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