Dijkstra's(?) Algorithm help

[Ty Tremblay]

Originally Posted by Sparkyshires

Okay, I think I get it. Just a couple questions:

• 1. How would this correlate into a map of line segments?
• 2. How would you go about putting something else in there for the time it may take to turn?
• 3. And what exactly is the a*?

1. I used squares because it was easy to generate the examples with ppt that way. Use intersections of your line segments. Since you're following a magnetic line, I'm assuming you can only turn at intersections, so call those intersections your nodes.

2. Dijkstra's Algorithm explanations use the term "distance" because that's the easiest term to understand when beginning to learn path planning. However, it's important to realize that physical distance is often not the only factor when navigating from point to point. A better term to use is "cost" instead of "distance." This would let you factor in time for turning and even things like energy conservation and a risk factor for getting stuck.

3. hzheng_449 hit the nail on the head. If your algorithm is a bike on training wheels, Dijkstra is without training wheels, and A* is a motorcycle. It's best to learn to ride without training wheels before jumping on a motorcycle.

[Sparkyshires]

Interesting, I've been looking into both, dijkstras more so. Thank's ya'll very much!