Implement pathfinding algorithms described in test environments

[Cazadorro]

I want to write another page outlining how to implement all of these algorithms in real code, this is not attached to whether or not the robot functions with this code, my plan is to create a basic terminal representation for maps and grids and possibly a generator, and then implement these path-finding algorithms on these structures. This page will outline the ideas behind implementing the data-structures and physical code constructs needed to implement and test the algorithms defined in the path-finding page. Hopefully this will then lend itself to aid in the production of the robots real code which will simply integrate the last algorithm, field D* lite with the current ROS structure.