An implementation of the Bug1 Algorithm (as described at http://cs.jhu.edu/~hager/teaching/cs336/notes/chap2-bug-alg.pdf ) in a nice robotic navigation simulator. Essentially, you'll see the robot head toward the goal, and when it encounters an obstacle, it will circle the whole thing, looking for the point nearest to its goal; when it finds it, it will go back there, then depart toward the goal again. My implementation isn't perfect-- this is just a homework assignment-- but I thought the vid...
This is an implementation of the Bug2 Algorithm (as explained here: http://cs.jhu.edu/~hager/teaching/cs336/notes/chap2-bug-alg.pdf ) in a nice robotic simulator. It's not perfect-- I just did this for a homework assignment-- but it works fairly well, and I thought it was neat to watch the robot run around. The essential algorithm is to calculate a straight-line path to the goal right from the start. Then, whenever an obstacle is encountered, the robot follows the obstacle boundary until it re...