# sectrix

Member

5

105 Neutral

• Rank
Newbie
1. ## Understanding the D* lite whitepaper

Fantastic. I really appreciate the help. I owe you a pint.
2. ## Understanding the D* lite whitepaper

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) <= (X2, Y2) iff (X1 < X2) OR [X1 = X2 AND Y1 <= Y2]. Have I got it right? And it seems that everywhere in the pseudo code where there is a < with a dot above it represents this lexicographic comparison, correct?
3. ## Understanding the D* lite whitepaper

I see. So the second line is basically: the minimum s' in predecessors of u, as calculated by ( g(s') + c (s', u) ). Excellent, thank you so much for that. One follow up question then. When comparing: U.TopKey < calculateKeys, ie: (X1, Y1) < (X2, Y2), is this (X1 < X2) AND (Y1 < Y2), or (X1 < X2) OR (Y1 < Y2), or something else entirely?
4. ## Understanding the D* lite whitepaper

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 to be far too slow. It takes them about 20 and 13 seconds respectively to find the shortest path along the longer routes. I've come across D* lite as a possible better solution, but there's very little information on the web. Some of what I did find came from here several years ago, so, here's to hoping those members are still around. I found and read Koenig's 2002 paper about it, ([url="http://www.aaai.org/Papers/AAAI/2002/AAAI02-072.pdf"]this[/url] one), and I understand all of the LPA* pseudo code except for two lines: - Calculate keys() In the calculateKeys function, it reads: Return[ min( g(s), rhs(s) ) + h(s, s[sub]goal[/sub]) ; min ( g(s), rhs(s)) ]. What I don't understand is the ; in the middle. Does the function return two values? Does it perform some sort of operation on the results of the two min statements? - Update vertex and rhs calculation The other line I had trouble with was this one: min [sub]s' (is element of) pred(s)[/sub] (g(s'), c(s', s)). I don't get that one at all. The s' in pred() with the smallest g or c? I feel like I'm going to get a lot of blank stares, but, any ideas anyone?