首页> 外文期刊>IEEE Transactions on Aerospace and Electronic Systems >Moving horizon Nash strategies for a military air operation
【24h】

Moving horizon Nash strategies for a military air operation

机译:军事空中行动的移动视野纳什策略

获取原文
获取原文并翻译 | 示例
           

摘要

Dynamic game theory has recently received considerable attention as a possible technology for formulating control actions for decision makers in an extended complex enterprise that involves an adversary. Examples of such enterprises are very common in military operations. Enterprises of this type are typically modeled by a highly nonlinear discrete time dynamic system whose state is controlled by two teams of decision makers each with a different objective function and possibly with a different hierarchy of decision making. Because of the complexity of such systems, the traditional solutions from dynamic game theory that involve optimizing objective functions over the entire time horizon of the system are computationally extremely difficult, if not impossible, to derive. We discuss a solution approach where at each step the controllers limit the computation of their actions to a short time horizon that may involve only the next few time steps. This moving horizon solution, although suboptimal in the global sense, is very useful in taking into account the possible near-term control actions of the adversary. To illustrate this solution methodology, we consider an example of an extended military enterprise that involves two opposing forces engaged in a battle.
机译:动态博弈理论作为一种可能的技术,最近已经受到相当多的关注,该技术可以为涉及敌手的扩展型复杂企业的决策者制定控制措施。这种企业的例子在军事行动中非常普遍。这种类型的企业通常由高度非线性的离散时间动态系统建模,该系统的状态由两个决策者团队控制,每个团队的目标功能不同,决策层次可能不同。由于此类系统的复杂性,动态博弈论的传统解决方案需要在系统的整个时间范围内优化目标函数,即使不是不可能,在计算上也极其困难。我们讨论一种解决方案方法,在每个步骤中,控制器都将其动作的计算限制在较短的时间范围内,该时间范围可能仅涉及接下来的几个时间步骤。尽管在全局意义上说,这种动态视野解决方案不是最优的,但在考虑到对手可能的近期控制行动时非常有用。为了说明此解决方案方法,我们以一个扩展的军事企业为例,其中涉及两个敌对部队进行战斗。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号