Anytime A*
In computer science, anytime A* is a family of variants of the A* search algorithm. Like other anytime algorithms, it has a flexible time cost, can return a valid solution to a pathfinding or graph traversal problem even if it is interrupted before it ends, by generating a fast, non-optimal solution before progressively optimizing it. This ability to spit out quick solutions has made it attractive to Search-base sites and AI designs.
Link from a Wikipage to another Wikipage
primaryTopic
Anytime A*
In computer science, anytime A* is a family of variants of the A* search algorithm. Like other anytime algorithms, it has a flexible time cost, can return a valid solution to a pathfinding or graph traversal problem even if it is interrupted before it ends, by generating a fast, non-optimal solution before progressively optimizing it. This ability to spit out quick solutions has made it attractive to Search-base sites and AI designs.
has abstract
In computer science, anytime A ...... rch-base sites and AI designs.
@en
Wikipage page ID
52,609,984
page length (characters) of wiki page
Wikipage revision ID
1,014,932,186
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In computer science, anytime A ...... rch-base sites and AI designs.
@en
label
Anytime A*
@en