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)?
[ Parent
| on HN ]
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.