• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFAC World Congress >Solvability Sets in Pursuit Problem with Two Pursuers and One Evader
【24h】

Solvability Sets in Pursuit Problem with Two Pursuers and One Evader

机译：追求追求问题的可解性，两个追求者和一个逃避者

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The paper deals with a differential game with two pursuers and one evader. Dynamics of each object is described by a stationary linear system of a general type with a scalar control. The payoff is the minimum of two one-dimensional misses between the first pursuer and the evader and between the second pursuer and the evader. The misses are calculated at the instants fixed in advance. A method is described for constructing the level sets of the value function (i.e., the solvability ones for the game under consideration). For the case of "strong" pursuers, the optimal strategies are described. Results of simulations are given. The zero-sum game investigated can be useful for the research of the final stage of a space pursuit, where two pursuing objects and one evader are involved.
机译：本文与两个追捕者和一个逃避者的差异游戏进行了差异。通过具有标量控制的一般类型的静止线性系统描述了每个对象的动态。支付是第一个追捕者和逃避者之间的两个一维未命中，并且在第二个追求者和逃避者之间。未命中的未命中在预先固定的瞬间计算。描述了一种用于构建价值函数的级别组（即，用于所考虑的游戏的可解性的方法）。对于“强”追求的情况，描述了最佳策略。给出了模拟结果。调查的零和游戏对于对空间追求的最终阶段的研究有用，其中涉及两个追求物品和一个逃避。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号