Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Consistent_heuristic> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Consistent_heuristic abstract "In the study of path-finding problems in artificial intelligence, a consistent (or monotone) heuristic function is a function that estimates the distance of a given state to a goal state, and that is always at most equal to the estimated distance from any neighboring vertex plus the step cost of reaching that neighbor.Formally, for every node N and every successor P of N generated by any action a, 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. In other words: and where h is the consistent heuristic function N is any node in the graph P is any descendant of N G is any goal node c(N,P) is the cost of reaching node P from NA consistent heuristic is also admissible, i.e. it never overestimates the cost of reaching the goal (the opposite however is not always true!). This is proved by induction on , the length of the best path from node to goal. By assumption, , where denotes the cost of the shortest path from n to the goal. Therefore,,making it admissible. (is any node whose best path to the goal, of length m+1, goes through some immediate child whose best path to the goal is of length m.)However, an admissible heuristic , can be made into a consistent heuristic, , through the following adjustment: (Known as the pathmax equation.)".
- Consistent_heuristic thumbnail Heuristics_Comparison.png?width=300.
- Consistent_heuristic wikiPageID "9304783".
- Consistent_heuristic wikiPageRevisionID "593180792".
- Consistent_heuristic hasPhotoCollection Consistent_heuristic.
- Consistent_heuristic subject Category:Heuristics.
- Consistent_heuristic type Abstraction100002137.
- Consistent_heuristic type Act100030358.
- Consistent_heuristic type Activity100407535.
- Consistent_heuristic type Event100029378.
- Consistent_heuristic type Heuristic105847956.
- Consistent_heuristic type Heuristics.
- Consistent_heuristic type Procedure101023820.
- Consistent_heuristic type PsychologicalFeature100023100.
- Consistent_heuristic type Rule105846932.
- Consistent_heuristic type YagoPermanentlyLocatedEntity.
- Consistent_heuristic comment "In the study of path-finding problems in artificial intelligence, a consistent (or monotone) heuristic function is a function that estimates the distance of a given state to a goal state, and that is always at most equal to the estimated distance from any neighboring vertex plus the step cost of reaching that neighbor.Formally, for every node N and every successor P of N generated by any action a, 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. ".
- Consistent_heuristic label "Consistent heuristic".
- Consistent_heuristic sameAs m.0283rqd.
- Consistent_heuristic sameAs Q5163226.
- Consistent_heuristic sameAs Q5163226.
- Consistent_heuristic sameAs Consistent_heuristic.
- Consistent_heuristic wasDerivedFrom Consistent_heuristic?oldid=593180792.
- Consistent_heuristic depiction Heuristics_Comparison.png.
- Consistent_heuristic isPrimaryTopicOf Consistent_heuristic.
