A blind Pacman hunts ghosts with a particle filter and a greedy search
algorithm. At each update step, Pacman "listens" for the ghosts and
receives noisy data of their locations. Pacman then distributes
particles throughout the maze and moves towards where he thinks the
closest ghost is. The brighter the square is, the particles there are
on that square and the higher the probability the ghost is there. If
Pacman runs out of particles for any ghost, he starts over and resets
all of the particles. I worked on this with Yue Chang Hu as part of a
project for the UC Berkeley class "CS188: Artificial Intelligence".
That's a cool visualization. There are too many papers in the world, not enough demo videos. i pointed a couple of my students to it. You should post a link to a paper so they can learn more
baylorw 10 months ago