🔀 Maze solving algorithm based on A* Search (RoboCup Rescue Maze)
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
_pics
README.md
asterix.pde
maze-solving.pde
path.pde
print.pde
return.pde
sketch.properties
special_case.pde

README.md

Saturday. May 9th, 2015

RoboCup Rescue Maze: A* Search

Emulate a robot in a maze enviroment, finding the best route to move from a point A to a point B. This is possible because of the A* Search Algorithm.

You can see more about the A* Search Algorithm in the book Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig.

Code Running

Youtube Preview

Team

Developed for the RoboCup Rescue Maze Competition.

Raptor B Team: Italo Lelis de Carvalho, João Pedro Rosada Canesin

Instructor: Igor Araujo Dias Santos

Run the code

In order to use a similar language available in the Arduino IDE, this code was made using the sofware sketchbook Processing.

To compile the code, it's recommended to install Processing 2.2.1.

Download Processing