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 gen...
详细信息
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
Game environments provide a good domain for serious simulations such as those used in training navy conning officers. Currently, a typical training scenario requires multiple personnel to play each of the boats and th...
详细信息
Game environments provide a good domain for serious simulations such as those used in training navy conning officers. Currently, a typical training scenario requires multiple personnel to play each of the boats and thus is expensive. We propose an approach to addressing this issue by developing intelligent, autonomous controllers for each boat. Significant challenges toward achieving these goals are the realism of behavior exhibited by the automated boats and their realtime response to change. In this paper we describe a control architecture that enables the real-time response of boats and the repertoire of realistic behaviors we developed for this application. We demonstrate the capabilities of our system with experimental results
The problem of designing recurrent continuous-time and spiking neural networks is NP-Hard. A common practice is to utilize stochastic searches, such as evolutionary algorithms, to automatically construct acceptable ne...
详细信息
The problem of designing recurrent continuous-time and spiking neural networks is NP-Hard. A common practice is to utilize stochastic searches, such as evolutionary algorithms, to automatically construct acceptable networks. The outcome of the stochastic search is related to its ability to navigate the search space of neural networks and discover those of high quality. In this paper we investigate the search space associated with designing the above recurrent neural networks in order to differentiate which network should be easier to automatically design via a stochastic search. Our investigation utilizes two popular dynamic systems problems; (1) the Henon map and (2) the inverted pendulum as a benchmark.
作者:
Mohamed, FAoued, BDepartment of Computer Science
Evolutionary Engineering and Distributed Information Systems Laboratory EEDIS University of Sidi Bel-Abbès Algeria Department of Electronics
Communications Networks Architectures and Multimedia Laboratory University of Sidi Bel Abbès Algeria
The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation t...
The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation time have led to a bad-quality or a lower compression ratio. For example, the Fisher's [ 7] proposed classification pattern greatly accelerated the algorithm, but image quality was poor due to the search-space reduction imposed by the classification, which eleminates a lot of good solutions. By using genetic algorithms to address the problem, we optimize the domain blocks search. We explore all domain blocks present in the image but not in exhaustive way ( like a standard algorithm) and without omitting any possible block (solution) as a classification pattern does. A genetic algorithm is the unique method for satisfying these constraints. And it is a way to do be a random search because the genetic one is directed by fitness selection, which produces optimal solutions. Our goal in this work is to use a genetic algorithm to solve the IFS inverse problem and to build a fractal compression algorithm based on the genetic optimization of a domain blocks search. we have also implemented standard Barnsley algorithm, the Y. Fisher based on classification, and the genetic compression algorithm with quadtree partitioning. A population of transformations was evolved for each range block, and the result is compared with the standard Barnsely algorithm and the Fisher algorithm = based classification. We deduced an optimal set of values for the best parameters combination, and we can also specify the best combination for each desired criteria: best compression ratio, best image quality, or quick compression process. By running many test images, we experimentally found the following set of optimal values of all the algorithm parameters that ensure compromise between execution time and solutions optimality: Population size = 100, Maximum generations = 20, Crossover rat
Current computer applications and user interfaces lack user context and are not successful in learning user preferences to improve user interaction. We present Sycophant, a context learning calendaring application pro...
详细信息
Current computer applications and user interfaces lack user context and are not successful in learning user preferences to improve user interaction. We present Sycophant, a context learning calendaring application program which is designed to learn a mapping from user-related contextual features to reminder actions. In this paper, we consider the feasibility of using a genetics-based machine learning technique, XCS, for the purpose of learning this mapping from a set of context features to reminder actions as a predictive data-mining task. We compare XCS's performance with a decision tree algorithm on this learning task and show that XCS outperforms the decision tree learner.
Current computer applications lack user context and do not learn to use this context to improve user interaction. In this paper we present Sycophant, a context learning calendar application program which learns a mapp...
详细信息
Current computer applications lack user context and do not learn to use this context to improve user interaction. In this paper we present Sycophant, a context learning calendar application program which learns a mapping from user-related contextual features to application actions. In this preliminary work, Sycophant achieves good accuracy in learning this mapping. In addition, we find that including external context such as the presence or absence of motion and speech provides better performance in learning accurate mappings.
This document demonstrates how a face recognition system can be designed with artificial neural network. Note that the training process did not consist of a single call to a training function. Instead, the network was...
详细信息
This document demonstrates how a face recognition system can be designed with artificial neural network. Note that the training process did not consist of a single call to a training function. Instead, the network was trained several times on various input ideal and noisy images, the images that contents faces. In this case training a network on different sets of noisy images forced the network to learn how to deal with noise, a common problem in the real world.
Recent significant advances in artificial intelligence have led to the emergence of new concepts of soft computing genetic programming, evolutionaryengineering, hybrid intelligent systems, and artificial life. EE des...
详细信息
ISBN:
(纸本)0769511651
Recent significant advances in artificial intelligence have led to the emergence of new concepts of soft computing genetic programming, evolutionaryengineering, hybrid intelligent systems, and artificial life. EE design relies on evolutionary algorithms to construct or evolve complex systems. This paper is intended to highlight the concept of evolutionaryengineering, the motivations behind the use of EE in building complex systems, and a step by step methodology for designing such systems. Finally, we emphasize on a typical example of "Brain Building design project using EE: the CAM Brain Machine.
暂无评论