A method of COA based on multi-agent evolutionary algorithm
Lists
Only you see this
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.
BibTeX
@inproceedings{yu2009method,
author = {Xin Yu and Hui Wang and Licheng Jiao},
title = {{A method of COA based on multi-agent evolutionary algorithm}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2009},
doi = {10.1117/12.833175},
}Loading related content...