Clustering for Improved Learning in Maze Traversal Problem

Details Clustering for Improved Learning in Maze Traversal Problem Clustering for Improved Learning in Maze Traversal Problem

2009-08-06

arxiv.org/abs/0908.0939v1

Computer Science

Learning

29 pages, 15 figures, Undergraduate Honors Thesis

Scientific paper

The maze traversal problem (finding the shortest distance to the goal from any position in a maze) has been an interesting challenge in computational intelligence. Recent work has shown that the cellular simultaneous recurrent neural network (CSRN) can solve this problem for simple mazes. This thesis focuses on exploiting relevant information about the maze to improve learning and decrease the training time for the CSRN to solve mazes. Appropriate variables are identified to create useful clusters using relevant information. The CSRN was next modified to allow for an additional external input. With this additional input, several methods were tested and results show that clustering the mazes improves the overall learning of the traversal problem for the CSRN.

Affiliated with

Also associated with

No associations

Rating

Clustering for Improved Learning in Maze Traversal Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering for Improved Learning in Maze Traversal Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering for Improved Learning in Maze Traversal Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706551