Robot Pathfinding

[Tresky]

I am competing in a Robotics Competition at the moment. The objective is to program the robot to navigate itself through a city and have it park in specific parking spots at specific buildings around the city. I am creating a program that will find the quickest route through the one-way roads to all of the parking spaces that we need to park at. The only problem is I am having some trouble coming up with how I'm going to get the robot to know which way to turn.
<-- <--
B-------------------R------A
|
|
|
|
|
|
|
C--------------------------

Assume that the robot is at Point R and it has to get around angle ABC. The direction of motion is to the left from the user's point of view. However, the robot itself it still going forward. I need the program to recognize that the turn at point B is going to be a LEFT turn for the robot, but it will be going DOWN on the map. Same with point C. It will need to know that the robot is going to turn LEFT, but will be heading right on the map.

I just can't seem to come up with any ideas.

If you need more information please ask. Any ideas are appreciated.

[kfmfe04]

you need to separate absolute facing (N,E,W,S) from relative direction (R,L)

using the following notation:

current_facing + direction = new_facing
N + R = E
N + L = W
E + R = S
E + L = N
etc...

you should do your best to figure out as much as you can, though - after all, it's a competition - GL!

[Tresky]

Thank you. I'll definitely try that. :)