The basic concepts and models of weapon-target assignment （WTA） are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present ...The basic concepts and models of weapon-target assignment （WTA） are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present research on WTA is focused on models and algorithms. In the research on models of WTA, the static WTA models are mainly studied and the dynamic WTA models are not fully studied in deed. In the research on algorithms of WTA, the intelligent algorithms are often used to solve the WTA problem. The small scale of static WTA problems has been solved very well, however, the large scale of dynamic WTA problems has not been solved effectively so far. Finally, the characteristics of dynamic WTA are analyzed and directions for the future research on dynamic WTA are discussed.展开更多
The task of maintenance organization is very heavy at wartime.The usability of armaments may be greatly improved by efficient task scheduling.In order to recover the battle effectiveness of units in battlefield as fas...The task of maintenance organization is very heavy at wartime.The usability of armaments may be greatly improved by efficient task scheduling.In order to recover the battle effectiveness of units in battlefield as fast as possible,dynamic maintenance scheduling models with subject taken into account were built on the basis of analysis the feature of maintenance task.Maintenance task scheduling problem is very complicated.So it is decomposed into two sub-problems:static maintenance task scheduling and dynamic maintenance task scheduling problem with subject taken into account.Corresponding mathematic models were built to these sub-problems and their solutions were proposed.Dynamic maintenance task scheduling with subject taken into account is on the basis of static maintenance task scheduling.With the task changing in battlefield,dynamic task scheduling can be realized by repeatedly call of static maintenance task scheduling with subject taken into account.The experimented results show that dynamic maintenance task scheduling method with maintenance subject taken into account is valid.展开更多
This paper discusses a stochastic duel model between two forces. On one side is the guerrilla(or terrorists) which has only one weapon(or person), and on the other an organized force of some sort which has many weapon...This paper discusses a stochastic duel model between two forces. On one side is the guerrilla(or terrorists) which has only one weapon(or person), and on the other an organized force of some sort which has many weapons. The model is called the many-versus-one guerrilla war. The guerrilla side has a number of advantages such as choice of location and time of engagement, concealment by topography, observation of the intended target, and line of fire. The authors present these advantages in what they believe are a realistic scenario of a duel between the guerrilla force and the organized force. By the four suppositions coinciding with the practical duel background, the paper presents the formulas to calculate the satisfying probability, the weak satisfying probability, and the acceptable probability of the attack side.展开更多
基金This project was supported by the National Defense Pre-Research Foundation of China
文摘The basic concepts and models of weapon-target assignment （WTA） are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present research on WTA is focused on models and algorithms. In the research on models of WTA, the static WTA models are mainly studied and the dynamic WTA models are not fully studied in deed. In the research on algorithms of WTA, the intelligent algorithms are often used to solve the WTA problem. The small scale of static WTA problems has been solved very well, however, the large scale of dynamic WTA problems has not been solved effectively so far. Finally, the characteristics of dynamic WTA are analyzed and directions for the future research on dynamic WTA are discussed.
文摘The task of maintenance organization is very heavy at wartime.The usability of armaments may be greatly improved by efficient task scheduling.In order to recover the battle effectiveness of units in battlefield as fast as possible,dynamic maintenance scheduling models with subject taken into account were built on the basis of analysis the feature of maintenance task.Maintenance task scheduling problem is very complicated.So it is decomposed into two sub-problems:static maintenance task scheduling and dynamic maintenance task scheduling problem with subject taken into account.Corresponding mathematic models were built to these sub-problems and their solutions were proposed.Dynamic maintenance task scheduling with subject taken into account is on the basis of static maintenance task scheduling.With the task changing in battlefield,dynamic task scheduling can be realized by repeatedly call of static maintenance task scheduling with subject taken into account.The experimented results show that dynamic maintenance task scheduling method with maintenance subject taken into account is valid.
基金supported by the National Science Foundation of China under Grant No.60874118
文摘This paper discusses a stochastic duel model between two forces. On one side is the guerrilla(or terrorists) which has only one weapon(or person), and on the other an organized force of some sort which has many weapons. The model is called the many-versus-one guerrilla war. The guerrilla side has a number of advantages such as choice of location and time of engagement, concealment by topography, observation of the intended target, and line of fire. The authors present these advantages in what they believe are a realistic scenario of a duel between the guerrilla force and the organized force. By the four suppositions coinciding with the practical duel background, the paper presents the formulas to calculate the satisfying probability, the weak satisfying probability, and the acceptable probability of the attack side.
