期刊文献+

基于网络整体效能的战斗毁伤模型 被引量:19

An attrition model with global network efficiency
原文传递
导出
摘要 经典Lanchester平方律揭示战斗的规模效应,但其战场通视和直瞄假设面临挑战.基于战斗信息流的符号学分析,认为现代战场是网络通视与直瞄的,将基于网络整体效能的随机格斗与Albert网络"去点"操作结合,提出统一表示交战行为与协作行为的网络随机格斗模型,并试验评估体系作战的动态网络效应:(1)Lanchester平方律是体系作战网络效应的最优特例;(2)网络系统作战效能既与有效兵力生成因素(单元效能和网络拓扑)相关,也与目标冗余度相关,且随战斗进程递减;(3)无标度网络比随机网络"有效、鲁棒但脆弱". The classic Lanchester equations reveal size effect of combat, but their assumption is challenged in the modern warfare that the battlefield is universal sensible and direct targeting. Through the semiotical analysis of the combat information flow in microscopic view, it is suggested that the modern battlefield is networked universal sensible and direct targeting, and by combining the Albert's removal of node operation with the stochastic duel based on the global network efficiency, a novel model stochastic duel of networks is put forward which represents combat behavior and cooperation behavior in an unitary form. The network effect of networked combat system (NCS) has been characterized in the model: (1) Lanchester square law is the optimized speci case of network effect of NCS; (2) a NCS loses its attrition- rate along with the combat process, which relates not only the generative factors of effective combat power, such as its weapon performance and the structure of the network, but also the rate of target redundancy; (3) the scale-free network is more superiority, robust yet fragile than the random network in combat.
作者 谭东风
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2013年第2期521-528,共8页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(70571084 61074121) 湖南省自然科学基金(07JJ5095) 国家部委预研计划(513040104-2)
关键词 作战建模 复杂网络 LANCHESTER方程 信息效能 combat modeling complex network Lanchester equations network efficiency
  • 相关文献

参考文献27

  • 1Von Clausewkz C. On War[M].Princeton,New Jersey:Princeton University Press,1976.
  • 2Lanchester F W. Aircraft in warfare:The dawn of the fourth arm[J].Engineering,1914.98.
  • 3Dupuy T N. Numbers,Predictions and War[M].New York:The Bobbs-Merrill Company,Inc,Indianapolis,1979.
  • 4Ancker C J Jr. One-on-one stochastic duels[J].Research Monograph Military Applications Section of the Operations Research Society of America,1982.
  • 5Kress M. The many-on-one stochastic duels[J].Naval Research Logistics,1987.713-720.
  • 6Shahrooz Parkhideh,Gafarian A V. General solution to many-on-many heterogeneous stochastic combat[J].Naval Research Logistics,1996.937-953.
  • 7Holland J. Emergence —— From Chaos to Order[M].New York:Addison-Wesley Publishing Company,Inc,1998.
  • 8Ilachinski A. Artificial War:MultiAgent-Based Simulation of Combat[M].Singapore:World Scientific Publishing Cop Ltd,2004.
  • 9Barabási A-L. Linked:The New Science of Networks[M].Massachusetts:Persus Publishing,2002.
  • 10Alberts D S,Garstka J J,Stein F P. Network Centric Warfare -- Developing and Leveraging Information Superiority[M].Washington:CCRP Publication Series,2001.

二级参考文献63

  • 1汪秉宏,周涛,何大韧.统计物理与复杂系统研究最近发展趋势分析[J].中国基础科学,2005,7(3):37-43. 被引量:33
  • 2张最良.军事运筹学[M].北京:军事科学出版社,1993..
  • 3[1]邦迪 J A,默蒂 U S R.图论及其应用[M].吴望名译.北京:科学出版社,1984.
  • 4[1]Lanchester F W.Aircraft in Warfare:The Dawn of the Fourth Arm[J].Engineering,1914,98,also in Newman J R eds.the World of Mathematics[C],Redmond:Microsoft Press,1988,4:2113-2131.
  • 5[2]Taylor J G.Lanchester Models of Warfare.(Vol 1-2)[M].Calif:Naval Postgrade Scholl Monterey,1983.
  • 6[6]Culioli J C,Protopopescu V.Parameter Identification for Generalized Lanchester's Equations[R],ORNL/TM-11367,1990.
  • 7[8]Erds P,Rényi A.On the Evolution of Random Graphs[J].Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960,5:17-61.
  • 8[9]Watts D J,Strogatz S H.Collective Dynamics of "Small-world" Networks[J].Nature,1998,393:440-442.
  • 9[10]Barabási A L,Albert R.Emergence of Scaling in Random Networks[J].Science,1999,286:509-512.
  • 10[11]Newman M E J.The Structure and Function of Complex Networks[J].Phys.Rev.E.,2003,67:026126.

共引文献72

同被引文献291

引证文献19

二级引证文献104

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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