News for hackers. Stuff that matters.
Re:Introduction to A* by vowelless on Tuesday April 15, 2014 @12:13PM (#7592629)
If anyone is interested in robotics, definitely checkout D-star, which is pretty much a dynamic A-star with changing edge weights.

Dijkstra, A-star and D-star all share a similar structure.

Re:Introduction to A* by psycovic23 on Tuesday April 15, 2014 @09:22PM (#7595432)
If you're interested in A* with humanoid robots, check out my post here:

http://victor.hwanger.com/a-technical-peek-into-motion-plann...

Re:Introduction to A* by film42 on Tuesday April 15, 2014 @12:43PM (#7592840)
Can D-star be used to model problems that have some form of random change, ex: While playing 2048, can you model the new random locations as an opponent making decisions (AI driven)?
Re:Introduction to A* by Schwolop on Tuesday April 15, 2014 @07:26PM (#7594960)
In pathological scenarios where the edge weights change near the goal, rather than near the start of the search, D-star and all its backwards-incremental-graph-search variants can be slower than regular A-star. I would only recommend the use of D-star where a) that effect is unlikely or doesn't matter, or b) you can guarantee edge cost changes to occur only near the start of the search - such as a robot with a proprioceptive sensor, which is precisely what the algorithm was designed for.
Re:Introduction to A* by icegreentea on Tuesday April 15, 2014 @02:20PM (#7593425)
You can apply probabilties to your edge weights.

Also, if you were considering D, consider looking at D-Lite. It's an alternate approach to the same problem, and more easily understood/implemented.