Understanding the D* lite whitepaper
Forum Reply
14 years, 3 months ago
Highlights
Understanding the D* lite whitepaper
Forum Reply
14 years, 3 months ago
Understanding the D* lite whitepaper
Forum Reply
14 years, 3 months ago
I'm writing a tool for a game I play, and I've found I need a good pathfinding algorithm. I've already written an A* and a Dijkstra routine, but I've found them…
14 years, 3 months ago
Fantastic. I really appreciate the help. I owe you a pint.
14 years, 3 months ago
OK, I had it backwards then. It's the minimum of ( g(s') + c(s', u) ) as calculated with all s' in predecessors of u. And the key comparison is: (X1, Y1) <= (…
14 years, 3 months ago
Latest Activity
See all in DiscussionsFantastic. I really appreciate the help. I owe you a pint.
14 years, 3 months ago
OK, I had it backwards then. It's the minimum of ( g(s') + c(s', u) ) as calculated with all …
14 years, 3 months ago
I see. So the second line is basically: the minimum s' in predecessors of u, as calculated by ( g(s') …
14 years, 3 months ago
Badges
Conversation Opener
Decade Member
5-Year Veteran
1-Year Veteran
Spotlight
Jack-of-Trades
View all badges →