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

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 pro...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2015-01, Vol.2015 (2015), p.1-10
Main Authors: Wang, Jinfu, Zhou, Zhongliang, Yu, Lei, Ruan, Chengwei
Format: Article
Language:English
Subjects:
Algorithms
Boundaries
Decomposition
Engineering
Global optimization
Heuristic methods
Mathematical analysis
Mathematical models
Missiles
Multiple objective analysis
Navigation
Optimization
Particle swarm optimization
Sequences
Solution space
Swarm intelligence
Threats
Velocity
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1024-123X
1563-5147
DOI:10.1155/2015/807925