Chris Miles
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chris Miles has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Sushil J. Louis
Department of Computer Science and Engineering University of Nevada Reno Reno Nevada
3 shared publications - Ryan Leigh
Evolutionary Computing Systems Lab, Dept. of Computer Science and Engineering, University of Nevada, Reno
2 shared publications - Juan Carlos Quiroz
Center for Big Data Research, UNSW, Sydney, Australia
1 shared publication
Latest Publications
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 88-95
Co-Evolving Influence Map Tree Based Strategy Game Players
We investigate the use of genetic algorithms to evolve AI players for real-time strategy games. To overcome the knowledge acquisition bottleneck found in using traditional expert systems, scripts, or decision trees we evolve players through co-evolution. Our game players are implemented as resource allocation systems. Influence map trees are used to analyze the game-state and determine promising places to attack, defend, etc. These spatial objectives are chained to non-spatial objectives (train units, build buildings, gather resources) in a dependency graph. Players are encoded within the individuals of a genetic algorithm and co-evolved against each other, with results showing the production of strategies that are innovative, robust, and capable of defeating a suite of hand-coded opponents
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 88-95
Co-Evolving Influence Map Tree Based Strategy Game Players
We investigate the use of genetic algorithms to evolve AI players for real-time strategy games. To overcome the knowledge acquisition bottleneck found in using traditional expert systems, scripts, or decision trees we evolve players through co-evolution. Our game players are implemented as resource allocation systems. Influence map trees are used to analyze the game-state and determine promising places to attack, defend, etc. These spatial objectives are chained to non-spatial objectives (train units, build buildings, gather resources) in a dependency graph. Players are encoded within the individuals of a genetic algorithm and co-evolved against each other, with results showing the production of strategies that are innovative, robust, and capable of defeating a suite of hand-coded opponents
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 72-79
Using a Genetic Algorithm to Explore A*-like Pathfinding Algorithms
We use a genetic algorithm to explore the space of pathfinding algorithms in Lagoon, a 3D naval real-time strategy game and training simulation. To aid in training, Lagoon tries to provide a rich environment with many agents (boats) that maneuver realistically. A*, the traditional pathfinding algorithm in games is computationally expensive when run for many agents and A* paths quickly lose validity as agents move. Although there is a large literature targeted at making A* implementations faster, we want believability and optimal paths may not be believable. In this paper we use a genetic algorithm to search the space of network search algorithms like A* to find new pathfinding algorithms that are near-optimal, fast, and believable. Our results indicate that the genetic algorithm can explore this space well and that novel pathfinding algorithms (found by our genetic algorithm) quickly find near-optimal, more-believable paths in Lagoon
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 72-79
Using a Genetic Algorithm to Explore A*-like Pathfinding Algorithms
We use a genetic algorithm to explore the space of pathfinding algorithms in Lagoon, a 3D naval real-time strategy game and training simulation. To aid in training, Lagoon tries to provide a rich environment with many agents (boats) that maneuver realistically. A*, the traditional pathfinding algorithm in games is computationally expensive when run for many agents and A* paths quickly lose validity as agents move. Although there is a large literature targeted at making A* implementations faster, we want believability and optimal paths may not be believable. In this paper we use a genetic algorithm to search the space of network search algorithms like A* to find new pathfinding algorithms that are near-optimal, fast, and believable. Our results indicate that the genetic algorithm can explore this space well and that novel pathfinding algorithms (found by our genetic algorithm) quickly find near-optimal, more-believable paths in Lagoon
- 1 May 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 75-82
Towards the Co-Evolution of Influence Map Tree Based Strategy Game Players
We investigate the use of genetic algorithms to play real-time computer strategy games. To overcome the knowledge acquisition bottleneck found in using traditional expert systems, scripts, or decision trees we use genetic algorithms to evolve game players. The spatial decision makers in our game players use influence maps as a basic building block from which they construct and evolve trees containing complex game playing strategies. Information from influence map trees is combined with that from an A* pathfinder, and used by another genetic algorithm to solve the allocation problems present within many game decisions. As a first step towards evolving strategic players we develop this system in the context of a tactical game. Results show the co-evolution of coordinated attacking and defending strategies superior to their hand-coded counterparts
- 1 May 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 75-82
Towards the Co-Evolution of Influence Map Tree Based Strategy Game Players
We investigate the use of genetic algorithms to play real-time computer strategy games. To overcome the knowledge acquisition bottleneck found in using traditional expert systems, scripts, or decision trees we use genetic algorithms to evolve game players. The spatial decision makers in our game players use influence maps as a basic building block from which they construct and evolve trees containing complex game playing strategies. Information from influence map trees is combined with that from an A* pathfinder, and used by another genetic algorithm to solve the allocation problems present within many game decisions. As a first step towards evolving strategic players we develop this system in the context of a tactical game. Results show the co-evolution of coordinated attacking and defending strategies superior to their hand-coded counterparts