So, here is my problem explained as best as I can. I'm working on some navigation logic for a wheeled vehicle, but I've not the foggiest idea of how to do much path finding, really.
So, my basic idea is that I have 2-3 points (starting and ending, but I also have data for where the NEXT ending point is, if that's useful) and my current heading and I want to know how much I should be turning at any given point.
Note, I will be running this as a program, so I can constantly check my current heading and location, if need be and once I arrive at my next location, I will receive another end point; in other words I should always have my current location and the next two locations unless I am arriving at my final destination on my next movement.
But as far as the mathematics go, I am unsure how to find how much I need to be turning to follow the arc I want to travel along to reach my next point (and hopefully be set up to easily reach the point after)
The end use of this is for a wheeled robot to follow a path, and it cannot turn in place, it must turn as it goes. We can assume this takes place in 2-D.
So, the robot must move at it's current heading, but turn as it goes inorder to reach the next location. So, if it starts at point A, it must drive along a curved path to B, and then from thee drive along another curved path to C, and so on until it reaches the last waypoint on it's path. The waypoints dynamically change as the sensor aboard notice obstacles.
The robot has a maximum turning angle, but that value is unknown as of yet. I need the preliminary code set up to test it.