Weapon Scheduling Method for Cooperative Air-Defense Operation
Abstract
By defining the weapon scheduling plan and weapon combat action, the mathematical formulation of weapon scheduling problem for cooperative air-defense operation is introduced. On the basis of discussing the primary constraints of weapon scheduling process, the regulation constraint model and resource constraint model are established.
Then the evaluation criteria for weapon scheduling plan are analyzed. Finally, the weapon scheduling methods for single-target and multi-target are presented respectively by employing the definitions and models proposed in the paper.
1 Introduction
As cooperative air-defense operations involve multiple various anti-air weapons installed in multiple geographically distributed tactical platforms, the air-defense coverage can be greatly extended and the operation flexibility can be enormously promoted.
However, the complexity of weapon application in a cooperative air-defense operation is correspondingly increased. Exclusive problems of cooperative operations, such as overlapping trajectories, mutual weapon effects, and intersected platform routes, make it much more complicated to use weapons in a safe and effective way.
Weapon scheduling is a process of determining the specific action plans of the weapons on cooperative platforms. It's the key to appropriately apply weapons in cooperative operations. An operation with a proper weapon scheduling can not only avoid mutual weapon negative effects and eliminate operational resource conflicts, but also maximize weapon functional performance and generate systematic defense predominance. Therefore, the research on weapon scheduling methods for cooperative air-defense operations is very practical and significant.
2 Mathematical Formation of Weapon Scheduling Problem
The core of weapon scheduling problem is to seek out the optimal (or a satisfactory) weapon scheduling plan (WSP), namely, to arrange a series of weapon combat actions achieving the integral air-defense operational effectiveness to the maximum (or a satisfactory level).
Therefore, the weapon scheduling problem can be defined as: For a given function f(x)representing the fleet integral air-defense operational effectiveness, to formulate a weapon scheduling plan P0 subjecting to formula f (P0 )≥ f(x) (or f(P0) ≥C0 ), where variable x is a valid weapon scheduling plan, constant C0 is the operational effectiveness value of the referenced plan, and eligible plan P0 can be called as the weapon scheduling solution.
References:
1. Yu, L., Xing, C.F., Shi, Z.S.: A Research on Modeling of the Weapon Scheduling Problem
in Multi-platform Cooperative Air-Defense Operations. In: 4th International Workshop on
Advanced Computational Intelligence, pp. 783–787. IEEE Press, Wuhan (2011)
2. Ghallab, M., Nau, D., Traverso, P.: Automatic Planning: Theory and Practice. Tsinghua
University Press, Beijing (2008)
3. Maheswaran, R.T., Tambe, M., Bowring, E.: Taking DCOP to the Real World: Efficient
Complete Solutions for Distributed Multi-Event Scheduling. In: 3rd International Joint
Conference on Autonomous Agents and Multiagent Systems, pp. 310–317. IEEE Press,
New York (2004)
4. Gintner, V., Kliewer, N., Suhl, L.: Solving Large Multiple-Depot Multiple-Vehicle-Type
Bus Scheduling Problem in Practice. OR Spectrum 27, 507–523 (2005)
5. Sultanik, E.A., Modi, P.J., Regli, W.C.: On Modeling Multiagent Task Scheduling as a
Distributed Constraint Optimization Problem. In: 20th International Joint Conference on
Artificial Intelligence, pp. 1531–1536. AAAI Press, Hyderabad (2007)
6. Wu, L.: A Research on Real-Time Intelligence Algorithms for Dynamic Weapon Target
Allocation. Tsinghua University Press, Beijing (2008)
Preview Journal
Mau donasi lewat mana?
Donate with PaypalGopay-