A*: Difference between revisions
(Created page with "A* is a popular ([path finding algorithm]) used for finds parsing using stochastic grammars in ([NLP]) ==Definition== A* is mathematically defined as: <math>f(n) = g(n)+h(n)</math> ''n'' is the next node, ''g(n)'' is the cost of the path from the start node to ''n'' and ''h(n)'' is a ({heuristic]) function that estimates the cost of the cheapest path from ''n'' to the goal. A* terminate a path when the path reached its goal or there is no more place to extend") |
m (fixed my mistake with the links, i will be adding more info to this page in the future) |
||
| Line 1: | Line 1: | ||
A* is a popular ([path finding algorithm] | A* is a popular[([path finding algorithm]] used for finds parsing using stochastic grammars in <nowiki>[[NLP]]</nowiki> | ||
==Definition== | ==Definition== | ||
A* is mathematically defined as: | A* is mathematically defined as: | ||
<math>f(n) = g(n)+h(n)</math> | <math>f(n) = g(n)+h(n)</math> | ||
''n'' is the next node, ''g(n)'' is the cost of the path from the start node to ''n'' and ''h(n)'' is a | ''n'' is the next node, ''g(n)'' is the cost of the path from the start node to ''n'' and ''h(n)'' is a <nowiki>[[heuristic]]</nowiki> function that estimates the cost of the cheapest path from ''n'' to the goal. | ||
A* terminate a path when the path reached its goal or there is no more place to extend | A* terminate a path when the path reached its goal or there is no more place to extend | ||
Latest revision as of 19:12, 14 August 2023
A* is a popular[([path finding algorithm]] used for finds parsing using stochastic grammars in [[NLP]]
Definition
A* is mathematically defined as: n is the next node, g(n) is the cost of the path from the start node to n and h(n) is a [[heuristic]] function that estimates the cost of the cheapest path from n to the goal.
A* terminate a path when the path reached its goal or there is no more place to extend