This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
Xiaoxun Sun & Sven Koenig's publication on fringe search , that is a publication on 'The Fringe-Saving A* Search Algorithm', a dynamic variant of A* like 'Lifelong Planning A*'(LPA*) is.
Sorry, i may be wrong but it seams this publication is about FSA*. Fringe search is different from FSA*. (cf fringe search beating A* at pathfinding on game map.pdf) —Preceding
unsigned comment added by
78.250.21.122 (
talk) 21:47, 13 December 2010 (UTC)
I changed to ƒ(head) for my usual reasons ("inline", as opposed to "displayed" TeX often fails to fit, being far bigger than the surrounding text and to high or too low and having other formatting problems). But if someone feels this must be set in TeX, then the proper way is
Michael Hardy ( talk) 15:55, 7 July 2009 (UTC)
Is Fringe Search complete? If there is no path to the target, would it necessarily notice, or just churn? —Preceding unsigned comment added by 67.251.4.8 ( talk) 17:31, 8 April 2010 (UTC)
I've changed the pseudo-code:
GiM ( talk) 18:49, 27 October 2011 (UTC)
I have reasons to believe that this article was created by one of the authors of the original paper. This paper has no follow-up and no reproducibility studies. Moreover, it seems to be based on the assumption that a well-optimized A*'s open set needs to be fully sorted. This is false, and thus the 10-40% speed-up claims should be adjusted. This article is misleading, at best. I'll get back to this... -- ASHerAtom ( talk) 11:27, 12 February 2021 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
Xiaoxun Sun & Sven Koenig's publication on fringe search , that is a publication on 'The Fringe-Saving A* Search Algorithm', a dynamic variant of A* like 'Lifelong Planning A*'(LPA*) is.
Sorry, i may be wrong but it seams this publication is about FSA*. Fringe search is different from FSA*. (cf fringe search beating A* at pathfinding on game map.pdf) —Preceding
unsigned comment added by
78.250.21.122 (
talk) 21:47, 13 December 2010 (UTC)
I changed to ƒ(head) for my usual reasons ("inline", as opposed to "displayed" TeX often fails to fit, being far bigger than the surrounding text and to high or too low and having other formatting problems). But if someone feels this must be set in TeX, then the proper way is
Michael Hardy ( talk) 15:55, 7 July 2009 (UTC)
Is Fringe Search complete? If there is no path to the target, would it necessarily notice, or just churn? —Preceding unsigned comment added by 67.251.4.8 ( talk) 17:31, 8 April 2010 (UTC)
I've changed the pseudo-code:
GiM ( talk) 18:49, 27 October 2011 (UTC)
I have reasons to believe that this article was created by one of the authors of the original paper. This paper has no follow-up and no reproducibility studies. Moreover, it seems to be based on the assumption that a well-optimized A*'s open set needs to be fully sorted. This is false, and thus the 10-40% speed-up claims should be adjusted. This article is misleading, at best. I'll get back to this... -- ASHerAtom ( talk) 11:27, 12 February 2021 (UTC)