Evolving sparse direction maps for maze pathfinding

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 835-838

  Gordon, V Scott ^a   Matley, Zach ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b Digital Eclipse Software Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FINE-GRAINED PROBLEMS; MAZE PATHFINDING; SIMPLE GENETIC ALGORITHM (SGA); SPARSE DIRECTION MAPS;

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; PARAMETER ESTIMATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTER SCIENCE;

EID: 4344648043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Dijkstra, E., "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik 1, pp. 269-271 (1959)
2. Berg, A., "Genetic Algorithm - Maze Solver," (2003) http://www.sambee.co.th/MazeSolver/mazega.htm, 1996
3. Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1975
4. Gordon, V. and Slocum, T., "The Knight's Tour -Evolutionary vs. Depth-First Search," 2004 Congress on Evolutionary Computation, Portland, Oregon.
5. Gordon, V., Whitley, D., and Böhm, W., "Serial and Parallel Genetic Algorithms as Function Optimizers," 5th International Conference on Genetic Algorithms, Urbana-Champaign, Illinois, pp. 229-235, 1993