I would think that it would be simple to have a car drive from A to B, but apparently I haven't been able to figure it out. My goal is to have a car begin at a certain position and angle, calculate the best path to another position with another angle, and then travel there.
Please keep in mind that this car has a minimum turning radius, so it can't simply change angles by spinning. Also, I would like to see what I can do with the car only traveling in a single direction, ie. no reversing.
I have read over many grid-based algorithms, but I don't see how I can translate those to what I need, which is most likely a series of arcs and straight lines.
The closest thing I have have found is Dubins Interval, which seems closest to what I need, though I believe it is old and has probably long since been replaced. I have sketched out paths using this method, but have had trouble translating it to programmatic form (C++). I believe the rough idea is to line up the minimum steering circles of the start and goal, start turning from the start until you are on the line, head towards the goal, and then either simply go onto the goal circle and curve it, or project an additional circle on the same line and use it to end up on the goal circle in the opposite direction.
If anyone knows of any examples, code preferred, of simple car driving path examples, I would appreciate it.