Nonlinear optimal model and solving algorithms for platform planning problem in battlefield

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Platform planning is one of the important problems in the command and control (C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange (PWE) method are used to maximize multiple tasks completion qualities. Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.

Cite

CITATION STYLE

APA

Xun, W., Peiyang, Y., Jieyong, Z., & Lujun, W. (2018). Nonlinear optimal model and solving algorithms for platform planning problem in battlefield. Journal of Systems Engineering and Electronics, 29(5), 983–994. https://doi.org/10.21629/JSEE.2018.05.10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free