Share Email Print

Proceedings Paper

A method of COA based on multi-agent evolutionary algorithm
Author(s): Xin Yu; Hui Wang; Licheng Jiao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Planning detailed military course of action (COA) is very complex and time consuming. In this paper, a method based on multi-agent evolutionary algorithm was presented to solve COA' resource management and scheduling problems. Each individual can be seen as an agent, in order to realize the local perceptivity of agents, the environment is organized as a latticelike structure. Each agent is fixed on a lattice point and it can only interact with its neighbors .Two agent behaviors which are competition behavior and self-learning behavior are designed. In this work, constraint functions are considered as functions to be optimized like the objectives and then added in competition strategy to deal with the multi-objective aspect of resource-constrained project scheduling problems. This approach avoids the use of a penalty function to deal with constraints. At the same time, the added constraint functions could make the whole algorithm evolving feasible. The simulation results demonstrated that this approach could improve searching ability of this algorithm, and the precision of this method.

Paper Details

Date Published: 30 October 2009
PDF: 8 pages
Proc. SPIE 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis, 74953P (30 October 2009); doi: 10.1117/12.833175
Show Author Affiliations
Xin Yu, Xidian Univ. (China)
Hui Wang, Xidian Univ. (China)
Licheng Jiao, Xidian Univ. (China)

Published in SPIE Proceedings Vol. 7495:
MIPPR 2009: Automatic Target Recognition and Image Analysis
Tianxu Zhang; Bruce Hirsch; Zhiguo Cao; Hanqing Lu, Editor(s)

© SPIE. Terms of Use
Back to Top