Consistent heuristic
id:
consistent-heuristic-258-14595507
title:
Consistent heuristic
text:
In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour. Formally, for every node N and each successor P of N, the estimated cost of reaching the goal from N is no greater than the step cost of getting to P plus the estimated cost of reaching the goal from P. That is: where I
brand slug:
wiki
category slug:
encyclopedia
description:
Type of heuristic in path-finding problems
original url:
https://en.wikipedia.org/wiki/Consistent_heuristic
date created:
date modified:
2024-04-23T06:58:25Z
main entity:
{"identifier":"Q5163226","url":"https://www.wikidata.org/entity/Q5163226"}
image:
fields total:
13
integrity:
14