Sequence and Direction Planning of Multiobjective Attack in Virtual Navigation Based on Variable Granularity Optimization Method

Chengwei Ruan, Lei Yu, Zhongliang Zhou and Jinfu Wang

Mathematical Problems in Engineering, 2015, vol. 2015, 1-10

Abstract:

In multiobjective air attacking tasks, it is essential to find the optimal combat preplanning for the attacking flight. This paper solves the planning problem by decomposing it into two subproblems: attacking sequence planning and attacking direction planning. According to this decomposition, we propose the VGHPSO (Variable Granularity Hybrid Particle Swarm Optimization) method. VGHPSO employs the Particle Swarm Optimization, a metaheuristic global optimization method, to solve the planning problem in multiple granularities, including optimizing the high-level attacking sequence and optimizing the low-level attacking directions for engagements. Furthermore, VGHPSO utilizes infeasible individuals in the swarm in order to enhance the capability of searching in the boundary of the feasible solution space. Simulation results show that the proposed model is feasible in the combat, and the VGHPSO method is efficient to complete the preplanning process.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/807925.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/807925.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:807925

DOI: 10.1155/2015/807925

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().