Referenced Items are not available for this document.
Fast algorithm for path planning is helpful for artificial intelligence. Genetic Algorithm (GA) is a typical evolution method, used widely in path planning. A new GA based on path network is proposed in this paper. Efficient chromosome encoding strategy provided guarantees, and each chromosome represents a feasible path, avoiding the searching circulation. Variation happens at certain positions, making the algorithm assemble quickly. Experimental result shows that the GA combining with path network can plan path quickly. By means of path cells, it works efficiently to produce multi path simultaneously.
Published in:
Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on
Date of Conference: 13-15 Dec. 2010
- Page(s):
- 194 - 197
- E-ISBN :
- 978-0-7695-4281-2
- Print ISBN:
- 978-1-4244-8891-9
- INSPEC Accession Number:
- 11835503
- Conference Location :
- Shenzhen
- Digital Object Identifier :
- 10.1109/ICGEC.2010.55
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
