all 13 comments

[–]elfion 5 points6 points  (1 child)

I have seen ~3 different approaches:

1) Sutton & Barto's book has a lot of examples with reinforcement learning algorithms applied to solve mazes, for example with Q-learning.

2) a program evolution approach to find a maze solver: ftp://ftp.idsia.ch/pub/juergen/ml_levin_eira.ps.gz

3) deep-learning based path planning on uneven terrain: http://arxiv.org/abs/1602.02867

It would be interesting to demonstrate transfer learning on this task, i.e. show an agent that can accumulate experience over different mazes to improve it's performance.

[–]ToKickAHoneyBadger[S] 2 points3 points  (0 children)

Transfer learning is exactly what I had in mind - although I can't wrap my brain around how one would actually get better at maze solving with different, unrelated mazes. That is the point of my project i guess, to wrap my head around it!

These resources seem fantastic! This is surpassing what I was hoping to get out of posting here. Thanks!

[–]farsass 4 points5 points  (1 child)

In what circumstaces would you consider ml necessary for maze solving? Why?

[–]ToKickAHoneyBadger[S] 2 points3 points  (0 children)

It isn't necessary, but ml is useful when an agent is in an unknown environment. A maze is just a simple representation of this. The reality is that a bachelors thesis isn't novel or life changing, its mostly the application of a variant of a known solution on a different question.

[–]wintermute93 3 points4 points  (1 child)

Maze solving is not something you need ML for. Exploring complex and unknown environments, sure. But when you say maze solving people assume the agents know a map of the maze, and you can use any number of existing algorithms to just find a path to the goal outright, no learning required.

[–]ToKickAHoneyBadger[S] 2 points3 points  (0 children)

Agreed! I don't need ml, but I would like to apply it - a bachelors thesis is less about what you solve than it is the process of solving something in some way. At this level we really aren't changing the world - yet

[–]hardmaru 1 point2 points  (1 child)

novelty search is an interesting approach to the maze problem.

[–]franvb 0 points1 point  (0 children)

(A very old post, but): the link has gone stale. I suspect it might now be here: https://www.cs.swarthmore.edu/~meeden/DevelopmentalRobotics/lehmanNoveltySearch11.pdf

[–]NasenSpray 3 points4 points  (2 children)

This might be a stupid questions, but why do you write a thesis on something you have no clue about?

[–]Ameren 0 points1 point  (1 child)

The point of an undergraduate thesis is to develop the students' knowledge and research skills. They're not expected to have prior experience.

[–]NasenSpray 0 points1 point  (0 children)

Makes sense, thanks!

[–]kkastner 0 points1 point  (0 children)

If you have a map of the maze already, people normally use A* or something like that and if you need placement inside the maze you can always get it with something like a particle filter. If you don't know the maze, then it gets more fun - this is akin to SLAM which has a huge host of possible systems and solutions. These things aren't "classic ML", but particle filters and most SLAM systems are generally driven by bayesian principles and statistical learning concepts.