Anytime A*
id:
anytime-a-191-17809074
title:
Anytime A*
text:
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 quickly generate solutions has made it attractive to Search-base sites and AI designs.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Anytime_A*
date created:
date modified:
2023-07-24T22:19:17Z
main entity:
{"identifier":"Q28456560","url":"https://www.wikidata.org/entity/Q28456560"}
image:
fields total:
13
integrity:
13