Optimization in space-based pursuit-evasion games through competitive coevolution

Optimization in space-based pursuit-evasion games is often computationally cost prohibitive given the size of the state and action spaces available to both players. Competitive coevolution can be used to augment the optimization process in a manner that results in dynamic search spaces. In competitive coevolution, the two players compete directly with each other and reciprocally drive one another to increasing levels of performance and complexity. This is accomplished by gradually increasing the size and complexity of the strategies available to both players. Using coevolution provides significant computational cost savings compared to traditional optimization methods while ensuring a globally optimal result.