NEW METHOD FOR WEIGHTS ASSIGNMENT IN EXTENSION JUDGMENT BASED ON GENETIC ALGORITHMS

2002 ◽  
Vol 38 (supp) ◽  
pp. 238 ◽  
Author(s):  
Haisheng Liu
Keyword(s):  
Genetic Algorithms ◽  
New Method

Enhanced Artificial Intelligent Method for Representing the Photonic Crystal Fiber Profile Index

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud
Keyword(s):  
Genetic Algorithms ◽  
Photonic Crystal ◽  
Photonic Crystal Fiber ◽  
New Method ◽  
Proper Solution ◽  
Artificial Intelligent ◽  
Crystal Fiber ◽  
Fitness Value ◽  
First Pass ◽  
Crossover And Mutation

A new method proposed in this paper to compute the fitness in Genetic Algorithms (GAs). In this new method the number of regions, which assigned for the population, divides the time. The fitness computation here differ from the previous methods, by compute it for each portion of the population as first pass, then the second pass begin to compute the fitness for population that lye in the portion which have bigger fitness value. The crossover and mutation and other GAs operator will do its work only for biggest fitness portion of the population. In this method, we can get a suitable and accurate group of proper solution for indexed profile of the photonic crystal fiber (PCF).

scholarly journals Strategic Team AI Path Plans: Probabilistic Pathfinding

2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computer Games ◽  
Fitness Function ◽  
New Method ◽  
High Quality ◽  
Plan Generation ◽  
Novel Method ◽  
Games And Simulations

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

Design on the Main-Axis in Big Power Inverted Umbrella Aeration Machine Based on Genetic Algorithms

2016 ◽  
Vol 693 ◽  
pp. 84-88
Author(s):  
Xiao Ping Li
Keyword(s):  
Complex System ◽  
Mathematical Model ◽  
Genetic Algorithms ◽  
Optimization Design ◽  
Main Axis ◽  
New Method ◽  
Coding Method ◽  
The Mathematical Model

Genetic Algorithms is a new method, which has good robustness in optimization design for complex system. In this paper, we make the mathematical model of optimization design for the main-axis in big power inverted umbrella aeration machine by studying Genetic Algorithms. Using coding method, we complete the optimization design of the main-axis in big power inverted umbrella aeration machine.

Sign in / Sign up

Export Citation Format

Share Document