首页> 外文期刊>Computers & operations research >An optimal control problem in determining the optimal reinforcement schedules for the Lanchester equations
【24h】

An optimal control problem in determining the optimal reinforcement schedules for the Lanchester equations

机译:确定Lanchester方程的最佳加固时间表的最佳控制问题

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

摘要

An optimal control problem for the Lanchester equations by utilizing the iterative regularization method, i.e. a nonparametric conjugate gradient method (NP-CGM), with adjoint equations is illustrated to determine the optimal reinforcement schedules based on the desired (or required) force strengths at some specified time. The numerical simulations are performed to test the validity of the present algorithm by using three different types of force strength requirements. Results show that the method is powerful enough to yield desired strengths at all points during the battle. Moreover, the advantages of applying the NP-CGM in the optimal control calculations lie in that (ⅰ) the initial guesses of the reinforcement schedules can be chosen arbitrarily and (ⅱ) the optimal time-dependent reinforcement schedules can be determined within a very short computer time.
机译:通过使用迭代正则化方法(即非参数共轭梯度法(NP-CGM))和伴随方程,对Lanchester方程的最优控制问题进行了说明,以基于在某些情况下所需的(或所需的)力强度来确定最佳的加固时间表。指定时间。通过使用三种不同类型的力强度要求,进行了数值模拟以测试本算法的有效性。结果表明,该方法足够强大,可以在战斗中的所有时刻产生所需的优势。此外,在最佳控制计算中应用NP-CGM的优势在于(ⅰ)可以任意选择加固时间表的初始猜测,并且(ⅱ)可以在很短的时间内确定最佳的随时间变化的加固时间表电脑时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号