排序方式: 共有164条查询结果,搜索用时 15 毫秒
61.
基于马尔柯夫过程的武器系统目标分配问题决策分析 总被引:3,自引:1,他引:2
将防空作战中武器系统目标分配决策作为一个在动态随机系统中实现最优化的问题,并用马尔柯夫过程理论进行建模分析,提出新的算法并运用Matlab编程;通过对实行不同策略时武器系统长期平均效能的分析比较,指出在目标分配问题上仅靠原有的静态线性规划决策方法是不够的,还必须考虑动态随机对抗过程本身的特性. 相似文献
62.
63.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
64.
65.
针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪. 相似文献
66.
67.
There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if Xi = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015 相似文献
68.
69.
研究不确定条件下的通信干扰任务分配优化问题具有重要的军事意义。基于干扰效益因子的概念,剖析了影响通信干扰任务分配的不确定性因素,建立了基于双层随机机会约束规划的通信干扰任务分配优化模型,设计了遗传蚁群智能算法,实例计算得到了通信干扰任务分配的最佳策略。 相似文献
70.