期刊文献+

基于Bellman-Ford算法的空中编队协同对岸打击 被引量:1

Air Formation Coordinated Operation Against Ground Based on Bellman-Ford Algorithm
下载PDF
导出
摘要 为提高空中编队协同对岸打击作战能力,基于Bellman-Ford算法对空中编队协同对岸打击进行研究。为解决空中编队协同对岸打击作战中的时间协同问题,针对空中编队协同对岸打击作战的时间约束特点并结合简单时间约束网络理论,将其时间约束网络模型转化为简单时间约束网络模型;为克服传统简单时间约束网络一致性检测算法时间耗费大的缺点,提出借鉴Bellman-Ford算法检测一致性的新方法,并以实例进行检测、分析。结果表明:该方法能有效解决空中编队对岸打击作战中的时间协同问题,能减小时间复杂度,提高协同效率。 For improving the ability of air formation coordinated operation against ground, the air formation coordinated operation against ground based on Bellman-Ford algorithm was researched. In order to resolve the time coordination problem of air formation coordinated operation against ground, the temporal constraint network (TCN) model on air formation was translated into simple temporal constraint network (STCN) model, according to the trait of temporal constraint on air formation coordinated operation against ground and STCN theory. To overcome the disadvantage of traditional STCN consistency testing algorithm on time consumption, a new algorithm be fit for dynamic coordination combining the character of air formation coordinated operation against ground was propounded. Theoretic analysis showed that: the time coordination problem in air formation coordinated operation against ground was resolved effectively, time complexity was decreased and coordinated efficiency was improved.
出处 《兵工自动化》 2012年第9期24-26,共3页 Ordnance Industry Automation
关键词 空中编队 协同对岸打击 简单时间约束网络 一致性检测 Bellman-Ford算法 air formation coordinated operation against ground STCN consistency testing Bellman-Ford algorithm
  • 相关文献

参考文献6

  • 1徐洗.空军作战运筹[M].北京:空军指挥学院出版社,2002:4-7.
  • 2Allen J. Maintaining knowledge about temporal intervals[J]. Communications of the ACM, 1983, 26(11): 832-843.
  • 3Allen J. Towards a general theory of action and time[J]. Artificial Intelligence, 1984, 23(2): 123-154.
  • 4EDDIE SCHWALB, LLUIS VILA. Temporal Constraints: A Survey[J]. Constraints: An International Journal, 1998(2): 129-149.
  • 5徐瑞,徐晓飞,崔平远.基于时间约束网络的动态规划调度算法[J].计算机集成制造系统-CIMS,2004,10(2):188-194. 被引量:11
  • 6Muscettola N, Nayak P P, Pell B, et al. Remote agent: to boldly go where no AI system has gone before[J]. Artificial Intelligence, 1998, 103(1-2): 5-47.

二级参考文献12

  • 1段凡丁.关于最短路径的SPFA快速算法[J].西南交通大学学报,1994,29(2):207-212. 被引量:57
  • 2ALLEN J F.Maintaining knowledge about temporal intervals[J].Communications of the ACM,1983,26(11):832-843.
  • 3ALLEN J.Planning as temporal reasoning[A].KR'91:Principles of Knowledge Representation and Reasoning[C].Cambridge,MA,USA:Morgan Kaufmann Publishers,1991.3-14.
  • 4BADALONI S,BERATI M.Hybrid temporal reasoning for planning and scheduling[A].Proceedings of 3rd Workshop on Temporal Representation and Reasoning (TIME'96)[C].Los Alamitos,CA:IEEE,1996.39-44.
  • 5VRBSKY S V,TOMIC S.Satisfying temporal consistency constraints of real-time databases[J].The Journal of Systems and Software,1999,45(1):45-60.
  • 6MUSCETTOLA N,NAYAK P P,PELL B,WILLIAMS B.Remote agent:to boldly go where no AI system has gone before[J].Artificial Intelligence,1998,103(1-2):5-47.
  • 7DECHTER R,MEIRI I,PEARL J.Temporal constraint network[J].Artificial Intelligence,1991,49(1-3):61-95.
  • 8SCHWALB E,VILA L.Temporal constraints:a survey[J].Constraints:An International Journal,1998,3(2-3):129-149.
  • 9SCHWALB E,DECHTER R.Processing disjunctions in temporal constraint networks[J].Artificial Intelligence,1997,93(1-2):29-61.
  • 10ZWICK U.All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms[A].Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science (FOCS'98)[C].Los Alamitos,CA:IEEE,1998.310-319.

共引文献12

同被引文献3

引证文献1

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部