|
这是关于一个增强A*算法的资料,有一段文字如下:
one can trace back a shortest path from the Sstart to Sgoal by always
moving from the current vertex s , starting at Sgoal , to any predecessor s` that minimizes g(s`)+c(s`,s) until Sstart is reached (ties can be
broken arbitrarily), similar to what A* can do if it does not use
backpointers.
其中括号里的tie具体是什么意思,不太明白,请教了。 [em5] |
|