Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm

Lu Si Liu

doi:10.4028/www.scientific.net/AMM.687-691.1250

Paper Titles

Positive Solution of Nonlinear Two-Order Three-Point Boundary Value Problem for Difference Equation with Change of Sign
p.1232

A Hierarchical Bayesian Model for Text Corpora
p.1237

A Path Clearance Optimization Method Based on Retraction Algorithm for Motion Planning
p.1241

Evaluation Method Research Based on Fuzzy Gravity Center
p.1245

Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm
p.1250

Research and Application of Data Mining(DM) in the Analysis of Postgraduate Admission Information
p.1254

Research on Optimization and Application of LOD Algorithm in Virtual Reality Visualization of Terrain
p.1258

Research on the Role and Characteristics of Computer in Mathematical Modeling
p.1262

The Application of Data Mining Technology in the Data Analysis of Traditional Chinese Medicine
p.1266

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 687-691Research on Application of the Shortest Path in...

Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm

Abstract:

Nowadays, the game industry has entered a period of vigorous development, each game artificial intelligence has become the indispensable one element, so a good design can be seen as the soul of game, in almost all games have a kind of be good to hear or see appearance, the soul is attracted to the core game player. In this paper, the genetic algorithm becomes a new random search and optimization algorithm, the basic idea of the theory of evolution based on Darwin and Mendel genetics. Genetic algorithm for solving multi objective and complexity with the unpredictable nature of the problem, there is there is nothing comparable to this superiority. The shortest path problem of network is abstracted to a minimum spanning tree problem and the limitations of the minimum spanning tree are analyzed. The notion of the node degree is introduced.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 687-691)

Pages:

1250-1253

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.687-691.1250

Citation:

Cite this paper

Online since:

November 2014

Authors:

Lu Si Liu*

Keywords:

Application, Improved Genetic Algorithm, Shortest Path

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Stout Bryan. The Basics of A* for Path Planning. Game Programming Gem. Charles River Media, 2005, 254 - 263.

Google Scholar

[2] Vadim Bulitko and Mitja Lustrek. Dynamic control in real-time heuristic search. Journal of Artificial Intelligence Research, 2008, 32: 419-452.

DOI: 10.1613/jair.2497

Google Scholar

[3] Daniel Harabor and Adi Botea. Hierarchical path planning for mufti-size agents in heterogeneous environments. IEEE Symposium on Computational Intelligence and Games, 2008, 258-265.

DOI: 10.1109/cig.2008.5035648

Google Scholar

[4] Xu M. L, Pan. Z.G. and H.X. Lu, et al. Moving-target pursuit algorithm using improved tracking strategy. IEEE transactions on computational intelligence and in games, 2010, 2(1): 27-38.

DOI: 10.1109/tciaig.2010.2042449

Google Scholar

[5] Norio Baba, S.Q. Wang. Utilization of Neural Networks& Genetic Algorithms in order to Let Game Playing Much More Exciting. Proceeding Of ISAGA 2003, Kazusa Japan, Aug. 25-29, 2003. pp.1059-1068.

Google Scholar

[6] Kenny Daniel, Alex Nash and Sven Koenig. Theta*: Any-Angle path planning on grids. Journal of Artificial Intelligence Research, 2010, 39: 533-579.

DOI: 10.1613/jair.2994

Google Scholar